Robust and secure image steganographic algorithm based on matrix embedding

Steganography is a sub-discipline of data hiding with an objective to modify a digital object, known as cover object, to encode and conceal a message so that it cannot be seen while it is transmitted on public communication channels such as computer network. The main requirements of steganography system are imperceptibility, high payload, security and robustness against transmission channel noise. The proposed work presented in this paper consist of a robust (non-fragile) steganography technique based on the matrix embedding using a self-synchronising variable length T-codes (to obtain compressed message from the original message) and RS codes (as error correction coding to provide robustness to the embedded message against transmission errors). The original message is first encoded using T-codes and then with RS-codes. The selection of the plane for embedding is made on the basis of variance of intensity resolutions. The secret message is then embedded in the selected 2nd, 3rd or 4th plane of the cover image using the matrix encoding technique. The proposed method is compared with other existing steganographic schemes based on error correcting codes. Experimental results show that the proposed method is an improvement over the existing methods.

[1]  Alvis Cheuk M. Fong,et al.  Multimedia applications of self-synchronizing T-codes , 2001, Proceedings International Conference on Information Technology: Coding and Computing.

[2]  Jiri Fridrich,et al.  Applications of data hiding in digital images , 1999, ISSPA '99. Proceedings of the Fifth International Symposium on Signal Processing and its Applications (IEEE Cat. No.99EX359).

[3]  Tao Zhang,et al.  A Research on Steganography Method Based on Error-Correcting Codes , 2006, 2006 International Conference on Intelligent Information Hiding and Multimedia.

[4]  Premchander Reddy Error resilient image transmission using T-codes and edge-embedding , 2007 .

[5]  G. R. Higgie Analysis of the families of variable length self synchronising codes called T-codes , 1991 .

[6]  M. R. Titchener,et al.  Generalised T-codes : extended construction algorithm for self-synchronising codes , 1996 .

[7]  Jessica J. Fridrich,et al.  Matrix embedding for large payloads , 2006, IEEE Trans. Inf. Forensics Secur..

[8]  S.T. Maya,et al.  Robust steganography using bit plane complexity segmentation , 2004, (ICEEE). 1st International Conference on Electrical and Electronics Engineering, 2004..

[9]  P. Farrell,et al.  Essentials of Error-control Coding , 2006 .

[10]  Anil Kumar,et al.  Application of T-Code, Turbo Codes and Pseudo-Random Sequence for Steganography , 2006 .

[11]  Caroline Fontaine,et al.  How Reed-Solomon Codes Can Improve Steganographic Schemes , 2009, EURASIP J. Inf. Secur..

[12]  Jessica J. Fridrich,et al.  Influence of embedding strategies on security of steganographic methods in the JPEG domain , 2008, Electronic Imaging.

[13]  S. Manoharan Towards robust steganography using T-codes , 2003, Proceedings EC-VIP-MC 2003. 4th EURASIP Conference focused on Video/Image Processing and Multimedia Communications (IEEE Cat. No.03EX667).

[14]  Ulrich Günther Robust source coding with generalised T-Codes , 1998 .

[15]  Liu Cui-Qing,et al.  A Research on the Steganography Capacity of the Reed-Solomon Codes , 2007, 2007 International Conference on Computational Intelligence and Security Workshops (CISW 2007).

[16]  Ousmane Khouma,et al.  New Steganographic scheme based of Reed- Solomon codes , 2012 .

[17]  R. Morelos-Zaragoza The art of error correcting coding , 2002 .

[18]  Peter Hanzlik,et al.  Steganography in Reed-Solomon Codes , 2011 .