Dirty-Paper trellis-code watermarking with orthogonal arcs

Authors:
Taekyung Kim;Taesuk Oh;Yong Cheol Kim;Seongjong Choi
Affiliations:
Department of Electrical and Computer Eng, University of Seoul, Korea;Department of Electrical and Computer Eng, University of Seoul, Korea;Department of Electrical and Computer Eng, University of Seoul, Korea;Department of Electrical and Computer Eng, University of Seoul, Korea
Venue:
PSIVT'06 Proceedings of the First Pacific Rim conference on Advances in Image and Video Technology
Year:
2006

Citing 5
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
Information-theoretic analysis of information hiding

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

IEEE Transactions on Image Processing

Quantified Score

Hi-index	0.00

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 which entails many Viterbi decodings through random convergence. We present a fast deterministic embedding in a trellis-code with orthogonal arcs. The proposed algorithm has a speedup factor of the message size since it is based on arc-level modification of the cover work in a bit-by-bit manner. Experimental results show that the proposed embedding provides higher fidelity and lower BER against various types of attacks, compared with conventional informed methods.