基于Hilbert的快速湿纸码自适应隐写算法_张广斌.pdfVIP

39 7 2013 7 Vol.39 No.7 Computer Engineering July 2013 2013 A TP301.6 Hilbert ( 450004) Hilbert 0.573 Hilbert Adaptive Steganography Algorithm of Rapid Wet Paper Code Based on Hilbert ZHANG Guang-bin, YUE Yun-tian, ZHANG Chuan-fu (Institute of Electronic Technology, Information Engineering University, Zhengzhou 450004, China) AbstractAccording to the computational complexity of wet paper code, this paper presents a fast embedding strategy, on this basis, a fast adaptive image of the wet paper steganography scheme is given. Using the Hilbert curve to choose the feat pixel to carry information, the scheme uses the fast embedding strategy as the size of group reducer and bit-control to embedding secret in the map based on amend matrix. Experimental results indicate, for each packet, the existence rate of result is improved about 0.5, also the probability of reducing Hamming weight of modified vector is 73. Compared with Writing on Wet Paper(WWP), this scheme improves the speed obviously and the quality of stego image is better. Key wordsHilbert curve; adaptive steganography; wet paper code; rapid embedding; complexity; embedding speed DOI: 10.3969/j.issn.1000-3428.2013.07.036 1 [10] Hilbert BPCS(Bit-Plane Complexity Segmentation)PVD(Pixel-Value Differencing) [1] 2