Share Email Print

Proceedings Paper

Asymptotically optimum embedding strategy for one-bit watermarking under Gaussian attacks
Author(s): Pedro Comesaña; Neri Merhav; Mauro Barni
Format Member Price Non-Member Price
PDF $14.40 $18.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

The problem of asymptotically optimum watermark detection and embedding has been addressed in a recent paper by Merhav and Sabbag where the optimality criterion corresponds to the maximization of the false negative error exponent for a fixed false positive error exponent. In particular Merhav and Sabbag derive the optimum detection rule under the assumption that the detector relies on the second order statistics of the received signal (universal detection under limited resources), however the optimum embedding strategy in the presence of attacks and a closed formula for the negative error exponents are not available. In this paper we extend the analysis by Merhav and Sabbag, by deriving the optimum embedding strategy under Gaussian attacks and the corresponding false negative error exponent. The improvement with respect to previously proposed embedders are shown by means of plots.

Paper Details

Date Published: 18 March 2008
PDF: 12 pages
Proc. SPIE 6819, Security, Forensics, Steganography, and Watermarking of Multimedia Contents X, 681909 (18 March 2008); doi: 10.1117/12.771991
Show Author Affiliations
Pedro Comesaña, Univ. of Vigo (Spain)
Neri Merhav, Technion-Israel Institute of Technology (Israel)
Mauro Barni, Univ. of Siena (Italy)

Published in SPIE Proceedings Vol. 6819:
Security, Forensics, Steganography, and Watermarking of Multimedia Contents X
Edward J. Delp III; Ping Wah Wong; Jana Dittmann; Nasir D. Memon, Editor(s)

© SPIE. Terms of Use
Back to Top