Robust digital watermarking based on chaotic maps

Based on chaotic maps, a novel robust watermarking algorithm is presented in this paper. The proposed approach improves the invisibility, robustness and security of traditional watermarking algorithm by using chaotic sequences. Taking advantage of the characteristics of extreme sensitivity to initial conditions, Chebyshev maps are used to generate substantially different watermarks as a key. This technique has been shown to offer an added security advantage over the more traditionally generated watermarks created from pseudorandom sequences, in that only the function seed needs to be stored. Various kinds of images are selected as watermark images in order to prove the fidelity of the proposed scheme. Simulation of the algorithm is performed on different types of images, and the results are compared with existing algorithms. Results show that the proposed scheme is simple and applicable, and can resist many attacks such as JPEG compression, rotation, cropping and noising.