Orthogonal dirty paper coding for informed data hiding

Proceedings of SPIE - The International Society for Optical Engineering

Volumn 5306, Issue , 2004, Pages 274-285

  Abrardo, Andrea ^a   Barni, Mauro ^a  

^a UNIVERSITY OF SIENA   (Italy)

Author keywords

Dirty paper coding; Informed embedding; Informed watermarking; Orthogonal codes; Spherical codes

Indexed keywords

CODES (SYMBOLS); COMPUTER SIMULATION; DATA REDUCTION; DECODING; DIGITAL WATERMARKING; MONTE CARLO METHODS; OPTICAL CORRELATION;

DIRTY PAPER CODING; INFORMED EMBEDDING; INFORMED WATERMARKING; ORTHOGONAL CODES; SPHERICAL CODES;

IMAGE CODING;

EID: 8844258031     PISSN: 0277786X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1117/12.524345     Document Type: Conference Paper

References (17)

1. I. J. Cox, M. L. Miller, and A. L. McKellips, "Watermarking as communications with side information," Proceedings of the IEEE 87, pp. 1127-1141, July 1999.
2. S. I. Gelf and and M. S. Pinsker, "Coding for channel with random parameters," Problems of Control and Information Theory 9(1), pp. 19-31, 1980.
3. M. H. M. Costa, "Writing on dirty paper," IEEE Trans. on Information Theory 29, pp. 439-441, May 1983.
4. P. Moulin and J. A. O'Sullivan, "Information-theoretic analysis of information hiding," in Proc. IEEE Int. Symposium on Information Theory, p. 19, (Sorrento, Italy), June 2000.
5. P. Moulin, "The role of information theory in watermarking and its application to image watermarking," Signal Processing 81(6), pp. 1121-1139, 2001.
6. B. Chen and G. Wornell, "Quantization index modulation: a class of provably good methods for digital watermarking and information embedding," IEEE Trans. on Information Theory 47, pp. 1423-1443, May 2001.
7. A. S. Cohen and A. Lapidoth, "The Gaussian watermarking game," IEEE Trans. on Information Theory 48, pp. 1639-1667, June 2002.
8. J. J. Eggers, R. Bäuml, R. Tzschoppe, and B. Girod, "Scalar Costa scheme for information embedding," IEEE Trans. on Signal Processing 4, April 2003.
9. F. Perez-Gonzalez, F. Balado, and J. R. Hernandez, "Performance analysis of existing and new methods for data hiding with known-host information in additive channels," IEEE Trans. on Signal Processing 51, pp. 960-980, April 2003.
10. I. J. C. M. L. Miller, G. J. Doerr, "Dirty-paper trellis codes for watermarking," in Proc. 9th IEEE Int. Conf. on Image Processing, ICIP'02, II, pp. 129-132, (Rochester, NY), September 2002.
11. M. L. Miller, G. J. Doerr, and I. J. Cox, "Applying informed coding and embedding to design a robust, high capacity, watermark," IEEE Trans. on Image Processing. To appear.
12. J. G. Proakis, Digital Communications, 2nd Edition, McGraw-Hill, New York, 1989.
13. R. Gold, "Optimal binary sequences for spread spectrum multiplexing," IEEE Trans. on Information Theory 13, pp. 619-621, October 1967.
14. C. Berrou, A. Glavieux, and P. Thitimajshima, "Near shannon limit error-correcting coding and decoding: Turbo-codes," in Proceedings of ICC, IEEE International Conference on Communications, pp. 1064-1070, (Geneva, Switzerland), May 1993.
15. J. H. Conway and N. J. A. Sloane, Sphere Packings, Lattices, and Groups, Springer-Verlag, New York, 1988.
16. J. Hamkins and K. Zeger, "Asymptotically dense spherical codes - part I: wrapped spherical codes," IEEE Trans. on Information Theory 43, pp. 1774-1785, November 1997.
17. J. Hamkins and K. Zeger, "Asymptotically dense spherical codes - part II: laminated spherical codes," IEEE Trans. on Information Theory 43, pp. 1786-1798, November 1997.