Share Email Print

Proceedings Paper

Applying Erez and Ten Brink's dirty paper codes to data hiding
Author(s): Pedro Comesana; Fernando Perez-Gonzalez; Frans M. J. Willems
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

Structured codes are known to be necessary in practical implementations of capacity-approaching "dirty paper schemes." In this paper we study the performance of a recently proposed dirty paper technique, by Erez and ten Brink which, to the authors' knowledge, is firstly applied to data-hiding, and compare it with other existing approaches. Specifically, we compare it with conventional side-informed schemes previously used in data-hiding based on repetition and turbo coding. We show that a significant improvement can be achieved using Erez and ten Brink's proposal. We also study the considerations we have to take into account when these codes are used in data-hiding, mainly related with perceptual questions.

Paper Details

Date Published: 21 March 2005
PDF: 10 pages
Proc. SPIE 5681, Security, Steganography, and Watermarking of Multimedia Contents VII, (21 March 2005); doi: 10.1117/12.587769
Show Author Affiliations
Pedro Comesana, Univ. de Vigo (Spain)
Fernando Perez-Gonzalez, Univ. de Vigo (Spain)
Frans M. J. Willems, Technische Univ. Eindhoven (Netherlands)

Published in SPIE Proceedings Vol. 5681:
Security, Steganography, and Watermarking of Multimedia Contents VII
Edward J. Delp; Ping W. Wong, Editor(s)

© SPIE. Terms of Use
Back to Top