信息隐藏和数字水印技术的研究
详细信息    本馆镜像全文|  推荐本文 |  |   获取CNKI官网全文
摘要
数字水印系统存在两个关键问题:一是提高基于图像水印方式隐藏信息的安全性;二是解决水印透明性与鲁棒性之间的矛盾。
     本论文主要针对LSB水印系统的算法保密性差的特点,研究了为隐藏信息加密的DES算法。通过对多种空域水印算法优缺点的分析,提出了基于DES算法的空域数字图像水印加入方法。引入的加密方法确保了隐藏信息的安全性,并利用VC++6.0对该方法进行了设计实现。实验表明,该方法在通信应用中有较强的实用性,同时也具备良好的透明性和可靠性。
     目前的水印技术存在很多问题,例如算法的鲁棒性和透明性不好,水印信息嵌入量较少等,本文围绕着这些问题在DCT变换域展开研究。在此基础上,提出了基于DCT系数特性的水印算法,并通过一些常见的图像处理攻击实验验证了这种算法生成水印的性能。利用分块DCT系数的奇偶特性,并通过PN序列加密来保证水印的安全性。基于DCT系数特性的水印,利用分块DCT系数的周期特性,结合Zig-Zag编码置乱技术,提出一种在宿主图像的中频交流系数上嵌入二值水印图像的方案。
     经过DCT域技术处理的水印图像因对其DCT系数的修改是在有损量化之后进行的,所以更具健壮性,算法能够成功地实现水印的嵌入与提取,而且运算速度较快。与传统图像水印的系统相比,本文提出的方案更具有抗干扰性,同时也具有很好的鲁棒性和透明性。所有的过程,包括嵌入、攻击、提取、验证均在MATLAB环境中进行模拟。
There are two key problems in watermarking technique of digital images. One is how to improve the security of hiden information which is based on the method of digital watermarking technique and the other is how to deal with the conflict of robustness and transparency.
    The dissertation focuses on the security fragility of digital watermarking system based on LSB, develops the method based on DES algorithm to encrypt for the hiden information. With the analysis of many spatial domain watermark algorithms, a new spatial domain digital watermarking method based on DES is presented, which is implemented by VC++ 6.0.
    On the other hand, there are many problems in the current watermarking technique, such as the weakness of robustness and imperceptibility of algorithms and so on. The dissertation does some studies on DCT domain and a new watermarking algorithm based on the property of DCT coefficients is proposed. Then the design principles are simulated and the performances are validated through some common attack experiments of images. Furthermore, PN series is used to ensure watermarking security.
    With the periodic property of DCT coefficients and the digital image scrambling transformation namely Zig-Zag scan, we proposes a meaningful binary watermarking image embedding algorithm on block DCT intermediate frequency AC coefficients of the original image. The proposed algorithm is more practical and better than others at robustness and imperceptibility. All processes, including watermarking embedding, attacking, extracting and verifying, are simulated in MATLAB environment.
引文
[1] Stefan Katzenbeisser,Fabien A.P.Petitcolas(著),吴秋新,钮心忻,杨义先等(译),信息隐藏技术—隐写术与数字水印,北京:人民邮电出版社,2001,50-62
    [2] 刘瑞祯,谭铁牛,数字图像水印研究综述,通信学报,2000,21(8),39-48
    [3] 王炳熙,陈琦,邓峰森.数字水印技术[M].西安电子科技大学出版社,2004.
    [4] 易开祥,数字图像加密与数字水印技术研究[博士学位论文].杭州:浙江大学,2001:20-25
    [5] Ingernar J Cox,Matewl Miller,Jefey A Bloom.数字水印[M].王颖(译).电子工业出版社,2003.
    [6] 孙圣和,陆哲明,数字水印处理技术,电子学报,2000,28(8),85-90
    [7] 汪小帆,戴跃伟,茅耀斌,信息隐藏技术,北京:机械工业出版社,2001
    [9] 陶虹,周良柱,袁金荣MATLAB与Visual C++混合编程的实现 计算机工程与应用 2000,10,pp.100-101,104
    [8] 伯晓晨,李涛,刘路等编著《Matlab工具箱应用篇——信息工程篇》 电子工业出版社 2000年4月第1版
    [10] 杨义先,林须端,编码密码学,北京:人民邮电出版社,1992,15-23
    [11] 吴伯修,曹秀英,密码学与语音保密通信,南京:东南大学出版社,1996,27-32
    [12] 丁玮,肖伟齐,齐东旭,基于置乱与融合的数字水印隐藏技术及其应用,中国图像图形学报,2000,5(8),644-649
    [13] 汪春生,程义民,王以孝,一种基于块分类的自适应数字水印算法[J].计算机工程与应用,2002,38(21):105-109
    [14] 王建折,姜星明,一种基于DCT变换的数字水印技术[J].计算机工程与应用,2002,38(6):105-106
    [15] M Bami, etal. A DCT-domain system for robust image watermarking [J]. Signal Processing。 1998: 66(3): 357-372
    [16] Cox I J, Killian J, Leighton T, Shamoon T. Secure spread spectrum??watermarking for images, audio and video. In: Pro. IEEE ICIP(Int. Conf. on Image Processing), Lausane, Switzerland, 1996, 3, 243-246
    [17] Cox I J, Killian J, Leighton F T, Secure spread spectrum watermarking for multimedia. IEEE Trans Image Processing, 1997,6(12),pp. 1673-1687.
    [18] 黄继武,YunQ.SHI,程卫东,DCT域图像水印:嵌入对策和算法 电子学报2000 vol.28 No.4 pp.57-60
    [19] Piva A. DCT-based watermark recovering without resorting to the uncorrupted original images. In: Proc of ICIP' 97,1:520-523
    [20] O' Ruanaidh J, Pun T. Rotation, scale and translation invariant spread spectrum digital image watermarking [J]. In: Signal Processing, 1998, 66(3), pp. 303-317.

© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号

地址:北京市海淀区学院路29号 邮编:100083

电话:办公室:(+86 10)66554848;文献借阅、咨询服务、科技查新:66554700