DocumentCode
2973168
Title
How to find relevant training data: A paired bootstrapping approach to blind steganalysis
Author
Pham Hai Dang Le ; Franz, Matthias O.
Author_Institution
Inst. for Opt. Syst., HTWG Konstanz, Konstanz, Germany
fYear
2012
fDate
2-5 Dec. 2012
Firstpage
228
Lastpage
233
Abstract
Today, support vector machines (SVMs) seem to be the classifier of choice in blind steganalysis. This approach needs two steps: first, a training phase determines a separating hyperplane that distinguishes between cover and stego images; second, in a test phase the class membership of an unknown input image is detected using this hyperplane. As in all statistical classifiers, the number of training images is a critical factor: the more images that are used in the training phase, the better the steganalysis performance will be in the test phase, however at the price of a greatly increased training time of the SVM algorithm. Interestingly, only a few training data, the support vectors, determine the separating hyperplane of the SVM. In this paper, we introduce a paired bootstrapping approach specifically developed for the steganalysis scenario that selects likely candidates for support vectors. The resulting training set is considerably smaller, without a significant loss of steganalysis performance.
Keywords
image classification; image processing; performance evaluation; statistical analysis; steganography; support vector machines; SVM algorithm; SVM classifier; blind steganalysis; cover images; input image detection; paired bootstrapping approach; separating hyperplane determination; statistical classifiers; steganalysis performance improvement; stego images; support vector machines; training images; training phase; Erbium; Feature extraction; Markov processes; Support vector machines; Training; Training data; Unsolicited electronic mail;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Forensics and Security (WIFS), 2012 IEEE International Workshop on
Conference_Location
Tenerife
Print_ISBN
978-1-4673-2285-0
Electronic_ISBN
978-1-4673-2286-7
Type
conf
DOI
10.1109/WIFS.2012.6412654
Filename
6412654
Link To Document