z-logo
open-access-imgOpen Access
On completeness of feature spaces in blind steganalysis
Author(s) -
Jan Kodovský,
Jessica Fridrich
Publication year - 2008
Publication title -
citeseer x (the pennsylvania state university)
Language(s) - English
Resource type - Conference proceedings
DOI - 10.1145/1411328.1411352
Subject(s) - steganalysis , steganography , feature vector , computer science , feature (linguistics) , pattern recognition (psychology) , artificial intelligence , feature extraction , completeness (order theory) , benchmarking , embedding , data mining , mathematics , mathematical analysis , linguistics , philosophy , marketing , business
Blind steganalyzers can be used for many diverse applications in steganography that go well beyond a mere detection of stego content. A blind steganalyzer can also be used for constructing targeted attacks or as an oracle for designing steganographic methods. The feature space itself provides a low-dimensional model of covers useful for benchmarking. These applications require the feature space to be complete in the sense that the features fully characterize the space of covers. Incomplete feature sets may skew benchmarking scores and lead to poor steganalysis. As a simple test of completeness, we propose a general approach for constructing steganographic methods that approximately preserve the whole feature vector and thus become practically undetectable by any steganalyzer that uses the same feature set. We demonstrate the plausibility of this approach, which we call the Feature Correction Method (FCM) by constructing the FCM for a 274-dimensional feature set from a state-of-the-art blind steganalyzer for JPEG images.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom