Universal decoding of watermarks under geometric 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. We model the attack channel as the cascade of a memoryless channel and a smooth, invertible mapping T 0 , θ ⊂ Θ n , representing the geometric attack. The decoder does not known the value of 0. We show that under regularity conditions, there exists a universal decoder for this problem, and we explicitly identify it.

Original languageEnglish (US)
Title of host publicationProceedings - 2006 IEEE International Symposium on Information Theory, ISIT 2006
Pages2353-2357
Number of pages5
DOIs
StatePublished - Dec 1 2006
Event2006 IEEE International Symposium on Information Theory, ISIT 2006 - Seattle, WA, United States
Duration: Jul 9 2006Jul 14 2006

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8101

Other

Other2006 IEEE International Symposium on Information Theory, ISIT 2006
CountryUnited States
CitySeattle, WA
Period7/9/067/14/06

    Fingerprint

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Information Systems
  • Modeling and Simulation
  • Applied Mathematics

Cite this

Moulin, P. (2006). Universal decoding of watermarks under geometric attacks. In Proceedings - 2006 IEEE International Symposium on Information Theory, ISIT 2006 (pp. 2353-2357). [4036391] (IEEE International Symposium on Information Theory - Proceedings). https://doi.org/10.1109/ISIT.2006.262009