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

Authors:
Taekyung Kim;Taesuk Oh;Yong Cheol Kim
Affiliations:
Univ. of Seoul, Seoul, Korea;Univ. of Seoul, Seoul, Korea;Univ. of Seoul, Seoul, Korea
Venue:
Proceedings of the 4th ACM international workshop on Contents protection and security
Year:
2006

Citing 4
Cited 0

Digital watermarking

Digital watermarking
Fixed-Distortion orthogonal dirty paper coding for perceptual still image watermarking

IH'04 Proceedings of the 6th international conference on Information Hiding
Informed watermarking by means of orthogonal and quasi-orthogonal dirty paper coding

IEEE Transactions on Signal Processing
Applying informed coding and embedding to design a robust high-capacity watermark

IEEE Transactions on Image Processing

Quantified Score

Hi-index	0.01

Visualization

Abstract

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.