期刊文献+

一种基于QR分解的脆弱水印算法 被引量:3

A Fragile Watermarking Algorithm Based on QR Decomposition
下载PDF
导出
摘要 提出了一种基于QR分解的脆弱水印算法。该算法运用矩阵的QR分解技术,把原始图像信息转化为很短的二进制比特串,并把其作为水印嵌入到原始图像中随机选取的某些像素的LSB位。该算法不仅能检测到水印图像的任何改动,同时还保证了水印图像的质量。为了对水印图像的变化像素进行定位,提出了一种运用分块技术的扩展算法,并对此扩展算法进行改进,使其能够抵抗剪切-粘贴攻击。实验证明,该算法对水印图像的改变非常敏感,定位算法也有很好的效果。 A fragile watermarking algorithm based on QR decomposition scheme is presented in this paper. It is a technique that applying the idea of the QR decomposition to the fragile watermarking. It operates in this way; convert the original image into short binary bits and insert the binary bits into the LSBs of some randomly selected pixels of the original image. In this way, we can detect any modification of watermarked images while the quality of watermarked images still keeps high. To locate the changed position we propose a block-wise algorithm, and improve it to resist the cut-and-paste attack. Experimental results show that the algorithm is sensitive to the modification of watermarked images and location is also effective.
作者 赵辉 陈卫红
出处 《电子工程师》 2003年第12期13-15,共3页 Electronic Engineer
关键词 QR分解 脆弱水印 算法 分块技术 图像处理 fragile watermarking, QR decomposition, image processing
  • 相关文献

参考文献4

  • 1[1]Cox I, Miller M, Bloom J. Digital Watermarking. San Francisco (CA): Morgan Kaufmann Publishers, 2001
  • 2[2]Friedman G. The Trustworthy Digital Camera: Restoring Credibility to the Photographic Image. IEEE Trans on Consumer Electron, 1993, 39(4): 905~910
  • 3[3]Lee Sin-Joo, Jung Sung-Hwan. A Survey of Watermarking Techniques Applied to Multimedia. In: Proceedings of 2001. IEEE International Symposium on Industrial Electronics, Vol 1. Piscataway(NJ): IEEE, 2001. 272~277
  • 4[4]Barreto P S L M, Kim H Y, Rijmen V. Toward Secure Public-key Blockwise Fragile Authentication Watermarking. In: Proceedings of 2001 International Conference on Image Processing, Vol 2. Piscataway(NJ): IEEE Signal Processing Sac, 2002. 494~497

同被引文献52

引证文献3

二级引证文献5

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部