Variable Multi-dimensional Co-occurrence for Steganalysis

In this paper, a novel multidimensional co-occurrence histogram scheme has been presented, in which the numbers of quantization levels for the elements in the co-occurrence are variable according to the distance among the elements, referred to as the co-occurrence with variable number of quantization levels, abbreviated as the VNQL co-occurrence or variable co-occurrence. Specifically, the longer the distance the smaller the number of quantization levels used. The dimensionality of the variable co-occurrence is therefore flexible and much smaller than that used in the traditional multidimensional co-occurrence of the same orders. Furthermore, the symmetry existed in the multidimensional co-occurrence is skillfully utilized in the proposed variable co-occurrence. Consequently, the feature dimensionality has been lowered dramatically. Thus, the fourth order variable co-occurrence applied to the residuals used in the spatial rich model results in \(1,704\) features, which work with a G-SVM classifier, can achieve an average detection rate similar to that of achieved by the TOP10 (dimension approximately 3,300) in the spatial rich model with a G-SVM classifier against the HUGO at 0.4 bpp on the same setup. The time consumed by the proposed \(1,704\) features is much shorter that used by the latter. Furthermore, the performance achieved by the proposed \(1,704\) together with a G-SVM classifier is on par with that achieved by the TOP39 with \(12,753\) features and an ensemble classifier on the same setup against two steganographic schemes, the HUGO and the edge adaptive. With another proposed set of \(1,977\) features, generated from the residuals used in the spatial rich model and from a few newly formulated residuals, and the G-SVM classifier, the performance achieved is better than that achieved by using the TOP39 feature-set with ensemble classifier on the same setup against the HUGO.

[1]  Jiwu Huang,et al.  Edge Adaptive Image Steganography Based on LSB Matching Revisited , 2010, IEEE Transactions on Information Forensics and Security.

[2]  Xinxin Niu,et al.  Non-uniform Quantization in Breaking HUGO , 2013, IWDW.

[3]  Tomás Pevný,et al.  Steganalysis by subtractive pixel adjacency matrix , 2010, IEEE Trans. Inf. Forensics Secur..

[4]  Tomás Pevný Co-occurrence steganalysis in high dimensions , 2012, Other Conferences.

[5]  Chih-Jen Lin,et al.  LIBSVM: A library for support vector machines , 2011, TIST.

[6]  Yun Q. Shi,et al.  Textural Features for Steganalysis , 2012, Information Hiding.

[7]  Robert M. Haralick,et al.  Textural Features for Image Classification , 1973, IEEE Trans. Syst. Man Cybern..

[8]  E. Oja,et al.  Compressing higher-order co-occurrences for texture analysis using the self-organizing map , 1995, Proceedings of ICNN'95 - International Conference on Neural Networks.

[9]  Tomás Pevný,et al.  "Break Our Steganographic System": The Ins and Outs of Organizing BOSS , 2011, Information Hiding.

[10]  Jessica J. Fridrich,et al.  Minimizing Additive Distortion in Steganography Using Syndrome-Trellis Codes , 2011, IEEE Transactions on Information Forensics and Security.

[11]  Jessica J. Fridrich,et al.  Random Projections of Residuals for Digital Image Steganalysis , 2013, IEEE Transactions on Information Forensics and Security.

[12]  Jessica J. Fridrich,et al.  Steganalysis of Content-Adaptive Steganography in Spatial Domain , 2011, Information Hiding.

[13]  Jessica J. Fridrich,et al.  Rich Models for Steganalysis of Digital Images , 2012, IEEE Transactions on Information Forensics and Security.

[14]  Tomás Pevný,et al.  Using High-Dimensional Image Models to Perform Highly Undetectable Steganography , 2010, Information Hiding.

[15]  Xinxin Niu,et al.  A Novel Mapping Scheme for Steganalysis , 2012, IWDW.

[16]  Fatih Kurugollu,et al.  A New Methodology in Steganalysis: Breaking Highly Undetectable Steganograpy (HUGO) , 2011, Information Hiding.