一种基于正交相似变换的数字水印算法  

A watermarking algorithm based on orthogonal similarity transformation

作　　者：颜惠琴[1] 牛万红[2] 

机构地区：[1]宁夏大学数学计算机学院,宁夏银川750021 [2]宁夏大学远程教育学院,宁夏银川750021

出　　处：《宁夏工程技术》2010年第3期213-216,共4页Ningxia Engineering Technology

基　　金：宁夏自然科学基金资助项目(NZ0937);宁夏大学自然科学基金资助项目(ndzr09-47)

摘　　要：为了提高水印的鲁棒性,提出一种基于正交相似变换的数字水印算法.首先,选取一个可逆矩阵并对其做正交变换,这个可逆矩阵可当做密钥;然后,利用该正交变换矩阵对载体进行相似变换,得到一个具有良好频谱特性的相似矩阵;最后,将置乱后的水印信息嵌入到相似矩阵中较大的非零像素值中,再重构图像.实验结果表明,该水印算法简单易行,具有较好的鲁棒性和不易感知性;与主流算法之一的DCT水印算法比较,验证了该算法的优越性.In order to improve the robustness of watermark,a novel digital watermarking algorithm based on orthogonal similarity transformation is presented.Firstly,an invertible matrix is selected and its orthogonal transformation can be used as a key;then,similarity transformation is performed using the orthogonal matrix to the vector to get a similarity matrix with good spectral characteristics;finally,the scrambling watermark message is embedded into the larger non-zero pixel values in the similarity matrix and the image is reconstructed.The experimental results show that the algorithm is simple,with better robustness and insensitiveness.Comparison with the DCT watermarking algorithm,which is one of the popular algorithms,demonstrates the superiority of the present algorithm.

关 键 词：数字水印 正交变换 相似变换 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]