Abstract
The work aims to put forward an improved watermarking algorithm with strong robustness based on CS to improve the anti-attack capability of watermarking algorithm. In order to ensure the uniform distribution of embedded watermark information in the carrier, the Rij, Gij and Bij were obtained from N×N non-repetitive blocking of R, G and B of color carrier image. According to the principle of different subscript values, the embedded blocks were randomly selected from each of the three color categories. In order to improve the watermark robustness and the success rate of detection, the strategy of cyclic embedding of watermark information was adopted. The watermark embedding and extracting process were described in details. The proposed algorithm was compared with other three algorithms through simulation. The process of extracting the embedded watermark without the original image achieved a blind detection. The strategy of cyclic embedding of watermark greatly improved the watermark robustness and the success rate of watermark detection. The experimental results of simulation demonstrated that, the reconstructed watermark image had less distortion and the proposed algorithm could resist a series of geometric attacks. With better robustness and visual insensitivity, the proposed watermarking algorithm is easy to realize, which has certain reference value in copyright protection, information security and other fields.
Cite this article
Download Citations
SHI Hong-qin, YU Ying, WANG Yan.
An Improved Watermarking Algorithm with Strong Robustness Based on CS[J]. Packaging Engineering. 2019(15): 230-236 https://doi.org/10.19554/j.cnki.1001-3563.2019.15.037
{{custom_sec.title}}
{{custom_sec.title}}
{{custom_sec.content}}