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.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 717-720 |
| Number of pages | 4 |
| Journal | Proceedings - International Conference on Image Processing, ICIP |
| Volume | 5 |
| State | Published - 2004 |
| Event | 2004 International Conference on Image Processing, ICIP 2004 - , Singapore Duration: Oct 18 2004 → Oct 21 2004 |
ASJC Scopus subject areas
- General Engineering