Universal Sampling Rate Distortion

DOI10.1109/TIT.2018.2857829MaRDI QIDQ4562137zbMATH OpenOpenAlexWikidataFDO

Authors Vinay Praneeth Boda, Prakash Narayan

Publication date 18 December 2018

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1706.07409

Statistical aspects of information-theoretic topics (62B10) Rate-distortion theory in information and communication theory (94A34)

Abstract: We examine the coordinated and universal rate-efficient sampling of a subset of correlated discrete memoryless sources followed by lossy compression of the sampled sources. The goal is to reconstruct a predesignated subset of sources within a specified level of distortion. The combined sampling mechanism and rate distortion code are universal in that they are devised to perform robustly without exact knowledge of the underlying joint probability distribution of the sources. In Bayesian as well as nonBayesian settings, single-letter characterizations are provided for the universal sampling rate distortion function for fixed-set sampling, independent random sampling and memoryless random sampling. It is illustrated how these sampling mechanisms are successively better. Our achievability proofs bring forth new schemes for joint source distribution-learning and lossy compression.

This page was built for publication: Universal Sampling Rate Distortion

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4562137)