On the Optimal Structure of Watermark Decoders Under Desynchronization Attacks

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.

• Type: Conference
• Year: 2006
• Where: ICIP
• Authors: Pierre Moulin
• Keywords: Difficult Problem, Fundamental Limitations, ICIP 2006, Image Processing, Nonblind Watermarking