22 March 2013 The challenges of rich features in universal steganalysis
Author Affiliations +
Abstract
Contemporary steganalysis is driven by new steganographic rich feature sets, which consist of large numbers of weak features. Although extremely powerful when applied to supervised classification problems, they are not compatible with unsupervised universal steganalysis, because the unsupervised method cannot separate the signal (evidence of steganographic embedding) from the noise (cover content). This work tries to alleviate the problem, by means of feature extraction algorithms. We focus on linear projections informed by embedding methods, and propose a new method which we call calibrated least squares with the specific aim of making the projections sensitive to stego content yet insensitive to cover variation. Different projections are evaluated by their application to the anomaly detector from Ref. 1, and we are able to retain both the universality and the robustness of the method, while increasing its performance substantially.
© (2013) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Tomáš Pevný, Tomáš Pevný, Andrew D. Ker, Andrew D. Ker, } "The challenges of rich features in universal steganalysis", Proc. SPIE 8665, Media Watermarking, Security, and Forensics 2013, 86650M (22 March 2013); doi: 10.1117/12.2006790; https://doi.org/10.1117/12.2006790
PROCEEDINGS
15 PAGES


SHARE
RELATED CONTENT

Study of cover source mismatch in steganalysis and ways to...
Proceedings of SPIE (February 18 2014)
Exploring multitask learning for steganalysis
Proceedings of SPIE (March 21 2013)
Modern steganalysis can detect YASS
Proceedings of SPIE (January 27 2010)

Back to Top