Share Email Print

Proceedings Paper

Exhaustive geometrical search and the false positive watermark detection probability
Format Member Price Non-Member Price
PDF $17.00 $21.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper 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.

Paper Details

Date Published: 20 June 2003
PDF: 12 pages
Proc. SPIE 5020, Security and Watermarking of Multimedia Contents V, (20 June 2003); doi: 10.1117/12.503186
Show Author Affiliations
Jeroen F. Lichtenauer, Delft Univ. of Technology (Netherlands)
Iwan Setyawan, Delft Univ. of Technology (Netherlands)
Ton Kalker, Philips Research Labs. (Netherlands)
Reginald L. Lagendijk, Delft Univ. of Technology (Netherlands)

Published in SPIE Proceedings Vol. 5020:
Security and Watermarking of Multimedia Contents V
Edward J. Delp III; Ping Wah Wong, Editor(s)

© SPIE. Terms of Use
Back to Top