TY - GEN
T1 - Universal decoding of watermarks under geometric attacks
AU - Moulin, Pierre
N1 - Copyright:
Copyright 2013 Elsevier B.V., All rights reserved.
PY - 2006
Y1 - 2006
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=39049087600&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=39049087600&partnerID=8YFLogxK
U2 - 10.1109/ISIT.2006.262009
DO - 10.1109/ISIT.2006.262009
M3 - Conference contribution
AN - SCOPUS:39049087600
SN - 1424405041
SN - 9781424405046
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 2353
EP - 2357
BT - Proceedings - 2006 IEEE International Symposium on Information Theory, ISIT 2006
T2 - 2006 IEEE International Symposium on Information Theory, ISIT 2006
Y2 - 9 July 2006 through 14 July 2006
ER -