Algorithms for Computing Joint Compression and Private Watermarking Rate Regions

Based on the idea of the Blahut-Arimoto algorithm for computing channel capacities and rate-distortion functions, two iterative algorithms are developed for numerical computation of the compression and watermarking rate regions of joint compression and private watermarking systems with finite alphabets. The convergence of the algorithms developed is also proved

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

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

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

[4]  Chein-I Chang,et al.  On calculating the capacity of an infinite-input finite (infinite)-output channel , 1988, IEEE Trans. Inf. Theory.

[5]  Ingemar J. Cox,et al.  Digital Watermarking , 2003, Lecture Notes in Computer Science.

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

[7]  Imre Csiszár,et al.  On the computation of rate-distortion functions (Corresp.) , 1974, IEEE Trans. Inf. Theory.

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

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

[10]  Pascal O. Vontobel,et al.  A generalized Blahut-Arimoto algorithm , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..

[11]  Alex J. Grant,et al.  Computation of total capacity for discrete memoryless multiple-access channels , 2004, IEEE Transactions on Information Theory.

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

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