By Topic

On Successive Refinement for the Kaspi/Heegard–Berger Problem

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

Consider a source that produces independent copies of a triplet of jointly distributed random variables {Xi,Yi,Zi }z =1. The process {Xi} is observed at the encoder, and is supposed to be reproduced at two decoders, decoder Y and decoder Z, where {Yi} and {Zi} are observed, respectively, in either a causal or noncausal manner. The communication between the encoder and the decoders is carried in two successive stages. In the first stage, the transmission is available to both decoders and they reconstruct the source according to the received bit-stream and the individual side information ( {Zi} or {Yi}). In the second stage, additional information is sent to both decoders and they refine the reconstructions of the source according to the available side information and the transmissions at both stages. It is desired to find the necessary and sufficient conditions on the communication rates between the encoder and decoders, so that the distortions incurred (at each stage) will not exceed given thresholds. For the case of causal availability of side information at the decoders, an exact single-letter characterization of the achievable region is derived for the case of pure source-coding. Then, for the case of communication between the encoder and decoders carried over independent memoryless discrete channels with random states known causally/noncausally at the encoder and with causal side information about the source at the decoders, a single-letter characterization of all achievable distortion in both stages is provided and it is shown that the separation theorem holds. The results are derived without assuming any structural restrictions on side information, such as a Markov structure, etc. Finally, for noncausal degraded side information, inner and outer bounds to the achievable rate-distortion region are de- - rived. These bounds are shown to be tight for certain cases of reconstruction requirements at the decoders. Due to the system setup, these results also shed some light on a problem of successive refinement with side information which is not degraded in the usual sense.

Published in:

Information Theory, IEEE Transactions on  (Volume:56 ,  Issue: 8 )