检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:李笑 王春玲[1] 陈亮[1] LI Xiao;WANG Chun-Ling;CHEN Liang(School of Computer Science,Xi’an Polytechnic University,Xi’an 710048,China)
机构地区:[1]西安工程大学计算机科学学院,西安710048
出 处:《计算机系统应用》2021年第7期215-219,共5页Computer Systems & Applications
基 金:科学大数据工程(二期)(XXH13505-03-207)。
摘 要:为了解决由于因特网的飞速发展引发的网络信息安全问题,前人提出了一种基于最低有效位算法的图像信息隐藏技术,巧妙地利用媒体信息冗余属性,将秘密信息隐藏在其他媒体信息,得到一个可以公开传播的嵌密载体,使非法者不能意识到隐藏数据从而实现信息的存储和传输.针对这种算法隐藏信息量不够大的问题,将秘密信息从只在最低一位进行隐藏,改变为采用先匹配,若匹配失败再替换的原则,将秘密信息每个连续两位依次嵌入载体图像中每个字节最低四位的两位中,提高了传统最低有效位算法的隐藏量.结果表明,该算法隐藏量大,隐藏前后图像质量变化小,安全性高,并且能够正确提取出秘密信息,满足用户对信息隐藏的要求.To solve the problems of network information security caused by the rapid development of the Internet,predecessors proposed an image information hiding technology based on the least significant bit algorithm.This method cleverly uses the redundant attributes of media information to hide secret information in other media information,obtaining a carrier embedded with secrets that can be publicly disseminated.The information can be stored and transmitted because lawless people cannot detect the hidden data.Previously,the concealed information is limited as only the lowest digit of secret information is hidden.To solve this,we embed every two consecutive digits of the secret information in two of the least four digits of every byte in the carrier image on the principle of“matching first and making replacement if it fails”.In this way,the hidden amount of the traditional least significant bit algorithm is increased.The results show that the algorithm can meet the needs of users for information hiding due to its large hidden amount,little reduction in image quality after hiding,high safety,and ability to correctly extract secret information.
分 类 号:TP309.7[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.49