By Topic

On Joint Information Embedding and Lossy Compression in the Presence of a Stationary Memoryless Attack Channel

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)
A. Maor ; Dept. of Electr. Eng., Technion-Israel Inst. of Technol., Haifa, Israel ; N. Merhav

We consider the problem of optimum joint public information embedding and lossy compression with respect to a fidelity criterion. The decompressed composite sequence (stegotext) is distorted by a stationary memoryless attack, resulting in a forgery which in turn is fed into the decoder, whose task is to retrieve the embedded information. The goal of this paper is to characterize the maximum achievable embedding rate R_e (the embedding capacity C_e ) as a function of the compression (composite) rate R_c and the allowed average distortion level \Delta , such that the average probability of error in decoding of the embedded message can be made arbitrarily small for sufficiently large block length. We characterize the embedding capacity and demonstrate how it can be approached in principle. We also provide a single-letter expression of the minimum achievable composite rate as a function of R_e and \Delta , below which there exists no reliable embedding scheme.

Published in:

IEEE Transactions on Information Theory  (Volume:51 ,  Issue: 9 )