On the Heegard-Berger/Kaspi problem with decoder cooperation

Vasudevan, Dinkar

doi:10.1109/ictel.2008.4652692

Cited by 4 publications

(8 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…3, decoder cooperation is enabled by a limited capacity link from one decoder (Decoder 1) to the other (Decoder 2). Inner and outer bounds to the rate distortion region for this problem are obtained in [8] under the assumption that the side information of Decoder 2 is (physically) degraded with respect to that of Decoder 1.…”

Section: A Heegard-berger and Cascade Source Coding Problemsmentioning

confidence: 99%

Heegard–Berger and Cascade Source Coding Problems With Common Reconstruction Constraints

Ahmadi

Tandon

Simeone

et al. 2013

IEEE Trans. Inform. Theory

View full text Add to dashboard Cite

In lossy source coding with side information at the decoder (i.e., the Wyner-Ziv problem), the estimate of the source obtained at the decoder cannot be generally reproduced at the encoder, due to its dependence on the side information. In some applications this may be undesirable, and a Common Reconstruction (CR) requirement, whereby one imposes that the encoder and decoder be able to agree on the decoder's estimate, may be instead in order. The rate-distortion function under the CR constraint has been recently derived for a point-to-point (Wyner-Ziv) problem. In this paper, this result is extended to three multiterminal settings with three nodes, namely the Heegard-Berger (HB) problem, its variant with cooperating decoders and the cascade source coding problem. The HB problem consists of an encoder broadcasting to two decoders with respective side information. The cascade source coding problem is characterized by a two-hop system with side information available at the intermediate and final nodes.For the HB problem with the CR constraint, the rate-distortion function is derived under the assumption that the side information sequences are (stochastically) degraded. The rate-distortion function is also calculated explicitly for three examples, namely Gaussian source and side information with quadratic distortion metric, and binary source and side information with erasure and Hamming distortion B. Ahmadi and O. Simeone are with the CWCSPR,

show abstract

Section: A Heegard-berger and Cascade Source Coding Problemsmentioning

confidence: 99%

Heegard–Berger and Cascade Source Coding Problems With Common Reconstruction Constraints

Ahmadi

Tandon

Simeone

et al. 2013

IEEE Trans. Inform. Theory

View full text Add to dashboard Cite

show abstract

“…The rate region for the listening-helper source-coding problem has been determined in [1]- [2] and is described as follows.…”

Section: Problem Formulation and Main Resultsmentioning

confidence: 99%

The listening-helper source-coding problem for a doubly symmetric binary source

Bross

2014

2014 IEEE 28th Convention of Electrical &Amp; Electronics Engineers in Israel (IEEEI)

View full text Add to dashboard Cite

In the listening-helper source-coding problem Encoder 1 and Decoder 1 observe respectively a pair of i.i.d. correlated sources and both wish to communicate the first source to Decoder 2 subject to a distortion constraint. Encoder 1 sends a message to both decoders and then Decoder 1-the listeninghelper-sends a message just to Decoder 2.For the case of a doubly binary symmetric source and Hamming distortion we determine the rate region for this problem as a function of the distortion constraint. In the derivation of the outer bound we show that the evaluation may be restricted to a set of auxiliary random variables satisfying a long Markov structure.

show abstract

“…If we remove the CR constraint, the problem of determining the rate-distortion region for the setting of Fig. 1 under the Markov assumption X − Y 1 − Y 2 is still open [3].…”

Section: A Rate-distortion Region Formentioning

confidence: 99%

“…1, switch open), and its variant, studied in [3], in which decoder cooperation is enabled by a limited capacity link from one decoder, Decoder 1, to the other, Decoder 2 ( Fig. 1, switch closed).…”

Section: Introductionmentioning

confidence: 99%

“…We recall that [1] derived the rate-distortion function for the HB problem (without CR constraints) under the assumption that the side information sequences are stochastically degraded versions of the source X n . Instead, for the case with decoder cooperation, inner and outer bounds on the rate distortion region for this problem are obtained in [3] (without CR constraints) under the assumption that the side information of Decoder 2 is physically degraded with respect to that of Decoder 1.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

On the Heegard-Berger problem with common reconstruction constraints

Ahmadi¹,

Tandon

Simeone³

et al. 2012

2012 IEEE International Symposium on Information Theory Proceedings

View full text Add to dashboard Cite

In lossy source coding with side information at the decoder (i.e., the Wyner-Ziv problem), the estimate of the source obtained at the decoder cannot be generally reproduced at the encoder, due to its dependence on the side information. In some applications this may be undesirable, and a Common Reconstruction (CR) requirement, whereby one imposes that encoder and decoder be able to agree on the decoder's estimate, may be instead in order. The rate-distortion function under the CR constraint has been recently derived for the point-topoint (Wyner-Ziv) problem. In this paper, this result is extended to the Heegard-Berger (HB) problem and to its variant with cooperating decoders. Specifically, for the HB problem, the ratedistortion function is derived under the assumption that the side information sequences at the two decoders are stochastically degraded. The rate-distortion function is also calculated explicitly for the special case of binary source and erased side information with Hamming distortion metric. The rate-distortion function is then characterized also for the HB problem with cooperating decoders and physically degraded side information.

show abstract

On the Heegard-Berger/Kaspi problem with decoder cooperation

Cited by 4 publications

References 4 publications

Heegard–Berger and Cascade Source Coding Problems With Common Reconstruction Constraints

Heegard–Berger and Cascade Source Coding Problems With Common Reconstruction Constraints

The listening-helper source-coding problem for a doubly symmetric binary source

On the Heegard-Berger problem with common reconstruction constraints

Contact Info

Product

Resources

About