Paper
22 June 2004 Adaptive quantization watermarking
Author Affiliations +
Abstract
Although quantization index modulation (QIM) schemes are optimal from an information theoretic capacity-maximization point of view, their robustness may be too restricted for widespread practical usage. Most papers assume that host signal samples are identically distributed from a single source distribution and therefore, they do not need to consider local adaptivity. In practice there may be however several reasons for introducing locally varying watermark parameters. In this paper, we study how the Scalar Costa Scheme (which we take as a representative member of the class of QIM schemes) can be adapted to achieve practical levels of robustness and imperceptibility. We do this by choosing the basic watermark parameters on the basis of a perceptual model. An important aspect is the robustness of the statistic on which the adaptation rule is based. The detector needs to be able to accurately re-estimate the value of the parameters as used by the embedder, even in the presence of strong channel noise. One way to achieve this is to base the adaptation rule on an aggregate of the pixel values in a neighborhood around the relevant pixel. We present an analysis of the robustness-locality trade-off, based on a model for the bit error probability.
© (2004) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Job C. Oostveen, Ton Kalker, and Marius Staring "Adaptive quantization watermarking", Proc. SPIE 5306, Security, Steganography, and Watermarking of Multimedia Contents VI, (22 June 2004); https://doi.org/10.1117/12.526586
Lens.org Logo
CITATIONS
Cited by 48 scholarly publications and 5 patents.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Quantization

Digital watermarking

Error analysis

Distortion

Sensors

Interference (communication)

Modulation

RELATED CONTENT


Back to Top