Leveraging Data Geometry to Mitigate CSM in Steganalysis (2310.04479v1)
Abstract: In operational scenarios, steganographers use sets of covers from various sensors and processing pipelines that differ significantly from those used by researchers to train steganalysis models. This leads to an inevitable performance gap when dealing with out-of-distribution covers, commonly referred to as Cover Source Mismatch (CSM). In this study, we consider the scenario where test images are processed using the same pipeline. However, knowledge regarding both the labels and the balance between cover and stego is missing. Our objective is to identify a training dataset that allows for maximum generalization to our target. By exploring a grid of processing pipelines fostering CSM, we discovered a geometrical metric based on the chordal distance between subspaces spanned by DCTr features, that exhibits high correlation with operational regret while being not affected by the cover-stego balance. Our contribution lies in the development of a strategy that enables the selection or derivation of customized training datasets, enhancing the overall generalization performance for a given target. Experimental validation highlights that our geometry-based optimization strategy outperforms traditional atomistic methods given reasonable assumptions. Additional resources are available at github.com/RonyAbecidan/LeveragingGeometrytoMitigateCSM.
- Q. Giboulot, R. Cogranne, D. Borghys, and P. Bas, “Effects and Solutions of Cover-Source Mismatch in Image Steganalysis,” Signal Processing: Image Communication, Aug. 2020. [Online]. Available: https://hal-utt.archives-ouvertes.fr/hal-02631559
- J. Pasquet, S. Bringay, and M. Chaumont, “Steganalysis with cover-source mismatch and a small learning database,” in EUSIPCO: European Signal Processing Conference, Lisbon, Portugal, Sep. 2014, pp. 2425–2429. [Online]. Available: https://hal-lirmm.ccsd.cnrs.fr/lirmm-01234249
- J. Kodovský, V. Sedighi, and J. Fridrich, “Study of cover source mismatch in steganalysis and ways to mitigate its impact,” in Media Watermarking, Security, and Forensics 2014, vol. 9028. [Online]. Available: https://doi.org/10.1117/12.2039693
- P. Bas, T. Filler, and T. Pevny, “”Break Our Steganographic System”: The Ins and Outs of Organizing BOSS,” in INFORMATION HIDING, ser. Lecture Notes in Computer Science, vol. 6958/2011, Czech Republic, May 2011, pp. 59–70. [Online]. Available: https://hal.archives-ouvertes.fr/hal-00648057
- R. Cogranne, Q. Giboulot, and P. Bas, “The ALASKA Steganalysis Challenge: A First Step Towards Steganalysis ”Into The Wild”,” ser. ACM IH&MMSec (Information Hiding & Multimedia Security), Paris, France, Jul. 2019. [Online]. Available: https://hal.archives-ouvertes.fr/hal-02147763
- R. Abecidan, V. Itier, J. Boulanger, P. Bas, and T. Pevný, “Using set covering to generate databases for holistic steganalysis,” 2022.
- D. Šepák, L. Adam, and T. Pevný, “Formalizing cover-source mismatch as a robust optimization,” in EUSIPCO: European Signal Processing Conference, Belgrade, Serbia, Sep. 2022.
- V. Holub and J. Fridrich, “Low-complexity features for jpeg steganalysis using undecimated dct,” IEEE Transactions on Information Forensics and Security, vol. 10, no. 2, pp. 219–228, 2015.
- Y. Bengio, A. Courville, and P. Vincent, “Representation learning: A review and new perspectives,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 35, no. 8, pp. 1798–1828, 2013.
- L. Guo, J. Ni, W. Su, C. Tang, and Y.-Q. Shi, “Using statistical image model for jpeg steganography: Uniform embedding revisited,” IEEE Transactions on Information Forensics and Security, vol. 10, no. 12, pp. 2669–2680, 2015.
- J. Feydy, “Geometric data analysis, beyond convolutions,” Theses, Université Paris-Saclay, Jul. 2020. [Online]. Available: https://theses.hal.science/tel-02945979
- J. Feydy, T. Séjourné, F.-X. Vialard, S.-i. Amari, A. Trouve, and G. Peyré, “Interpolating between optimal transport and mmd using sinkhorn divergences,” in The 22nd International Conference on Artificial Intelligence and Statistics, 2019, pp. 2681–2690.
- A. V. Knyazev and M. E. Argentati, “Principal angles between subspaces in an a-based scalar product: Algorithms and perturbation estimates,” SIAM Journal on Scientific Computing, vol. 23, no. 6, pp. 2008–2040, 2002. [Online]. Available: https://doi.org/10.1137/S1064827500377332
- K. Ye and L.-H. Lim, “Schubert varieties and distances between subspaces of different dimensions,” SIAM Journal on Matrix Analysis and Applications, vol. 37, no. 3, pp. 1176–1197, 2016.
Sponsored by Paperpile, the PDF & BibTeX manager trusted by top AI labs.
Get 30 days freePaper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.