Abstract
AbstractState‐of‐the‐art steganographic schemes, such as highly undetectable stego (HUGO) and its extended version, aim at least significant bit (LSB)‐based approaches embedding up to 1 bpp and are more concerned about the undetectability level of the stego image rather than the peak signal‐to‐noise ratio. The complexity of such methods is quite high, too. In this work, a steganographic scheme is proposed in a spatial domain that takes advantage of error images resulting from applying an image quality factor (the same as the ones used in JPEG compression) in order to find the pixels where a slight change could be made. The amount of change is adaptively embedded using LSB matching revisited. We show that our proposed method is less detectable than HUGO and almost as undetectable as the extended HUGO while it has a greater time performance. Copyright © 2014 John Wiley & Sons, Ltd.
Published Version (
Free)
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call