On joint information embedding and lossy compression

In this paper, the best achievable tradeoffs between /spl Delta/, R/sub e/ and R/sub c/, that maintain reliable estimation of V is characterized. The attack-free version of the public problem of joint information embedding and entropy coding, where the covertext, the watermark and the stegotext are drawn from finite alphabets. It is possible to attribute a different watermark to each codebook, and thus, the watermark can be correctly retrieved according to the codebook to which the composite sequence belongs. The achievable rate region can also be expressed in terms of the maximum achievable embedding capacity. The watermark by the joint typicality property of the decompressed composite sequence with the source sequence and the watermark are evaluated.

[1]  A.A.C.M. Kalker,et al.  Methods for Reversible Embedding , 2002 .

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

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

[4]  Damianos Karakos,et al.  A Relationship between Quantization and Distribution Rates of Digitally Fingerprinted Data , 2000 .

[5]  Claude E. Shannon,et al.  Channels with Side Information at the Transmitter , 1958, IBM J. Res. Dev..

[6]  Neri Merhav,et al.  Identification in the presence of side information with application to watermarking , 2001, IEEE Trans. Inf. Theory.

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

[8]  T. Berger.  Rate-Distortion Theory , 2003 .

[9]  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.

[10]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[11]  Edward J. Delp,et al.  Watermark embedding: hiding a signal within a cover image , 2001, IEEE Commun. Mag..

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

[13]  Neri Merhav,et al.  On joint information embedding and lossy compression , 2005, IEEE Transactions on Information Theory.

[14]  Markus G. Kuhn,et al.  Information hiding-a survey , 1999, Proc. IEEE.

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

[16]  Max H. M. Costa,et al.  Writing on dirty paper , 1983, IEEE Trans. Inf. Theory.

[17]  Ross J. Anderson,et al.  On the limits of steganography , 1998, IEEE J. Sel. Areas Commun..

[18]  Ahmed H. Tewfik,et al.  Multimedia data-embedding and watermarking technologies , 1998, Proc. IEEE.

[19]  Ingemar J. Cox,et al.  Watermarking as communications with side information , 1999, Proc. IEEE.