Joint data hiding and source coding with partially available side information

Channel Coding with Side Information at the encoder(CCSI) can be visualized as a blind watermarking problem: the original host signal for embedding the watermark is known at the encoder but not at the decoder. Similarly, the Rate Distortion with Side Information at the decoder(RDSI) is known as distributed source coding: the rate distortion limits of an input source if a noisy observation of that source is available only at the decoder. There is a strong duality between CCSI and RDSI for the gaussian case. We propose a system that exploits the generalized versions of the two information theoretical dualities of CCSI and RDSI together within a unique setup. The question is "Can we combine these two separated dual problems (blind watermarking and distributed source coding) within a single problem?". The proposed scheme can be viewed as "Watermarking or Data Hiding within Distributed Source Coding". The setup contains the cascade of the generalized versions of CCSI and RDSI where there exists two different side information, one available only at the encoder and the other at the decoder. The preliminary experimental results are given using the theoretical findings of the duality problem.

[1]  R. Urbanke,et al.  Asynchronous Slepian-Wolf coding via source-splitting , 1997, Proceedings of IEEE International Symposium on Information Theory.

[2]  Aaron D. Wyner,et al.  The rate-distortion function for source coding with side information at the decoder , 1976, IEEE Trans. Inf. Theory.

[3]  B. Girod,et al.  Illustration of the duality between channel coding and rate distortion with side information , 2000, Conference Record of the Thirty-Fourth Asilomar Conference on Signals, Systems and Computers (Cat. No.00CH37154).

[4]  Mung Chiang,et al.  Duality between channel capacity and rate distortion with two-sided state information , 2002, IEEE Trans. Inf. Theory.

[5]  R. A. McDonald,et al.  Noiseless Coding of Correlated Information Sources , 1973 .

[6]  Kannan Ramchandran,et al.  Distributed source coding: symmetric rates and applications to sensor networks , 2000, Proceedings DCC 2000. Data Compression Conference.

[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]  Aaron D. Wyner,et al.  Coding Theorems for a Discrete Source With a Fidelity CriterionInstitute of Radio Engineers, International Convention Record, vol. 7, 1959. , 1993 .

[9]  Robert G. Gallager,et al.  Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.

[10]  J. Chou,et al.  On the duality between distributed source coding and data hiding , 1999, Conference Record of the Thirty-Third Asilomar Conference on Signals, Systems, and Computers (Cat. No.CH37020).

[11]  Robert M. Gray,et al.  Encoding of correlated observations , 1987, IEEE Trans. Inf. Theory.

[12]  Radford M. Neal,et al.  Near Shannon limit performance of low density parity check codes , 1996 .

[13]  Bernd Girod,et al.  Compression with side information using turbo codes , 2002, Proceedings DCC 2002. Data Compression Conference.

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