Image-adaptive steganalysis for LSB Matching steganography

This paper proposes an image-adaptive steganalysis algorithm for LSB-Matching steganography. In the proposed method, the content features of the input image are analyzed in order to obtain a classification composed by plain and non-plain regions. In this context, only the plain regions of the input image are considered to determine if the image contains or not hidden information. The experimental results show that the proposed steganalysis algorithm outperforms the conventional LSB-Matching steganalysis algorithms in terms of detection performance and the same time minimizes the inter-database error. The results are shown through the ROC curves that illustrate a better performance of the proposed algorithm.

[1]  Andrew D. Ker Steganalysis of LSB matching in grayscale images , 2005, IEEE Signal Processing Letters.

[2]  Tomás Pevný,et al.  Steganalysis by Subtractive Pixel Adjacency Matrix , 2009, IEEE Transactions on Information Forensics and Security.

[3]  William A. Pearlman,et al.  Steganalysis of additive-noise modelable information hiding , 2003, IS&T/SPIE Electronic Imaging.

[4]  Anastasios N. Venetsanopoulos,et al.  A perceptual model for JPEG applications based on block classification, texture masking, and luminance masking , 1998, Proceedings 1998 International Conference on Image Processing. ICIP98 (Cat. No.98CB36269).

[5]  Naixue Xiong,et al.  Steganalysis of LSB matching using differences between nonadjacent pixels , 2016, Multimedia Tools and Applications.

[6]  Jessica J. Fridrich,et al.  Practical steganalysis of digital images: state of the art , 2002, IS&T/SPIE Electronic Imaging.

[7]  Toby Sharp,et al.  An Implementation of Key-Based Digital Signal Steganography , 2001, Information Hiding.