Error exponents for watermarking game with squared-error constraints
Conference Paper
Overview
Additional Document Info
View All
Overview
abstract
An overview is given of an error-exponent game for the following two popular systems: spread-spectrum (SS) watermarking with nearest-neighbor decoding, and quantization-index-modulation (QIM) watermarking with lattice decoding. It is shown that in both systems, the optimal attack has the same distribution. A closed-form expression for the error is also given.