A novel algorithm for embedding and detecting digital watermarks

In this paper, a novel algorithm is proposed to embed and detect digital watermarks. It is different from other algorithms, because the algorithm embeds digital bits in the relationship among pixels, whereas most other algorithms embed digital bits in terms of pixel position. In the embedding phase one discrete chaotic map is used to create random sequences to encrypt watermarking bits, the other discrete chaotic map is used to permute the original image. Watermarking detection resorts to looking for a path with the minimal distance like the Viterbi algorithm, and it is performed without the original image. Experimental results show that the algorithm can effectively resist the influence of Gaussian noise, JPEG compression, cropping operation, and can recover the original watermarks well.