On the optimal structure of watermark decoders under desynchronization attacks

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Designing watermarking codes that can withstand geometric and other desynchronization attacks is a notoriously difficult problem. One may ask whether these difficulties are due to limitations of current codes, or rather to fundamental limitations on achievable performance. This paper describes our recent results on this problem for blind and nonblind watermarking, and provides examples for which the theory applies.

Original languageEnglish (US)
Title of host publication2006 IEEE International Conference on Image Processing, ICIP 2006 - Proceedings
Pages2589-2592
Number of pages4
DOIs
StatePublished - 2006
Event2006 IEEE International Conference on Image Processing, ICIP 2006 - Atlanta, GA, United States
Duration: Oct 8 2006Oct 11 2006

Publication series

NameProceedings - International Conference on Image Processing, ICIP
ISSN (Print)1522-4880

Other

Other2006 IEEE International Conference on Image Processing, ICIP 2006
CountryUnited States
CityAtlanta, GA
Period10/8/0610/11/06

Keywords

  • Data hiding
  • Decoding
  • Desynchronization
  • Image processing
  • Information theory
  • Watermarking

ASJC Scopus subject areas

  • Software
  • Computer Vision and Pattern Recognition
  • Signal Processing

Fingerprint Dive into the research topics of 'On the optimal structure of watermark decoders under desynchronization attacks'. Together they form a unique fingerprint.

Cite this