检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:高华玲[1]
机构地区:[1]三亚学院,三亚572022
出 处:《现代计算机》2016年第10期3-5,14,共4页Modern Computer
基 金:三亚学院校级一般项目(No.XYZZ1319);三亚市院地合作项目(No.2013YD43)
摘 要:利用灰度图像分割和随机最低有效位(rand LSB)算法相结合提出一种新的信息隐藏算法。算法可将不同类型的载体图像转换为一个虚拟的24位灰度图像,然后分割为若干图像块,再检测每个图像块的区域大小,返回相关信息列表。如果攻击者获取不到完整的密钥,则不能解析被转换的图像。完整的密钥包括图像分割方法的密钥、图像块选择密钥、秘密信息数据分布密钥、秘密信息类型密钥、加密方式密钥以及秘密信息的长度密钥等。这些密钥通过主密钥生成,如果不能获取全部的密钥,隐写分析很难检测出图像中存在的秘密信息。实验结果表明,该方法有很好的不可感知性,载体图像的修改程度小、信息隐藏的容量大并具有抗提取的鲁棒性。Proposes a new information hiding algorithm, which by combining the gray image segmentation and random least significant bit (rand LSB) algorithm. The proposed algorithm deals with different types of images by converting them to a virtual gray scale 24 bitmaps, and then finds out the possible segments inside image and then computes the possible areas for each segment with boundaries, return a list related information. Any intruder trying to find the transformed image will not be able to understand it without the complete key about the trans- formation process. The complete key is represented by the key of image segmentation method, key of data distribution inside segment (area selection), key of mapping within each area segment, key agreement of cryptography method, key of secret message length and key of message extension. These keys generated by one master key. The existence of secret message is hard to be detected by the steganalysis. Experiment results show that the proposed technique has good perceptual and the cover image has changed little, and it has large hidden information capacity and robustness against extraction.
分 类 号:TP391.41[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.90