检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《小型微型计算机系统》2015年第6期1271-1275,共5页Journal of Chinese Computer Systems
基 金:国家自然科学基金项目(61401060;61272173)资助;中央高校基本科研业务基金项目(DUT12ZD104;DUT13LK38;DUT12RC(3)80)资助
摘 要:传统的带隐写功能的秘密图像共享方案中常出现不能无损恢复秘密图像或宿主图像的情况,这是由秘密图像像素的截短、模余运算中的溢出等问题引起的.另外,这些方案中也可能存在着计算复杂度高的问题.为了解决这些问题,我们提出一种利用数独和细胞自动机的秘密图像共享方案.该方案通过一维细胞自动机将秘密图像数据和部分经由数独表转换的宿主图像像素信息分成多份秘密份额,再将这些份额通过数独表转换成取值范围在[0,255]的数字来组成隐写图像.实验结果表明该方案能够将秘密图像成功地隐写进宿主图像中,每个被修改的宿主图像像素的失真范围在[0,3]内,并且秘密图像和宿主图像可以被无损恢复;此外,和现有方案相比较,该方案整个运算过程的计算量比较低.Traditional secret image sharing schemes with steganography often fail to restore the secret image or the host image lossless- ly due to the truncation of the secret image pixels, the overflow or underflow issues in the modulus operation, and so on. Besides, many of them have the issue of high computation complexity. To solve these problems, we propose a novel secret image sharing scheme uti- lizing Sudoku and cellular automata. This scheme uses one-dimensional cellular automata to divide the secret image data and some in- formation converted from the pixels of the host image by Sudoku table into multiple secret shares. Then, these shares will be converted into the digits ranged from [ 0,255 ] by Sudoku table, and these digits will be used to make up stego images. Experimental results show that this scheme can embed a secret image into a host image successfully ~ the distortion for each modified pixel of the host image is limited within range [ 0,3 ], and both the secret image and the host image can be restored losslessly. Additionally, compared to some current schemes, this scheme has relatively low computation cost in the whole arithmetic process.
分 类 号:TP391[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.145