A Robust Zero-Watermarking Algorithm Based on Chaotic Array
一种基于混沌阵列的鲁棒零水印算法

This paper presents a robust zero-watermarking algorithm based on chaotic array. It constructs a chaotic ar- ray, then uses the chaotic array to find out the "embedded" position. After getting the position, it compares the MSB (most significant bit)of the image with the watermark information. It gets the last watermark array by setting the val- ues of the chaotic array based on the results of the comparison. The results of experiment show that the scheme has good performance in common intentional or unintentional attacks such as cropping, additive noise, multiplible noise, rotating, filtering, scaling, and JPEG compression.