Fast informed embedding in dirty-paper trellis-code with orthogonal arcs

Dirty-paper trellis-code watermarking with random-valued arcs is slow since the embedding into the cover work is performed on path-level and Viterbi decoding is repeated for the embedding of each bit. We present a fast informed embedding in dirty-paper trellis-code with orthogonal arcs. The proposed deterministic algorithm has a speedup factor of the message size since just arc-level modification of the cover work is enough for the embedding of each additional data bit. In addition to the speedup, experimental results also show that the proposed embedding provides higher fidelity and lower BER against various types of attacks, compared with other conventional informed watermarking methods.