By Topic

JPEG Based Conditional Entropy Coding for Correlated Steganography

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)
Lei Zheng ; Department of Electronic and Electrical Engineering, University College London, United Kingdom ; Ingemar J. Cox

Correlated steganography considers the case in which the cover work is chosen to be correlated with the covert message that is to be hidden. The advantage of this is that, at least theoretically, the number of bits needed to encode the hidden message can be considerably reduced since it is based on the conditional entropy of the message given the cover. This may be much less than the entropy of the message itself. And if the number of bits needed to embed the hidden message is significantly reduced, then it is more likely that the steganographic algorithm will be secure, i.e. undetectable. In this paper, we describe an example of correlated steganography. Specifically, we are interested in embedding a covert image into a cover image. Comparative experiments indicate that selecting a cover Work that is correlated with the covert message can reduce the number of bits needed to represent the covert image below that needed by standard JPEG compression, provided the two images are sufficiently correlated.

Published in:

2007 IEEE International Conference on Multimedia and Expo

Date of Conference:

2-5 July 2007