Applying Erez and ten Brink's dirty paper codes to data-hiding

Pedro Comesaña, Fernando Pérez-González, Frans M.J. Willems

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

3 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationSecurity, Steganography, and Watermarking of Multimedia Contents VII
EditorsEdward J. Delp, Ping W. Wong
PublisherSPIE
Pages298-307
Number of pages10
DOIs
Publication statusPublished - 21 Jul 2005
EventSecurity, Steganography, and Watermarking of Multimedia Contents VII - San Jose, United States
Duration: 21 Apr 200521 Apr 2005

Publication series

NameProceedings of SPIE
PublisherSPIE
Volume5681
ISSN (Print)0277-786X

Conference

ConferenceSecurity, Steganography, and Watermarking of Multimedia Contents VII
Country/TerritoryUnited States
CitySan Jose
Period21/04/0521/04/05
OtherPart of: 2005 SPIE and IS&T Electronic Imaging Conference

Fingerprint

Dive into the research topics of 'Applying Erez and ten Brink's dirty paper codes to data-hiding'. Together they form a unique fingerprint.

Cite this