Robust and secure image watermarking algorithm resisting JPEG compression and cropping based on Reed Solomon (RS) codes

Robust and secure image watermarking algorithm resisting JPEG compression and cropping based on Reed Solomon (RS) codes

연구 분야: Cryptography

학회: Signal, Image and Video Processing

In this paper, we propose an approach based on Reed–Solomon (RS) codes and chaotic sequences to improve the security and robustness of watermarking schemes. First, the watermarked image bits and the chaotic sequence bits are combined to form an information matrix, the Reed–Solomon (RS) code is used to generate the coding matrix, after which the parity bits are embedded into the image. The original image is divided into non-overlapping blocks, which are applied to the discrete cosine transform to obtain the DCT coefficients. For each block, its four immediate neighbors are flagged, and the corresponding intra-block coefficients are selected based on the flags. The differences are then computed to embed the bits. The coefficient selection strategy of the block corresponds to the texture complexity of the image. The RS codes offer excellent error correction capabilities, enhancing the robustness of the watermarking scheme, while the combination with chaotic sequences ensures security. Experimental results show that the proposed algorithm is robust to common image processing attacks and is particularly strong against local cropping and JPEG compression attacks compared to existing schemes. Moreover, the proposed watermarking scheme is secure.