Journal title
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
DOI
10.1007/978-3-540-77370-2_14
Volume
4567 LNCS
Last updated
2025-04-11T09:28:06.853+01:00
Page
204-219
Abstract
This paper draws together two methodologies for the detection of bit replacement steganography: the principle of maximum likelihood, which is statistically well-founded but has lead to weak detectors in practice, and so-called structural detection, which is sensitive but lacks optimality and can suffer from complicated exposition. The key novelty is to extend structural analysis to include a hypothetical "pre-cover", from which the cover object is imagined to derive. Here, maximum likelihood detection is presented for three structural detectors. Although the algebraic derivation is long, and maximizing the likelihood function difficult in practice, conceptually the new detectors are reasonably simple. Experiments show that the new detectors are the best performers yet, very significantly so in the detection of replacement of multiple bit planes. © 2008 Springer-Verlag Berlin Heidelberg.
Symplectic ID
292060
Submitted to ORA
Off
Favourite
Off
Publication type
Conference Paper
Publication date
01 Dec 2007