Title :
QIM watermarking games
Author :
Goteti, Anil Kumar ; Moulin, Pierre
Author_Institution :
ECE Dept., Illinois Univ., Urbana, IL, USA
Abstract :
Quantization Index Modulation (QIM) methods are widely used for blind data embedding and watermarking. Given a QIM watermarking code, we ask what is the attacker´s noise distribution that maximizes probability of error of the detector. For memoryless attacks, the problem is reduced to a convex programming problem. Next, we derive QIM code parameters that are minmax optimal.
Keywords :
convex programming; data encapsulation; error statistics; minimax techniques; modulation coding; quantisation (signal); watermarking; QIM code parameter; attacker noise distribution; blind data embedding; convex programming; error probability detection; minmax optimal; quantization index modulation; watermarking game; Additive noise; Additive white noise; Detectors; Gaussian noise; Lattices; Minimax techniques; Quantization; Random variables; Spread spectrum communication; Watermarking;
Conference_Titel :
Image Processing, 2004. ICIP '04. 2004 International Conference on
Print_ISBN :
0-7803-8554-3
DOI :
10.1109/ICIP.2004.1419398
