Paper
21 March 2005 Applying Erez and Ten Brink's dirty paper codes to data hiding
Author Affiliations +
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.
© (2005) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Pedro Comesana, Fernando Perez-Gonzalez, and Frans M. J. Willems "Applying Erez and Ten Brink's dirty paper codes to data hiding", Proc. SPIE 5681, Security, Steganography, and Watermarking of Multimedia Contents VII, (21 March 2005); https://doi.org/10.1117/12.587769
Lens.org Logo
CITATIONS
Cited by 5 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Distortion

Computer programming

Digital watermarking

Signal to noise ratio

Data hiding

Quantization

Forward error correction

RELATED CONTENT


Back to Top