Robust coding for lossy computing with receiver-side observation costs

1 An encoder wishes to minimize the bit rate necessary to guarantee that a decoder is able to calculate a symbol-wise function of a sequence available only at the encoder and a sequence that can be measured only at the decoder. This classical problem, first studied by Yamamoto, is addressed here by...

Full description

Saved in:
Bibliographic Details
Published in:2011 IEEE International Symposium on Information Theory Proceedings pp. 2939 - 2943
Main Authors: Ahmadi, B., Simeone, O.
Format: Conference Proceeding
Language:English
Published: IEEE 01.07.2011
Subjects:
Decoding
Distortion measurement
Irrigation
Loss measurement
Noise measurement
Robustness
Zinc
ISBN:1457705966, 9781457705960
ISSN:2157-8095
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:1 An encoder wishes to minimize the bit rate necessary to guarantee that a decoder is able to calculate a symbol-wise function of a sequence available only at the encoder and a sequence that can be measured only at the decoder. This classical problem, first studied by Yamamoto, is addressed here by including two new aspects: (i) The decoder obtains noisy measurements of its sequence, where the quality of such measurements can be controlled via a cost-constrained "action" sequence; (ii) Measurement at the decoder may fail in a way that is unpredictable to the encoder, thus requiring robust encoding. The considered scenario generalizes known settings such as the Heegard-Berger-Kaspi and the "source coding with a vending machine" problems. The rate-distortion-cost function is derived in relevant special cases, along with general upper and lower bounds. Numerical examples are also worked out to obtain further insight into the optimal system design.
ISBN:1457705966
9781457705960
ISSN:2157-8095
DOI:10.1109/ISIT.2011.6034115