首页 | 本学科首页   官方微博 | 高级检索  
     

基于新的Arnold反置乱的二值图像信息隐藏
引用本文:孙颖,刘嘉勇. 基于新的Arnold反置乱的二值图像信息隐藏[J]. 通信技术, 2010, 43(8): 181-183,186
作者姓名:孙颖  刘嘉勇
作者单位:四川大学,信息安全研究所,四川,成都,610064
基金项目:四川省科技攻关计划项目 
摘    要:主要研究的是二值图像的信息隐藏技术。这类图像的信息隐藏,具有人眼易觉察、稳健性不高且容量受限制的缺点。目的正是在于提高该类图像信息隐藏的稳健性和人眼不可见性。首先对图像进行处理,即计算各像素点修改度,将原始图像和分配了可修改优先级的图像用同一算法和参数Arnold置乱,在嵌入信息后进行新的Arnold反置乱。通过Matlab试验,信息载体图像与原始二值图像相比没有明显降质,嵌入的数据可以无损恢复.原始图像也可以无损恢复。

关 键 词:二值图像  修改优先级  Arnold置乱

Binary-image Information Hiding Based on New Arnold Scrambling
SUN Ying,LIU Jia-yong. Binary-image Information Hiding Based on New Arnold Scrambling[J]. Communications Technology, 2010, 43(8): 181-183,186
Authors:SUN Ying  LIU Jia-yong
Affiliation:(Institute of Information Security, Sichuan University, Chengdu Sichuan 610064, China)
Abstract:This paper mainly focuses on steganography in binary image. Information hiding in these images, with fairly low robustness and limited capacity, is easily detectable. With purpose to enhance the robustness and make the hidden message "blind" to human eye, the image is first processed, that is, to calculate the modified priority of every pixel point, then to scramble the original image and the processed image with the same algorithm and parameters, and then to inversely scramble the image with embedded information. The experimental results based on Matlab show that the embedded data is invisible and could be completely recovered.Also the original image could be recovered without any damage.
Keywords:binary image  modified priority  Arnold scrambling
本文献已被 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号