Watermarks embedded in the permuted image

In this paper, a new invisible watermark embedding scheme is proposed. First, the original binary watermark is transformed according to a chaotic binary sequence and the original image is permuted according to the same sequence. Then, the transformed watermark is used to modify the 3rd, 4th, or 5th bit of the corresponding pixels in the permuted image. Finally, the permuted and watermarked image is depermuted and the result is obtained. The features of the scheme are as follows. (1) The scheme is strongly resistant to detection and decoding if the parameters of the chaotic system are unknown. (2) The scheme is more insensitive to noise and resistant to compression. Moreover, the MATLAB simulation results have demonstrated that (1) the embedded watermark does not degrade the quality of the image and the PSNRs are about 45. (3) The extracted watermarks are still readily recognizable when the JPEG compression rate reaches 39%