On joint information embedding and lossy compression

We consider the problem of optimum joint information embedding and lossy compression with respect to a fidelity criterion. The goal is to find the minimum achievable compression (composite) rate R/sub c/ as a function of the embedding rate R/sub e/ and the average distortion level /spl Delta/ allowed, such that the average probability of error in decoding of the embedded message can be made arbitrarily small for sufficiently large block length. We characterize the minimum achievable composite rate for both the public and the private versions of the problem and demonstrate how this minimum can be approached in principle. We also provide an alternative single-letter expression of the maximum achievable embedding rate (embedding capacity) as a function of R/sub c/ and /spl Delta/, above which there exist no reliable embedding schemes.

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

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

[3]  Marten van Dijk,et al.  Capacity and codes for embedding information in gray-scale signals , 2005, IEEE Transactions on Information Theory.

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

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

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

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

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

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

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

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

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

[13]  Damianos Karakos Digital Watermarking, Fingerprinting and Compression: An Information-Theoretic Perspective , 2002 .

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

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

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

[17]  Neri Merhav,et al.  On joint information embedding and lossy compression , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

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

[19]  Gregory W. Wornell,et al.  The duality between information embedding and source coding with side information and some applications , 2003, IEEE Trans. Inf. Theory.

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

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

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

[23]  Toby Berger,et al.  Rate distortion theory : a mathematical basis for data compression , 1971 .

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