Selecting Cover for Image Steganography by Correlation Coefficient

The security of steganographic system is improved by selecting cover. The cover data are modeled as Gauss-Markov process, where the correlation coefficient of two arbitrary data elements is the exponent of correlation parameter. The KL divergence and Bhattacharyya distance of Spread Spectrum steganographic system increase with the correlation parameter. Thus the cover with smaller correlation parameter is selected to improve security. For image spatial domain steganography, the correlation parameter of image data is calculated by a special exponential model of correlation coefficients and the least squares estimator. Experiments show that the cover selection method is efficient on improving the security of image steganoagraphy.

[1]  T. Kailath.  The Divergence and Bhattacharyya Distance Measures in Signal Selection , 1967 .

[2]  Ingemar J. Cox,et al.  Secure spread spectrum watermarking for multimedia , 1997, IEEE Trans. Image Process..

[3]  Christian Cachin,et al.  An information-theoretic model for steganography , 1998, Inf. Comput..

[4]  Lisa M. Marvel,et al.  Spread spectrum image steganography , 1999, IEEE Trans. Image Process..

[5]  Bernd Girod,et al.  Communications approach to image steganography , 2002, IS&T/SPIE Electronic Imaging.

[6]  Sorina Dumitrescu,et al.  Detection of LSB Steganography via Sample Pair Analysis , 2002, Information Hiding.

[7]  Phil Sallee,et al.  Model-Based Steganography , 2003, IWDW.

[8]  Andrew D. Ker.  Improved Detection of LSB Steganography in Grayscale Images , 2004, Information Hiding.

[9]  Ying Wang,et al.  Steganalysis of block-structured stegotext , 2004, IS&T/SPIE Electronic Imaging.

[10]  H. Vincent Poor,et al.  Neyman-pearson detection of gauss-Markov signals in noise: closed-form error exponentand properties , 2005, IEEE Transactions on Information Theory.

[11]  H. Vincent Poor,et al.  Neyman-Pearson Detection of Gauss-Markov Signals in Noise: Closed-Form Error Exponent and Properties , 2005, ISIT.

[12]  Xinpeng Zhang,et al.  Dynamical running coding in digital steganography , 2006, IEEE Signal Processing Letters.

[13]  B. S. Manjunath,et al.  Steganalysis for Markov cover data with applications to images , 2006, IEEE Transactions on Information Forensics and Security.

[14]  Nasir D. Memon,et al.  Cover Selection for Steganographic Embedding , 2006, 2006 International Conference on Image Processing.

[15]  Jessica J. Fridrich,et al.  Wet paper codes with improved embedding efficiency , 2006, IEEE Transactions on Information Forensics and Security.

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

[17]  Yun Q. Shi,et al.  A Markov Process Based Approach to Effective Attacking JPEG Steganography , 2006, Information Hiding.

[18]  Anindya Sarkar,et al.  Secure Steganography: Statistical Restoration of the Second Order Dependencies for Improved Security , 2007, 2007 IEEE International Conference on Acoustics, Speech and Signal Processing - ICASSP '07.

[19]  Weiming Zhang,et al.  Maximizing Steganographic Embedding Efficiency by Combining Hamming Codes and Wet Paper Codes , 2008, Information Hiding.

[20]  Junji Shikata,et al.  On the Use of Bhattacharyya Distance as a Measure of the Detectability of Steganographic Systems , 2008, Trans. Data Hiding Multim. Secur..

[21]  Fenlin Liu,et al.  Steganalysis Based on Difference Image , 2009, IWDW.