提出了一种改进的非对称水印算法.应用特征向量的原理和方程具有无穷解时具有的特性产生水印,并采用相关值计算方法对水印进行检测.此外还分析了当对嵌有水印的作品进行穷举搜索攻击和减法攻击时算法的鲁棒性.最后通过实验验证此算法是有效的.
This paper displays an improved asymmetric watermarking algorithm,The watermark is constructed on the basis of the theorem of eigenvector and the property of an equation which has innumerable solutions.Calculation of correlation value acts as the method of watermark detection.Moreover we analyze its robustness when exhaustive search and subtraction attack are inflicted on the watermarked content.Finally experiments prove that this algorithm is efficacious.