摘要
针对可逆信息隐藏算法嵌入容量小、通用性差、运行效率低等问题,提出以插值图像为载体的大容量可逆信息隐藏方法,设计了一种类线性图像插值方法,通过实验数据分析给出了理想插值图像的期望插值,将载体图像两相邻像素值看作抛物线的根,构造一元二次方程,利用方程性质,建立以抛物线最值为参考点、以两根均值为期望插值的模型,根据差值区间确定出可嵌入位置和位数,再由区间调整因子和秘密信息共同确定出最终插值,设计了两种可逆隐藏方案,均无附加信息、无数据溢出,平均嵌入率接近4bit/pixel,载密图像有较高质量,通过与5种优秀算法的实验比较,表明算法在嵌入容量、隐蔽性、运行效率等方面相对比较算法有一定优势.
Reversible information hiding technology is widely used in many fields, this paper designed a new reversible data hiding algorithm with high payload based on the interpolation images. Firstly,we design a linear interpolation method and determine the ideal interpolation image, then a model is set up,with the value of the parabola as the reference, two mean values as the expectation interpolation, the embeddable position and number are determined according to the difference interval, and then the final interpolation is determined by the interval adjustment factor and the secret information. no additional information,no data spillover, and the average payload of algorithm is approach 4 bit/pixel. Compared with the experimental results of 5 excellent algorithms, it is shown that the algorithm has some advantages over the algorithm in terms of embedding capacity, invisibility and operation efficiency.
引文
[1]FRIDRICH J,GOLIAN M,DU R. Lossless data embedding new paradigm in digital w atermarking[J]. EURAS IP Journal on Applied Signal Processing,2012,2(2):185-196.
[2] CELIK M U,SHARMA G,Tekalp A M,et al. Lossless generalized LSB data embedding[J]. IEEE Transactions on Image Processing,2015,14(2):253-266.
[3]TIAN J. Reversible data embedding using a difference expansion[J]. IEEE Transactions on Circuits and Systems for Video Technology,2013,13(8):890-896.
[4]王继军.利用差值扩展和直方图平移的可逆数字数据算法[J].小型微型计算机系统,2014,35(5):1192-1195.Wang Ji-jun. An algorithm for reversible w atermarking based on difference expansion and histogram shifting[J].Journal of Chinese Computer Systems,2014,35(5):1192-1195.
[5]GUI X,LI X,Yang B. A high capacity reversible data hiding scheme based on generalized prediction error expansion and adaptive embedding[J]. Signal Processing,2014,98(9):370-380.
[6]DRAGOI I C,Coltuc D. Local prediction based difference expansion reversible w atermarking[J]. IEEE Transactions on Image Processing,2014,23(4):1779-1790.
[7]LU T C,Tseng C Y,Deng K M. Reversible data hiding using local edge sensing prediction methods and adaptive thresholds[J]. Signal Processing,2014,104(10):152-166.
[8]LUO L,CHEN Z,CHEN M,et al. Reversible image water marking using interpolation technique[J]. IEEE Transactions on Information Forensics and Security,2010,5(1):187-193.
[9]熊祥光,韦立.基于直方图平移和互补嵌入的可逆数据方案[J].计算机工程,2015,41(8):180-185.XIONG Xiang-guang,Wei Li. Reversible w ater marking scheme based on histogram shifting and complementary embedding[J]. Computer Engineering,2015,41(8):180-185.(in Chinese)
[10]JUNG K H,Yoo K Y. Data hiding method using image interpolation[J]. Computer Standards&Interfaces,2009,31(2):465-470.
[11]LEE C F,HUANG Y L. An efficient image interpolation increasing payload in reversible data hiding[J]. Expert Systems w ith Applications,2012,39(8):6712-6719.
[12]王继军.图像插值空间大容量可逆数字数据算法[J].中国图象图形学报,2014,19(4):527-533.Wang Ji-jun. High capacity reversible w atermarking for image interpolation space[J]. Journal of Image and Graphics,2014,19(4):527-533.(in Chinese)
[13]熊祥光.基于图像插值的大容量可逆数据算法[J].光电子·激光,2016,27(6):646-654.Xiong Xiangguang. High capacity reversible w atermarking algorithm based on image interpolation[J]. Journal of Optoelectronics·Laser,2016,27(6):646-654.(in Chinese)
[14]李雪景,李江隐,康宝生.基于图像插值和直方图平移的可逆水印算法[J].计算机应用研究,2016,33(4):1159-1163.Li Xue-jing,Li Jiang-yin,Kang Bao-sheng. Reversible w atermarking algorithm based on image interpolation and histogram translation[J]. Application Research of Computers,2016,33(4):1159-1163.(in Chinese)
[15] ZHANG X,SUN Z,TANG Z,et al. High capacity data hiding based on interpolated image[J]. M ultimedia Tools and Applications,2016,7(76):9195-9218.
[16]Z Wang,AC Bovik,H R Sheikh,E P Simoncelli. Image quality assessment:From error visibility to structural similarity[J]. IEEE Transactions on Image Processing,2004,13(4):600-612.