On Information Embedding When Watermarks and Covertexts Are Correlated

A new digital watermarking scenario is studied, where a watermark M correlated with a covertext S is to be transmitted by embedding M into S. The configuration of this scenario is different from that treated in existing digital watermarking works, where watermarks are assumed independent of covertexts. Assume that the pair (M, S) is drawn from an independently and identically distributed sequence. A necessary and sufficient condition is derived under which the watermark M can be recovered with high probability at the end of a watermark decoder after the watermarked signal is disturbed by a fixed memoryless attack channel pY|X(y|x). Specifically, it is shown that in the case of public watermarking where the covertext S is not accessible to the watermark decoder, M can be recovered with high probability if and only if H(M) les maxp(x,u|m,s):Ed(S,X)lesD[I(U);M,S) - I(U; M, S) + I(M;U,Y)], where the maximum is taken over all auxiliary random variables U and X jointly distributed with M and S and satisfying Ed(S, X) les D. In particular, the result implies that the Shannon separation theorem can not be extended to this scenario, that is, it is still possible to transmit M reliably even when H(M) is strictly greater than the watermarking capacity. A similar result is also established for combined source coding and Gel'fand Pinsker channel coding

[1]  Ingemar J. Cox,et al.  Information Transmission and Steganography , 2005, IWDW.

[2]  Neri Merhav On random coding error exponents of watermarking systems , 2000, IEEE Trans. Inf. Theory.

[3]  E. Yang,et al.  Joint watermarking and compression using scalar quantization for maximizing robustness in the presence of additive Gaussian attacks , 2005 .

[4]  Zhou Wang,et al.  Quality-aware images , 2006, IEEE Transactions on Image Processing.

[5]  Gregory W. Wornell,et al.  Quantization index modulation: A class of provably good methods for digital watermarking and information embedding , 2001, IEEE Trans. Inf. Theory.

[6]  Ton Kalker,et al.  Coding Theorems for Reversible Embedding , 2003, Advances in Network Information Theory.

[7]  Kannan Ramchandran,et al.  Duality between source coding and channel coding and its extension to the side information case , 2003, IEEE Trans. Inf. Theory.

[8]  Jack K. Wolf,et al.  Noiseless coding of correlated information sources , 1973, IEEE Trans. Inf. Theory.

[9]  Neri Merhav,et al.  On joint information embedding and lossy compression in the presence of a stationary memoryless attack channel , 2004, IEEE Transactions on Information Theory.

[10]  Damianos Karakos,et al.  A relationship between quantization and watermarking rates in the presence of additive Gaussian attacks , 2003, IEEE Trans. Inf. Theory.

[11]  Joseph A. O'Sullivan,et al.  Information-theoretic analysis of information hiding , 2003, IEEE Trans. Inf. Theory.

[12]  Amos Lapidoth,et al.  The Gaussian watermarking game , 2000, IEEE Trans. Inf. Theory.

[13]  Neri Merhav,et al.  On the error exponent and capacity games of private watermarking systems , 2003, IEEE Trans. Inf. Theory.