作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2018, Vol. 44 ›› Issue (10): 215-220. doi: 10.19678/j.issn.1000-3428.0048388

• 图形图像处理 • 上一篇    下一篇

基于矩阵编码的大容量密文域可逆信息隐藏算法

刘宇,杨百龙,赵文强,袁志华   

  1. 火箭军工程大学 信息与通信工程系,西安 710025
  • 收稿日期:2017-08-17 出版日期:2018-10-15 发布日期:2018-10-15
  • 作者简介:刘宇(1993—),男,硕士研究生,主研方向为图像处理、信息隐藏;杨百龙,教授、博士生导师;赵文强,博士研究生;袁志华,硕士研究生。

Large Capacity Reversible Information Hiding Algorithm in Encryption Domain Based on Matrix Coding

LIU Yu,YANG Bailong,ZHAO Wenqiang,YUAN Zhihua   

  1. Department of Information and Communication Engineering,Rocket Force University of Engineering,Xi’an 710025,China
  • Received:2017-08-17 Online:2018-10-15 Published:2018-10-15

摘要: 针对当前密文域可逆信息隐藏技术中容量不足的缺陷,提出一种完全可分离的大容量可逆信息隐藏算法。将猫脸变换后的密文图像按照像素值划分区间,对特定区间内的像素定位,按矩阵编码的方式嵌入信息。接收方利用位置信息并根据隐写密钥解码提取秘密信息,经简单计算复原密文图像,解密后即可恢复原始图像。实验结果表明,该算法能够准确地提取秘密信息,无损恢复载体图像,实现2种操作的完全分离。

关键词: 矩阵编码, 密文域, 可分离性, 可逆信息隐藏, 隐藏容量

Abstract: Aiming at the shortcomings of insufficient capacity in the current encrypted domain reversible information hiding technique,a completely separable large capacity reversible information hiding algorithm is proposed.Arnold transform is used to encrypt original image,and pixel values of the encrypted image are divided into different intervals according to Most Significant Bit(MSB),so each pixel belongs to a specific interval.Secret messages are embedded into the encrypted image by matrix-encoding.At the receive end,the secret messages are extracted accurately with the help of the location map and the steganalysis key.The encrypted image can be restored by simple calculation,and then the original image can be obtained by decrypting the encrypted image without error.The correctness of the scheme is demonstrated by derivation.Experimental results show that the method can extract the secret information accurately and restore the carrier image without loss,and realize the complete separation of these two operations.

Key words: matrix coding, encryption domain, separability, reversible information hiding, hiding capacity

中图分类号: