Heegard-berger and cascade source coding problems with common reconstruction constraints

Behzad Ahmadi, Ravi Tandon, Osvaldo Simeone, H. Vincent Poor

Research output: Contribution to journalArticle

13 Scopus citations

Abstract

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 derived recently 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 metrics. The rate-distortion function is then characterized for the HB problem with cooperating decoders and (physically) degraded side information. For the cascade problem with the CR constraint, the rate-distortion region is obtained under the assumption that side information at the final node is physically degraded with respect to that at the intermediate node. For the latter two cases, it is worth emphasizing that the corresponding problem without the CR constraint is still open. Outer and inner bounds on the rate-distortion region are also obtained for the cascade problem under the assumption that the side information at the intermediate node is physically degraded with respect to that at the final node. For the three examples mentioned above, the bounds are shown to coincide. Finally, for the HB problem, the rate-distortion function is obtained under the more general requirement of constrained reconstruction, whereby the decoder's estimate must be recovered at the encoder only within some distortion.

Original languageEnglish (US)
Article number6353583
Pages (from-to)1458-1474
Number of pages17
JournalIEEE Transactions on Information Theory
Volume59
Issue number3
DOIs
StatePublished - Feb 20 2013

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences

Keywords

  • Cascade source coding
  • Heegard-Berger (HB) problem
  • common reconstruction (CR)
  • source coding with side information

Fingerprint Dive into the research topics of 'Heegard-berger and cascade source coding problems with common reconstruction constraints'. Together they form a unique fingerprint.

  • Cite this