Abstract
Probability-of-error exponents have recently been derived for watermarking systems based on spread-spectrum and quantization-index modulation methods. This paper takes this work one step further and presents minmax error exponents for any embedding scheme and any attack (subject to distortion constraints) at all rates below capacity. The decoders used are universal: they do not know the attack used. Randomized codes outperform deterministic codes, except in the case of memoryless attacks where the same performance is obtained using either kind of code.
| Original language | English (US) |
|---|---|
| Article number | 31 |
| Pages (from-to) | 308-317 |
| Number of pages | 10 |
| Journal | Proceedings of SPIE - The International Society for Optical Engineering |
| Volume | 5681 |
| DOIs | |
| State | Published - 2005 |
| Event | Proceedings of SPIE-IS and T Electronic Imaging - Security, Steganography, and Watermarking of Multimedia Contents VII - San Jose, CA, United States Duration: Jan 17 2005 → Jan 20 2005 |
Keywords
- Coding
- Game theory
- Probability of error
- Randomized codes
- Universal decoding
- Watermarking
ASJC Scopus subject areas
- Electronic, Optical and Magnetic Materials
- Condensed Matter Physics
- Computer Science Applications
- Applied Mathematics
- Electrical and Electronic Engineering