The DOI matches its Crossref record; 44 of the 44 references it cites were found in a registry or an index.
Ensemble Classifiers for Steganalysis of Digital Media
Abstract
Today, the most accurate steganalysis methods for digital media are built as supervised classifiers on feature vectors extracted from the media. The tool of choice for the machine learning seems to be the support vector machine (SVM). In this paper, we propose an alternative and well-known machine learning tool—ensemble classifiers implemented as random forests—and argue that they are ideally suited for steganalysis. Ensemble classifiers scale much more favorably w.r.t. the number of training examples and the feature dimensionality with performance comparable to the much more complex SVMs. The significantly lower training complexity opens up the possibility for the steganalyst to work with rich (high-dimensional) cover models and train on larger training sets—two key elements that appear necessary to reliably detect modern steganographic algorithms. Ensemble classification is portrayed here as a powerful developer tool that allows fast construction of steganography detectors with markedly improved detection accuracy across a wide range of embedding methods. The power of the proposed framework is demonstrated on three steganographic methods that hide messages in JPEG images.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Breiman, L. (2001) · Machine Learning · doi:10.1023/a:1010933404324 · Cited by 133,538
LIBSVM: A library for support vector machines
Chang, C.-C., & Lin, C.-J. (2011) · ACM Transactions on Intelligent Systems and Technology · doi:10.1145/1961189.1961199 · Cited by 40,918
The Nature of Statistical Learning Theory
Vapnik, V. N. (1995) · doi:10.1007/978-1-4757-2440-0 · Cited by 39,138
A decision-theoretic generalization of on-line learning and an application to boosting
Freund, Y., & Schapire, R. E. (1997) · Journal of Computer and System Sciences · doi:10.1006/jcss.1997.1504 · Cited by 20,466
(2012) · Encyclopedia of the Sciences of Learning · doi:10.1007/978-1-4419-1428-6_5195 · Cited by 19,370
Breiman, L. (1996) · Machine Learning · doi:10.1007/bf00058655 · Cited by 16,325 · cited 1×
“This strategy, known in the machine learning community as bootstrap aggregating or bagging [6], will also allow us to obtain an accurate estimate of the testing error, which will be important for determining optimal ensemble parameters.”
BackgroundLibsvm : A library for support vector machines
Ferrari, V. (2008) · Medical Entomology and Zoology · Cited by 10,122
The random subspace method for constructing decision forests
Ho, T. K. (1998) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.709601 · Cited by 6,842
Abe, S. (2001) · Springer eBooks · doi:10.1007/978-1-4471-0285-4 · Cited by 3,721
Combining Pattern Classifiers: Methods and Algorithms
Bagui, S. C. (2005) · Technometrics · doi:10.1198/tech.2005.s320 · Cited by 3,202
Combining Pattern Classifiers: Methods and Algorithms
Kuncheva, L. I. (2004) · Wiley eBooks · doi:10.1002/0471660264 · Cited by 3,005
Fisher discriminant analysis with kernels
Mika, S., Ratsch, G., Weston, J., Scholkopf, B., & Mullers, K. R. (2003) · Neural Networks for Signal Processing IX: Proceedings of the 1999 IEEE Signal Processing Society Workshop (Cat. No.98TH8468) · doi:10.1109/nnsp.1999.788121 · Cited by 2,661
Cox, I. (2002) · Journal of Electronic Imaging · doi:10.1117/1.1494075 · Cited by 2,289
The Boosting Approach to Machine Learning: An Overview
Schapire, R. E. (2003) · Lecture Notes in Statistics · doi:10.1007/978-0-387-21579-2_9 · Cited by 2,003
Optimization by Direct Search: New Perspectives on Some Classical and Modern Methods
Kolda, T. G., Lewis, R. M., & Torczon, V. (2003) · SIAM Review · doi:10.1137/s003614450242889 · Cited by 1,653
Using High-Dimensional Image Models to Perform Highly Undetectable Steganography
Pevný, T., Filler, T., & Bas, P. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-16435-4_13 · Cited by 1,009
Steganalysis by Subtractive Pixel Adjacency Matrix
Pevny, T., Bas, P., & Fridrich, J. (2010) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2010.2045842 · Cited by 887
Self-citationSteganalysis by subtractive pixel adjacency matrix
Pevný, T., Bas, P., & Fridrich, J. (2009) · Proceedings of the 11th ACM workshop on Multimedia and security · doi:10.1145/1597817.1597831 · Cited by 769
Self-citationEdge Adaptive Image Steganography Based on LSB Matching Revisited
Luo, W., Huang, F., & Huang, J. (2010) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2010.2041812 · Cited by 661
Attribute bagging: improving accuracy of classifier ensembles by using random feature subsets
Bryll, R., Gutierrez-Osuna, R., & Quek, F. (2003) · Pattern Recognition · doi:10.1016/s0031-3203(02)00121-8 · Cited by 481
Fridrich, J. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30114-1_6 · Cited by 459
Self-citationDetecting Hidden Messages Using Higher-Order Statistics and Support Vector Machines
Lyu, S., & Farid, H. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-36415-3_22 · Cited by 450
Nonlinear Estimation and Classification
(2003) · Lecture Notes in Statistics · doi:10.1007/978-0-387-21579-2 · Cited by 390
Statistically undetectable jpeg steganography
Fridrich, J., Pevný, T., & Kodovský, J. (2007) · doi:10.1145/1288869.1288872 · Cited by 377
Self-citationA Markov Process Based Approach to Effective Attacking JPEG Steganography
Shi, Y. Q., Chen, C., & Chen, W. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-74124-4_17 · Cited by 344
LIBLINEAR: A Library for Large Linear Classification
FanRong-En, ChangKai-Wei, HsiehCho-Jui, WangXiang-Rui, & LinChih-Jen (2008) · Journal of Machine Learning Research · doi:10.5555/1390681.1442794 · Cited by 328
Gibbs Construction in Steganography
Filler, T., & Fridrich, J. (2010) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2010.2077629 · Cited by 302
Self-citationNew blind steganalysis and its implications
Goljan, M., Fridrich, J., & Holotyak, T. (2006) · SPIE Proceedings · doi:10.1117/12.643254 · Cited by 265
Self-citationKodovský, J., & Fridrich, J. (2009) · Proceedings of the 11th ACM workshop on Multimedia and security · doi:10.1145/1597817.1597830 · Cited by 259
Self-citationJPEG image steganalysis utilizing both intrablock and interblock correlations
Chen, C., & Shi, Y. Q. (2008) · 2008 IEEE International Symposium on Circuits and Systems · doi:10.1109/iscas.2008.4542096 · Cited by 241
Random Subspace Ensembles for fMRI Classification
Kuncheva, L. I., Rodriguez, J. J., Plumpton, C. O., Linden, D. E. J., & Johnston, S. J. (2010) · IEEE Transactions on Medical Imaging · doi:10.1109/tmi.2009.2037756 · Cited by 228
YASS: Yet Another Steganographic Scheme That Resists Blind Steganalysis
Solanki, K., Sarkar, A., & Manjunath, B. S. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-77370-2_2 · Cited by 223
Lal, T. N., Chapelle, O., Weston, J., & Elisseeff, A. (2008) · Studies in Fuzziness and Soft Computing · doi:10.1007/978-3-540-35488-8_6 · Cited by 209
Image Steganalysis with Binary Similarity Measures
Avcıbaş, İ., Kharrazi, M., Memon, N., & Sankur, B. (2005) · EURASIP Journal on Advances in Signal Processing · doi:10.1155/asp.2005.2749 · Cited by 190
Robust Image-Adaptive Data Hiding Using Erasure and Error Correction
Solanki, K. V., Jacobsen, N., Madhow, U., Manjunath, B. S., & Chandrasekaran, S. (2004) · IEEE Transactions on Image Processing · doi:10.1109/tip.2004.837557 · Cited by 145
Steganalysis in high dimensions: fusing classifiers built on random subspaces
Kodovský, J., & Fridrich, J. (2011) · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · doi:10.1117/12.872279 · Cited by 138
Self-citationClassification by ensembles from random partitions of high-dimensional data
Ahn, H., Moon, H., Fazzari, M. J., Lim, N., Chen, J. J., & Kodell, R. L. (2007) · Computational Statistics & Data Analysis · doi:10.1016/j.csda.2006.12.043 · Cited by 116
Image steganalysis with binary similarity measures
Avcıbaş, İ., Memon, N. D., & Sankur, B. (2003) · Proceedings - International Conference on Image Processing · doi:10.1109/icip.2002.1039053 · Cited by 106
Steganalysis of Content-Adaptive Steganography in Spatial Domain
Fridrich, J., Kodovský, J., Holub, V., & Goljan, M. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-24178-9_8 · Cited by 102
Self-citationModern steganalysis can detect YASS
Kodovský, J., Pevný, T., & Fridrich, J. (2010) · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · doi:10.1117/12.838768 · Cited by 89
Self-citationBreaking HUGO – The Process Discovery
Fridrich, J., Kodovský, J., Holub, V., & Goljan, M. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-24178-9_7 · Cited by 68
Self-citationA New Methodology in Steganalysis: Breaking Highly Undetectable Steganograpy (HUGO)
Gül, G., & Kurugöllü, F. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-24178-9_6 · Cited by 66
Further study on YASS: steganography based on randomized embedding to resist blind steganalysis
Sarkar, A., Solanki, K. V., & Manjunath, B. S. (2008) · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · doi:10.1117/12.767893 · Cited by 59
The support vector decomposition machine
Pereira, F., & Gordon, G. J. (2006) · International Conference on Machine Learning · doi:10.1145/1143844.1143931 · Cited by 46
Cited by
Rich Models for Steganalysis of Digital Images
Fridrich, J., & Kodovsky, J. (2012) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2012.2190402 · Cited by 2,144
Self-citationUniversal distortion function for steganography in an arbitrary domain
Holub, V., Fridrich, J., & Denemark, T. (2014) · EURASIP Journal on Information Security · doi:10.1186/1687-417x-2014-1 · Cited by 1,202
Self-citationUsing deep transfer learning for image-based plant disease identification
Chen, J., Chen, J., Zhang, D., Sun, Y., & Nanehkaran, Y. A. (2020) · Computers and Electronics in Agriculture · doi:10.1016/j.compag.2020.105393 · Cited by 1,052
Deep Residual Network for Steganalysis of Digital Images
Boroumand, M., Chen, M., & Fridrich, J. (2019) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2018.2871749 · Cited by 1,032
Self-citationDesigning steganographic distortion using directional filters
Holub, V., & Fridrich, J. (2012) · 2012 IEEE International Workshop on Information Forensics and Security (WIFS) · doi:10.1109/wifs.2012.6412655 · Cited by 966
Self-citation
Metadata
- Authors
- Kodovsky, J., Fridrich, J., & Holub, V.
- Venue
- IEEE Transactions on Information Forensics and Security
- Published
- 2012-04
- Volume
- 7
- Issue
- 2
- Pages
- 432-444
- ISSN
- 1556-6013 (ISSN-L)
- 1556-6021
- OpenAlex
- W2124664712
- Cited by
- 1,064
- References
- 44
- FWCI
- 39.34
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.