Building resilient classifiers for LSB matching steganography

One of the Internetpsilas hallmark is the rapid spread of the use of information and communication technology. This has boosted methods for hiding stego information inside digital cover content images which is a concerning issue in information security. On the other hand, attack of steganographic schemes has leveraged methods for steganalysis which is a challenging problem. In this paper, first we look at the design of classifiers, such as, support vector machines (SVM) and neural networks (RBF and MLP) which are able to detect the presence of least significant bit (LSB) matching steganography of gray scale images. Second, by combining with feature ranking methods (SVM-recursive feature elimination, Kruskal Wallis) and reduction techniques (PCA) pattern classification of stego is successfully achieved. It is of utmost importance to look at the large set of features extracted from images and find ranking methods able, namely, to exclude correlated and redundant features, avoid the curse of dimensionality or circumvent the need of the steganalyzer to be re-designed. Results show that desirable properties of robustness and resilience are attained by designing classifiers able to deal with redundancy and noise. Moreover, comparison of classifiers performance emphasizes the chosen model for the steganalyser.