期刊文献+

基于Peano曲线扫描的大容量密文域可逆信息隐藏方案

High capacity reversible data hiding in encrypted image based on Peano curve scanning
下载PDF
导出
摘要 针对现有密文域可逆信息隐藏算法中存在嵌入率低、安全性不足等问题进行了研究,提出了一种利用图像像素间相关性的大容量密文域可逆信息隐藏方案。首先利用图像位平面间相关性减小冗余,再使用Peano曲线对位平面进行扫描,利用游程霍夫曼编码对每个位平面进行压缩,而后利用图像高位信息对低位空间进行填充,最后用填充消息作为隐藏密钥对秘密信息异或加密实现嵌入。实验结果表明,该方法可完全可逆地恢复原始图像,平均最大嵌入容量达2.53 bpp。 Aiming at the problems of low embedding rate and insufficient security in the existing reversible information hiding algorithms in the ciphertext domain,this paper proposed a large-capacity reversible information hiding scheme in the ciphertext domain using the correlation between image pixels.Firstly,it used the correlation between image bit planes to reduce redundancy,then used the Peano curve to scan the bit planes,used run-length Huffman coding to compress each bit plane,and then used the high-level information of the image to fill the low-bit space,and finally used the padding message as a hidden key to XOR the secret information to realize embedding.Experimental results show that the method can restore the original image completely reversibly,and the average maximum embedding capacity can reach 2.53 bpp.
作者 葛虞 张敏情 杨盼 Ge Yu;Zhang Minqing;Yang Pan(Key Laboratory of Network&Information Security under Chinese People Armed Police Force,Engineering University of PAP,Xi’an 710086,China)
出处 《计算机应用研究》 CSCD 北大核心 2021年第12期3756-3759,共4页 Application Research of Computers
基金 国家自然科学基金资助项目。
关键词 位平面压缩 Peano曲线 熵编码 可逆信息隐藏 高嵌入率 bit plane compression Peano curve entropy coding reversible information hiding high embedding rate
  • 相关文献

参考文献1

二级参考文献7

  • 1王能超.Walsh函数的演化生成[J].中国图象图形学报(A辑),1996,1(3):225-231. 被引量:14
  • 2Dickau RM. Two-dimensional L-systems, URL: http:∥forum. swarthmore. edu/advanced/robertd/lsys2d. html. 1996
  • 3Paul Bourke. URL: http: ∥astronomy. swin. edu. au/~pbourke/ fractals/peano/
  • 4Song Zhexuan,Roussopoulos Nick. Using Hilbert curve in image storing and retrieving. In: Proc. of the 2000 ACM workshops on Multimedia. Los Angeles, California, United States, 2000
  • 5Bohm C, Berchtold S, Keim D A. Searching in high-dimensional spaces Index structures for improving the performance of multimedia databases. ACM Computing Surveys (CSUR), 2001, 33(3):322~373
  • 6Sagan H. On the geometrization of the Peano curve and the arithmetization of the Hilbert curve. J. Math. Educ. Sci. Tech., 1992, 23(3): 403~411
  • 7McClure M. Self-similar structure in Hilbertr'space-filling curve, Mathematics Magazine. Academic Research Library, 2003, 76(1) :40~47

共引文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部