Plus-Minus One Modified Product Steganographic Coding Based on Extended Embeddable Columns
Received date: 2016-07-29
Revised date: 2016-08-16
Online published: 2016-09-30
In the existing product coding technique, secret data are embedded into rows and columns of a particular Hamming code matrix in a sequential fashion using the (n, k) linear block codes generated with a parity-check matrix H. The product code is a type of parallel concatenated block code that uses short codes to construct a long code. In decoding, a relatively simple iterative technique is used. This paper proposes a novel algorithm of ±1 modified product steganographic code (±1 MPSC) by expending some embeddable columns. Compared with the product perfect code (PPC), ±1 MPSC uses 2c-1-1 additional columns where c is the column number of the Hamming code matrix. It also uses a XOR data list constructed by LSB and second LSB of adjacent carrier elements to further reduce the number of flips to improve embedding efficiency. The theoretical analysis and experiments show that the embedding rate of the proposed method reaches 1.33 times that of PPC, and the total performance of D-E curve is improved nearly 2%.
ZHANG Ling-yu, ZHAO Xian-feng . Plus-Minus One Modified Product Steganographic Coding Based on Extended Embeddable Columns[J]. Journal of Applied Sciences, 2016 , 34(5) : 575 -584 . DOI: 10.3969/j.issn.0255-8297.2016.05.010
[1] Westfeld A. 2001. F5-a stegonagraphic algorithm: high capacity despite better steganalysis[C]//Information Hiding, 4th International Workshop I. S. Moskowitz, Ed. New York, Springer-Verlag, Lecture Notes Comput. Science 2001, 2137: 289-302.
[2] Fridrich J, Soukal D. 2006. Matrix embedding for large payloads [J]. IEEE Transactions Information Security Forensics, 2006, 1(3): 390-395.
[3] Galand F, Kabatiansky G. Information hiding by coverings [C]//Proceedings of the IEEE Information Theory Workshop, Paris, 2003: 151-154.
[4] Fridrich J, Goljan M, Lisonek P, Soukal D. Writing on wet paper [J]. IEEE Transections Signal Process, 2005, 53(10): 3923-3935.
[5] 朱雪秀, 刘九芬, 张卫明. 一种基于汉明码和湿纸码的隐写算法[J]. 电子与信息学报,2010, 32(1): 162-165. Zhu X X, Liu J F, Zhang W M. A steganographic algorithm based on Hamming code and wet paper code [J], Journal of Electronics & Information Technology, 2010, 32(1): 162-165. (in Chinese)
[6] Rifa-Pous H, Rifa J. 2009. Product perfect codes and steganograph [J]. Digital Signal Processing, 2009, 19(4): 764-769.
[7] Zhao Z, Gao F. An improved steganographic method of product perfect codes [C]//In proceedings of Signal Processing, Communication and Computing (ICSPCC), Xian, 2011: 1-5.
[8] Bao Z K, ZhangWM, Zhao X F. ±1 steganographic codes by applying Syndrome-Trellis codes to dynamic distortion model in pixel chain [J]. Journal of Computer Research and Development, 51(8), 2014.
[9] Filler T, Judas J, Fridrich J. Minimizing embedding impact in steganography using trelliscoded quantization [C]//Proceeding of Electronic Imaging, Media watermarking, Security and Forensics ceedings, 2010, 6(1): 175-178.
[10] Pevny T, Filler T, Bas P. Using high-dimensional image models to perform highly undetectable steganography [C]//Proceedings of Information Hiding, 2010: 161-177.
[11] Holub V, Fridrich J. Digital image steganography using universal distortion [C]//Proceedings of Information Hiding and Multimedia Security, 2013: 59-68.
[12] Zhou P, Nadeem T, Kang P. EZCab: a cab booking application using short-range wireless communication [C]//Proceedings of IEEE International Conference on Pervasive Computing and Communications, 2015: 27-38.
[13] Li C, Hutchins D A, Green R J. Short-range ultrasonic digital communications in air [J], IEEE Trans on Ultrasonic, Ferroelectrics and Frequency Control, 2008, 55(4): 908-918.
/
| 〈 |
|
〉 |
