Optimum decoding of non-additive full frame DFT watermarks

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

Abstract

The problem of optimum watermark recovery in a non additive, non Gaussian framework is addressed. Watermark casting is carried out on the frequency domain according to an additive-multiplicative rule. The structure of the optimum decoder is derived based on statistical decision theory. The Neyman-Pearson criterion is used to minimize the probability of missing the watermark for a given false detection rate. Experimental results highlights the superiority of the novel detector scheme with respect to conventional correlation-based decoding.

Cite

CITATION STYLE

APA

De Rosa, A., Barni, M., Bartolini, F., Cappellini, V., & Piva, A. (2000). Optimum decoding of non-additive full frame DFT watermarks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1768, pp. 159–171). Springer Verlag. https://doi.org/10.1007/10719724_12

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