Information-theoretic resolution of perceptual WSS watermarking of non i.i.d Gaussian signals

The theoretical foundations of data hiding have been revealed by formulating the problem as message communication over a noisy channel. We revisit the problem in light of a more general characterization of the watermark channel and of weighted distortion measures. Considering spread spectrum based information hiding, we release the usual assumption of an i.i.d. cover signal. The game-theoretic resolution of the problem reveals a generalized characterization of optimum attacks. The paper then derives closed-form expressions for the different parameters exhibiting a practical embedding and extraction technique.

[1]  Joseph A. O'Sullivan,et al.  Information-theoretic analysis of watermarking , 2000, 2000 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings (Cat. No.00CH37100).

[2]  Pierre Moulin,et al.  The Watermark Selection Game , 2001 .

[3]  F. Bartolini,et al.  Threshold Selection for Correlation-based Watermark Detection , 1998 .

[4]  Wenjun Zeng,et al.  Image-adaptive watermarking using visual models , 1998, IEEE J. Sel. Areas Commun..

[5]  Bernd Girod,et al.  Digital Watermarking facing Attacks by Amplitude Scaling and Additive White Noise , 2002 .

[6]  Bernd Girod,et al.  Power-spectrum condition for energy-efficient watermarking , 1999, Proceedings 1999 International Conference on Image Processing (Cat. 99CH36348).

[7]  Kannan Ramchandran,et al.  Capacity issues in digital image watermarking , 1998, Proceedings 1998 International Conference on Image Processing. ICIP98 (Cat. No.98CB36269).

[8]  Bernd Girod,et al.  Analysis of digital watermarks subjected to optimum linear filtering and additive noise , 2001, Signal Process..

[9]  Ingemar J. Cox,et al.  Secure spread spectrum watermarking for multimedia , 1997, IEEE Trans. Image Process..