Paper
20 June 2003 Exhaustive geometrical search and the false positive watermark detection probability
Author Affiliations +
Proceedings Volume 5020, Security and Watermarking of Multimedia Contents V; (2003) https://doi.org/10.1117/12.503186
Event: Electronic Imaging 2003, 2003, Santa Clara, CA, United States
Abstract
One way of recovering watermarks in geometrically distorted images is by performing a geometrical search. In addition to the computational cost required for this method, this paper considers the more important problem of false positives. The maximal number of detections that can be performed in a geometrical search is bounded by the maximum false positive detection probability required by the watermark application. We show that image and key dependency in the watermark detector leads to different false positive detection probabilities for geometrical searches for different images and keys. Furthermore, the image and key dependency of the tested watermark detector increases the random-image-random-key false positive detection probability, compared to the Bernoulli experiment that was used as a model.
© (2003) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Jeroen F. Lichtenauer, Iwan Setyawan, Ton Kalker, and Reginald L. Lagendijk "Exhaustive geometrical search and the false positive watermark detection probability", Proc. SPIE 5020, Security and Watermarking of Multimedia Contents V, (20 June 2003); https://doi.org/10.1117/12.503186
Lens.org Logo
CITATIONS
Cited by 57 scholarly publications and 2 patents.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Digital watermarking

Sensors

Transform theory

Distortion

Image filtering

Image sensors

Information technology

Back to Top