An Informed Watermarking Scheme Using Hidden Markov Model in the Wavelet Domain

Achieving robustness, imperceptibility and high capacity simultaneously is of great importance in digital watermarking. This paper presents a new informed image watermarking scheme with high robustness and simplified complexity at an information rate of 1/64 bit/pixel. Firstly, a Taylor series appro...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on information forensics and security 2012-06, Vol.7 (3), p.853-867
Hauptverfasser: Wang, Chuntao, Ni, Jiangqun, Huang, Jiwu
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Achieving robustness, imperceptibility and high capacity simultaneously is of great importance in digital watermarking. This paper presents a new informed image watermarking scheme with high robustness and simplified complexity at an information rate of 1/64 bit/pixel. Firstly, a Taylor series approximated locally optimum test (TLOT) detector based on the hidden Markov model (HMM) in the wavelet domain is developed to tackle the problem of unavailability of exact embedding strength in the receiver due to informed embedding. Then based on the TLOT detector and the concept of dirty-paper code design, new HMM-based spherical codes are constructed to provide an effective tradeoff between robustness and distortion. The process of informed embedding is formulated as an optimization problem under the robustness and distortion constraints and the genetic algorithm (GA) is then employed to solve this problem. Moreover, the perceptual distance in the wavelet domain is also developed and incorporated into the GA-based optimization. Simulation results demonstrate that the proposed informed watermarking algorithm has high robustness against common attacks in signal processing and shows a comparable performance to the state-of-the-art scheme with a greatly reduced arithmetic complexity.
ISSN:1556-6013
1556-6021
DOI:10.1109/TIFS.2012.2188797