摘要
为满足水印算法容易实现同时具有较强的稳健性,提出了一个图像数字水印算法.利用矩阵的Householder变换具有扰动性及Householder变换矩阵(H矩阵)对称性和正交性的特征,将图像进行了矩阵的Householder分解.通过仿真实验对算法进行攻击,结果表明本算法在计算量和稳健性方面优于已有算法.
In order to satisfy the watermarking algorithm to be realized easily and keep its strong robustness, an image digital watermarking algorithm is presented. The image is decomposed by Householder transform, using the perturbation of Householder transform of matrix, and the symmetry and orthogonal of the Householder transform matrix (H matrix). Compared with the existing algorithms, simulation experiments show the stronger robustness and the lower computational complexity of the algorithm.
出处
《宁夏大学学报(自然科学版)》
CAS
2013年第2期164-167,共4页
Journal of Ningxia University(Natural Science Edition)
基金
陕西省自然科学基金资助项目(2009JM1009)