Information embedding with reversible stegotext

Information embedding is the transmission of an independent data embedded into a host signal via a noisy channel. Reversible information embedding (RIE) extends this model by adding the requirement of decoding the host signal. In some applications however, this requirement is too strong. For example, if the user is interested in decoding the data and further transmitting the stegotext, i.e. the result of the embedding of independent data into the host, then full decoding of the host is not needed, only re-production of the stegotext. This work expands the study of information embedding channels by adding the requirement of retrieving the stegotext at the destination. A single-letter characterization of the achievable rate-distortion region is developed. In particular, it is shown that a rate higher than the RIE rate can be achieved, under the (more relaxed) requirement of stegotext decoding. Two examples are solved, and an iterative algorithm that computes numerically the capacity is provided.

[1]  Ton Kalker,et al.  Capacity bounds and constructions for reversible data-hiding , 2003, IS&T/SPIE Electronic Imaging.

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

[3]  Suguru Arimoto,et al.  An algorithm for computing the capacity of arbitrary discrete memoryless channels , 1972, IEEE Trans. Inf. Theory.

[4]  Raymond W. Yeung,et al.  A First Course in Information Theory (Information Technology: Transmission, Processing and Storage) , 2006 .

[5]  Zixiang Xiong,et al.  Computing the channel capacity and rate-distortion function with two-sided state information , 2005, IEEE Transactions on Information Theory.

[6]  Yossef Steinberg.  Coding for Channels With Rate-Limited Side Information at the Decoder, With Applications , 2006, IEEE Transactions on Information Theory.

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

[8]  Wei Yu,et al.  Blahut-Arimoto algorithms for computing channel capacity and rate-distortion with side information , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[9]  J. Nicholas Laneman,et al.  Reversible Information Embedding in Multi-User Channels ∗ , 2005 .

[10]  Richard E. Blahut,et al.  Computation of channel capacity and rate-distortion functions , 1972, IEEE Trans. Inf. Theory.

[11]  Abbas El Gamal,et al.  On the capacity of computer memory with defects , 1983, IEEE Trans. Inf. Theory.

[12]  Raymond W. Yeung,et al.  A First Course in Information Theory , 2002 .

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

[14]  Yossef Steinberg.  Reversible Information Embedding with Compressed Host at the Decoder , 2006, 2006 IEEE International Symposium on Information Theory.