Asymptotically Optimum Universal One-Bit Watermarking for Gaussian Covertexts and Gaussian Attacks - Computer Science > Information TheoryReportar como inadecuado




Asymptotically Optimum Universal One-Bit Watermarking for Gaussian Covertexts and Gaussian Attacks - Computer Science > Information Theory - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

Abstract: The problem of optimum watermark embedding and detection was addressed in arecent paper by Merhav and Sabbag, where the optimality criterion was themaximum false-negative error exponent subject to a guaranteed false-positiveerror exponent. In particular, Merhav and Sabbag derived universalasymptotically optimum embedding and detection rules under the assumption thatthe detector relies solely on second order joint empirical statistics of thereceived signal and the watermark. In the case of a Gaussian host signal and aGaussian attack, however, closed-form expressions for the optimum embeddingstrategy and the false-negative error exponent were not obtained in that work.In this paper, we derive such expressions, again, under the universalityassumption that neither the host variance nor the attack power are known toeither the embedder or the detector. The optimum embedding rule turns out to bevery simple and with an intuitively-appealing geometrical interpretation. Theimprovement with respect to existing sub-optimum schemes is demonstrated bydisplaying the optimum false-negative error exponent as a function of theguaranteed false-positive error exponent.



Autor: P. Comesaña, N. Merhav, M. Barni

Fuente: https://arxiv.org/







Documentos relacionados