摘要
提出了一种基于对角占优矩阵的数字水印算法.该算法利用数字图像所对应的非负矩阵,构造了对角占优矩阵,采用伪随机序列作为数字水印,利用对角占优矩阵的性质,使用量化函数的方法进行数字水印的嵌入,恢复水印时不需要原始图像.实验结果表明,这种方法运算速度快,并且具有很好的鲁棒性.
A new digital watermarking algorithm based on diagonally dominant matrix is proposed. The diagonally dominant matrix is constructed by the corresponding nonnegative matrix of the original image. A pseudo-random sequence as digital watermarking is embedded into the built matrix of especial properties by using the scale quantization function. The original image is not needed in the recover progress. Experimental results show that this new algorithm is robust and easy to embed and extract.
出处
《北京邮电大学学报》
EI
CAS
CSCD
北大核心
2004年第6期74-78,共5页
Journal of Beijing University of Posts and Telecommunications
基金
国家自然科学基金项目(60073049)
国家重点基础研究发展规划项目(GT1999035804)
北京市自然科学基金项目(4042022)
关键词
信息隐藏
数字水印
对角占优
Image processing
Information technology
Matrix algebra
Theorem proving