An Approach Using Hidden Markov Model to Design A Robust Watermarking Scheme
M. J. P. Jarwin, S. Priyatharsini · 2014
This project proposes a new data-hiding method based on Hidden Markov Model. The basic idea of Hidden Markov Model is to use the values of pixel pair as a reference coordinate, and search a coordinate in the neighbourhood set of this pixel pair according to a given message digit. The pixel pair is then replaced by the searched coordinate to conceal the digit. The proposed method offers lower distortion by providing more compact neighbourhood sets and allowing embedded digits in any notational system. 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. By the existing method we have to perform Image Embedding in secure and effective manner. To avoid artifacts in effective manner we have to apply Adaptive Histogram Equalization as proposed method. Index Terms: Adaptive Histogram Equalization, Hidden Markov Model, Genetic Algorithm.