Computing the probability of false watermark detection

57Citations
Citations of this article
64Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Several methods of watermarkde tection involve computing a vector from some input media, computing the normalized correlation between that vector and a predefined watermarkv ector, and comparing the result against a threshold. We show that, if the probability density function of vectors that arise from random, unwatermarked media is a zero-mean, spherical Gaussian, then the probability that such a detector will give a false detection is given exactly by a simple ratio of two definite integrals. This expression depends only on the detection threshold and the dimensionality of the watermarkv ector.

Cite

CITATION STYLE

APA

Miller, M. L., & Bloom, J. A. (2000). Computing the probability of false watermark detection. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1768, pp. 146–158). Springer Verlag. https://doi.org/10.1007/10719724_11

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free