Conference Paper

Image Watermarking based on Genetic Algorithm.

Hebei Normal University, Chentow, Hebei, China
DOI: 10.1109/ICME.2006.262731 Conference: Proceedings of the 2006 IEEE International Conference on Multimedia and Expo, ICME 2006, July 9-12 2006, Toronto, Ontario, Canada
Source: DBLP

ABSTRACT In order to improve the robustness and imperceptibleness of the image spread spectrum watermark algorithm, a new approach for optimization in 8×8 DCT domain using genetic algorithm (GA) was proposed. GA was used to choose the AC coefficients, which were modified to embed the spread spectrum watermark. The bands were varied to find the most suitable for image with different characteristics. Performance improvement with respect to existing algorithm is obtained by GA adaptive global search. The experimental results show that the proposed algorithm yields a watermark that is invisible to human eyes and robust to various image manipulation, and show that some special positions are the best choices for embedding the watermark. The authors also compare their experimental results with the results of the previous work of others.

1 Bookmark
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: This paper proposes a new optimization method for digital images in the Discrete Wavelet Transform (DWT) domain. Digital image watermarking has proved its efficiency in protecting illegal authentication of data. The amplification factor of the watermark is the significant parameter that helps in improving the perceptual transparency and robustness against attacks. The tradeoff between the transparency and robustness is considered as an optimization problem and is solved by applying Genetic Algorithm. The experimental results of this approach prove to be secure and robust to filtering attacks, additive noise, rotation, scaling, cropping and JPEG compression. The Peak Signal to Noise Ratio (PSNR), Mean Square Error (MSE), and computational time are evaluated for a set of images obtained from the Tampere University of Technology, Finland using the MATLAB R2008b software.
  • [Show abstract] [Hide abstract]
    ABSTRACT: In today's era of digital information, protection of intellectual property rights is of great concern. Watermarking is one technique which is used to protect against illicit copy and distribution of digital information. In this paper we propose a novel technique for embedding watermarks in digital images that takes inspiration from the Bee Algorithm. The Bee Algorithm is a fairly new evolutionary algorithm that exploits the food foraging behavior of honey bees which enables them to search for best quality flower patches over large distances. Our Algorithm mimics this behavior of bees to embed watermark in the wavelet domain such that the resultant image is highly imperceptible as well as robust. Simulation results show that our proposed technique consumes far less time in comparison to other classical evolutionary algorithms.
    Multitopic Conference (INMIC), 2011 IEEE 14th International; 01/2011
  • [Show abstract] [Hide abstract]
    ABSTRACT: Imperceptibility or quality for digital image watermarking represents one of the most important requirements for any digital watermarking system. Many studies try to enhance the quality by using different techniques and methods. In this study, Genetic Algorithm (GA) method is used to embed two bits of watermarking data within every pixel of original image and to find the optimal value based on the existing Dual Intermediate Significant Bit (DISB). However, if the two embedded bits is equal to the original bits then this means the watermarked image is still the same as the original one without any changing, while in the other case GA is used getting the minimum fitness value in which the fitness is the absolute value between the pixel and chromosome and the value of chromosome between 0-255. The results show that the new method improves the image quality and get the optimal value for the two embedded bits.
    Advanced Computer Science Applications and Technologies (ACSAT), 2012 International Conference on; 01/2012


Available from