Multiple watermarking algorithm based on chaotic sequences

Abstract

Listen

Translate article

Multiple digital watermarking technique can resolve the problems of multiple copyright claim and keep the traces of digital products in the different phase of publishing, selling and using. In this paper, a multiple digital watermarking algorithm based on chaotic sequences is proposed. The chaotic sequences have the advantages of massive, high security, and weakest correlation. The massive and independent digital watermark signals are generated through 1-D chaotic maps, which are determined by different initial conditions and parameters. The chaotic digital watermark signals effectively resolve the construction of massive watermarks with good performance. The capacity of the multiple watermarking is also analyzed in this paper. The length of the watermark can be selected adaptively according to the number of the watermarks. Multiple digital watermarking algorithm is more complex than the single watermarking algorithm in the embedding method. The principal problem is how to ensure that the late-coming watermark will not damage the embedded watermarks. Each watermark is added to the middle frequency coefficients of wavelet domain randomly by exploiting 2-D chaotic system, so the embedding and extracting of each watermark does not disturbed each other. Thinking of the parameters of 2-D chaotic system as the key to embedding procedure can prevent the watermarks to be removed malevolently, therefore the performance of security is better. The embedding algorithm based on noise analysis and wavelet transform is also exploited in this paper. To meet the transparence and robustness of the watermark, the watermark strength is adapted to the noise strength within the tolerance of wavelet coefficients. The experimental results demonstrate that this proposed algorithm is robust to many common attacks and the performance can satisfy the requirements in the application.