Share Email Print
cover

Proceedings Paper

Evaluating the optimal probability distribution for steganography under zero error conditions
Author(s): Gareth C. Brisbane; Rei Safavi-Naini; Philip O. Ogunbona
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

Information hiding can be performed under the guise of a digital image. We consider the following scenario: Alice and Bob share an image and would like to use it as a cover image to communicate a message m. We are interested in answering two questions: What is the maximum amount of information that can be sent for a given level of degradation to an image? and How can this level of efficiency be achieved in practice? We require the recovered message to be the same as the embedded one. Our model begins with Alice compressing a message to obtain a binary sequence with uniform distribution. She then converts the binary sequence into a Q-ary sequence having a pre-defined distribution, and finally adding each symbol to a pixel. The distribution of the Q-ary sequence is chosen such that the amount of information is maximized for a given value of the signal to noise ratio. Bob recovers the sequence by subtracting the image data, and then converting the Q-ary string into the original binary string. We determine the optimal distribution analytically and provide a graphical representation of the variation of the amount of information with signal-to-noise ratio when the size of the alphabet, Q, varies.

Paper Details

Date Published: 30 January 2003
PDF: 11 pages
Proc. SPIE 4793, Mathematics of Data/Image Coding, Compression, and Encryption V, with Applications, (30 January 2003); doi: 10.1117/12.453534
Show Author Affiliations
Gareth C. Brisbane, Univ. of Wollongong (Australia)
Rei Safavi-Naini, Univ. of Wollongong (Australia)
Philip O. Ogunbona, Motorola Australia Research Ctr. (Australia)


Published in SPIE Proceedings Vol. 4793:
Mathematics of Data/Image Coding, Compression, and Encryption V, with Applications
Mark S. Schmalz, Editor(s)

© SPIE. Terms of Use
Back to Top