The Likelihood Encoder for Lossy Compression

DOI10.1109/TIT.2016.2529657MaRDI QIDQ2976905zbMATH OpenFDO

Authors Eva C. Song, P. Cuff, H. Vincent Poor

Publication date 28 April 2017

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

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

Mathematics Subject Classification ID

Source coding (94A29)

Abstract: A likelihood encoder is studied in the context of lossy source compression. The analysis of the likelihood encoder is based on the soft-covering lemma. It is demonstrated that the use of a likelihood encoder together with the soft-covering lemma yields simple achievability proofs for classical source coding problems. The cases of the point-to-point rate-distortion function, the rate-distortion function with side information at the decoder (i.e. the Wyner-Ziv problem), and the multi-terminal source coding inner bound (i.e. the Berger-Tung problem) are examined in this paper. Furthermore, a non-asymptotic analysis is used for the point-to-point case to examine the upper bound on the excess distortion provided by this method. The likelihood encoder is also related to a recent alternative technique using properties of random binning.

Cited in

(5)

• On Joint Information Embedding and Lossy Compression
• A Single-Shot Approach to Lossy Source Coding Under Logarithmic Loss
• Entropy-based selection of cluster representatives for document image compression
• An Introduction to Neural Data Compression
• Channel simulation: theory and applications to lossy compression and differential privacy

This page was built for publication: The Likelihood Encoder for Lossy Compression

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