Optimal image watermark decoding

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

Abstract

Not much has been done in utilizing the available information at the decoder to optimize the decoding performance of watermarking systems. This paper focuses on analyzing different decoding methods, namely, Minimum Distance, Maximum Likelihood and Maximum a-posteriori decoding given varying information at the decoder in the blind detection context. Specifically, we propose to employ Markov random fields to model the prior information given the embedded message is a structured logo. The application of these decoding methods in Quantization Index Modulation systems shows that the decoding performance can be improved by Maximum Likelihood decoding that exploits the property of the attack and Maximum a-posteriori decoding that utilizes the modeled prior information in addition to the property of the attack. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Lu, W., Li, W., Safavi-Naini, R., & Ogunbona, P. (2006). Optimal image watermark decoding. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4261 LNCS, pp. 141–149). Springer Verlag. https://doi.org/10.1007/11922162_17

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