一种基于混沌阵列的鲁棒零水印算法

A Robust Zero-Watermarking Algorithm Based on Chaotic Array

本文提出了一种基于混沌阵列的鲁棒零水印算法.它首先构造一个混沌阵列,然后利用该混沌阵列来在图像中寻找'嵌入1'位置,得到该位置的像素值的最高有效位,再通过和水印信息的比较结果来在混沌阵列中设置标志,构造出最终的水印阵列.实验表明,该水印方案具有良好的鲁棒性,能够抵抗剪切、加扰、旋转、滤波、缩放、JPEG压缩等常见的有意和无意攻击.

This paper presents a robust zero-watermarking algorithm based on chaotic array. It constructs a chaotic array, 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 values 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.