On cascade source coding with a side information 'vending machine'

Behzad Ahmadi; Osvaldo Simeone; Chiranjib Choudhuri; Urbashi Mitra

doi:10.1109/ITW.2012.6404735

On cascade source coding with a side information 'vending machine'

Behzad Ahmadi, Osvaldo Simeone, Chiranjib Choudhuri, Urbashi Mitra

Electrical and Computer Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

The model of a side information 'vending machine' accounts for scenarios in which acquiring side information is costly and thus should be done efficiently. In this paper, the three-node cascade source coding problem is studied under the assumption that a side information vending machine is available either at the intermediate or at the end node. In both cases, a single-letter characterization of the available trade-offs among the rate, the distortions in the reconstructions at the intermediate and at the end node, and the cost in acquiring the side information are derived under given conditions.

Original language	English (US)
Title of host publication	2012 IEEE Information Theory Workshop, ITW 2012
Pages	552-556
Number of pages	5
DOIs	https://doi.org/10.1109/ITW.2012.6404735
State	Published - 2012
Event	2012 IEEE Information Theory Workshop, ITW 2012 - Lausanne, Switzerland Duration: Sep 3 2012 → Sep 7 2012

Publication series

Name	2012 IEEE Information Theory Workshop, ITW 2012

Other

Other	2012 IEEE Information Theory Workshop, ITW 2012
Country/Territory	Switzerland
City	Lausanne
Period	9/3/12 → 9/7/12

All Science Journal Classification (ASJC) codes

Information Systems

Keywords

Rate-distortion theory
cascade source coding
common reconstruction constraint
side information
vending machine

Access to Document

10.1109/ITW.2012.6404735

Cite this

@inproceedings{e656ca92a0cb42818919d458967cd46b,

title = "On cascade source coding with a side information 'vending machine'",

abstract = "The model of a side information 'vending machine' accounts for scenarios in which acquiring side information is costly and thus should be done efficiently. In this paper, the three-node cascade source coding problem is studied under the assumption that a side information vending machine is available either at the intermediate or at the end node. In both cases, a single-letter characterization of the available trade-offs among the rate, the distortions in the reconstructions at the intermediate and at the end node, and the cost in acquiring the side information are derived under given conditions.",

keywords = "Rate-distortion theory, cascade source coding, common reconstruction constraint, side information, vending machine",

author = "Behzad Ahmadi and Osvaldo Simeone and Chiranjib Choudhuri and Urbashi Mitra",

year = "2012",

doi = "10.1109/ITW.2012.6404735",

language = "English (US)",

isbn = "9781467302234",

series = "2012 IEEE Information Theory Workshop, ITW 2012",

pages = "552--556",

booktitle = "2012 IEEE Information Theory Workshop, ITW 2012",

note = "2012 IEEE Information Theory Workshop, ITW 2012 ; Conference date: 03-09-2012 Through 07-09-2012",

}

TY - GEN

T1 - On cascade source coding with a side information 'vending machine'

AU - Ahmadi, Behzad

AU - Simeone, Osvaldo

AU - Choudhuri, Chiranjib

AU - Mitra, Urbashi

PY - 2012

Y1 - 2012

N2 - The model of a side information 'vending machine' accounts for scenarios in which acquiring side information is costly and thus should be done efficiently. In this paper, the three-node cascade source coding problem is studied under the assumption that a side information vending machine is available either at the intermediate or at the end node. In both cases, a single-letter characterization of the available trade-offs among the rate, the distortions in the reconstructions at the intermediate and at the end node, and the cost in acquiring the side information are derived under given conditions.

AB - The model of a side information 'vending machine' accounts for scenarios in which acquiring side information is costly and thus should be done efficiently. In this paper, the three-node cascade source coding problem is studied under the assumption that a side information vending machine is available either at the intermediate or at the end node. In both cases, a single-letter characterization of the available trade-offs among the rate, the distortions in the reconstructions at the intermediate and at the end node, and the cost in acquiring the side information are derived under given conditions.

KW - Rate-distortion theory

KW - cascade source coding

KW - common reconstruction constraint

KW - side information

KW - vending machine

UR - http://www.scopus.com/inward/record.url?scp=84873179819&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84873179819&partnerID=8YFLogxK

U2 - 10.1109/ITW.2012.6404735

DO - 10.1109/ITW.2012.6404735

M3 - Conference contribution

AN - SCOPUS:84873179819

SN - 9781467302234

T3 - 2012 IEEE Information Theory Workshop, ITW 2012

SP - 552

EP - 556

BT - 2012 IEEE Information Theory Workshop, ITW 2012

T2 - 2012 IEEE Information Theory Workshop, ITW 2012

Y2 - 3 September 2012 through 7 September 2012

ER -

On cascade source coding with a side information 'vending machine'

Abstract

Publication series

Other

All Science Journal Classification (ASJC) codes

Keywords

Access to Document

Other files and links

Fingerprint

Cite this