By Topic

An Asymptotically Uniformly Most Powerful Test for LSB Matching Detection

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Rémi Cogranne ; ICD – LM2S, Pôle ROSAS – LM2S, Université de Technologie de Troyes (UTT), UMR STMR – CNRS, TROYES CEDEX ; Florent Retraint

This paper investigates the detection of information hidden in digital media by the least significant bit (LSB) matching scheme. In a theoretical context of known medium parameters, two important results are presented. First, based on the likelihood ratio test, we present a test that asymptotically maximizes the detection power whatever the embedding rate might be. Second, the statistical properties of this test are analytically calculated; it is particularly shown that the decision threshold which warrants a given probability of false-alarm is independent of inspected medium parameters. This provides an asymptotic upper-bound for the detection power of any test that aims at detecting data hidden with the LSB matching method. In practice, when detecting LSB matching, the unknown medium parameters have to be estimated. Based on a local model of digital media, a generalized likelihood ratio test is presented by replacing the unknown parameters by their estimation. Numerical results on large databases highlight the relevance of the proposed methodology and comparison with state-of-the-art detectors shows that the proposed tests perform well.

Published in:

IEEE Transactions on Information Forensics and Security  (Volume:8 ,  Issue: 3 )