21 March 2005 Resampling and the detection of LSB matching in color bitmaps
Author Affiliations +
Abstract
We consider the problem of detecting the presence of hidden data in colour bitmap images. Like straightforward LSB Replacement, LSB Matching (which randomly increments or decrements cover pixels to embed the hidden data in the least significant bits) is attractive because it is extremely simple to implement. It has proved much harder to detect than LSB Replacement because it does not introduce the same asymmetries into the stego image. We expand our recently-developed techniques for the detection of LSB Matching in grayscale images into the full-colour case. Not everything goes through smoothly but the end result is much improved detection, especially for cover images which have been stored as JPEG files, even if subsequently resampled. Evaluation of steganalysis statistics is performed using a distributed steganalysis project. Because evaluation of reliability of detectors for LSB Matching is limited, we begin with a review of the previously-known detectors.
© (2005) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Andrew D. Ker, Andrew D. Ker, "Resampling and the detection of LSB matching in color bitmaps", Proc. SPIE 5681, Security, Steganography, and Watermarking of Multimedia Contents VII, (21 March 2005); doi: 10.1117/12.586622; https://doi.org/10.1117/12.586622
PROCEEDINGS
15 PAGES


SHARE
RELATED CONTENT

Study of cover source mismatch in steganalysis and ways to...
Proceedings of SPIE (February 18 2014)
The challenges of rich features in universal steganalysis
Proceedings of SPIE (March 21 2013)
Limited distortion in LSB steganography
Proceedings of SPIE (February 15 2006)
Batch steganography and the threshold game
Proceedings of SPIE (March 01 2007)

Back to Top