Please use this identifier to cite or link to this item:
https://hdl.handle.net/20.500.11851/6070
Title: | A Cost-Effective Decision Tree Based Approach To Steganalysis | Authors: | Li, Liyun Sencar, Hüsrev Taha Memon, Nasir |
Keywords: | computational cost effective decision tree steganography |
Publisher: | Spie-Int Soc Optical Engineering | Source: | Conference on Media Watermarking, Security, and Forensics -- FEB 05-07, 2013 -- Burlingame, CA | Series/Report no.: | Proceedings of SPIE | Abstract: | An important issue concerning real-world deployment of steganalysis systems is the computational cost of acquiring features used in building steganalyzers. Conventional approach to steganalyzer design crucially assumes that all features required for steganalysis have to be computed in advance. However, as the number of features used by typical steganalyzers grow into thousands and timing constraints are imposed on how fast a decision has to be made, this approach becomes impractical. To address this problem, we focus on machine learning aspect of steganalyzer design and introduce a decision tree based approach to steganalysis. The proposed steganalyzer system can minimize the average computational cost for making a steganalysis decision while still maintaining the detection accuracy. To demonstrate the potential of this approach, a series of experiments are performed on well known steganography and steganalysis techniques. | URI: | https://doi.org/10.1117/12.2008527 https://hdl.handle.net/20.500.11851/6070 |
ISBN: | 978-0-8194-9438-2 | ISSN: | 0277-786X 1996-756X |
Appears in Collections: | Bilgisayar Mühendisliği Bölümü / Department of Computer Engineering Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection |
Show full item record
CORE Recommender
SCOPUSTM
Citations
1
checked on Dec 21, 2024
Page view(s)
70
checked on Dec 23, 2024
Google ScholarTM
Check
Altmetric
Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.