Simple algorithmic modifications for improving blind steganalysis performance

  • Authors:
  • Valentin Schwamberger;Matthias O. Franz

  • Affiliations:
  • Max Planck Institute for Biological Cybernetics, 72076 Tübingen, Germany;HTWG Konstanz, 78462 Konstanz, Germany

  • Venue:
  • Proceedings of the 12th ACM workshop on Multimedia and security
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

Most current algorithms for blind steganalysis of images are based on a two-stages approach: First, features are extracted in order to reduce dimensionality and to highlight potential manipulations; second, a classifier trained on pairs of clean and stego images finds a decision rule for these features to detect stego images. Thereby, vector components might vary significantly in their values, hence normalization of the feature vectors is crucial. Furthermore, most classifiers contain free parameters, and an automatic model selection step has to be carried out for adapting these parameters. However, the commonly used cross-validation destroys some information needed by the classifier because of the arbitrary splitting of image pairs (stego and clean version) in the training set. In this paper, we propose simple modifications of normalization and for standard cross-validation. In our experiments, we show that these methods lead to a significant improvement of the standard blind steganalyzer of Lyu and Farid.