mlsanityData to 14 Oct 2026

Rate-Distortion-Perception Tradeoff Based on the Conditional-Distribution Perception Measure

arXiv 2401.12207 ↗First posted 22 Jan 2024cs.IT cs.LG math.ITcited by 8

Not on the map. Why?

Abstract (arXiv)

This paper studies the rate-distortion-perception (RDP) tradeoff for a memoryless source model in the asymptotic limit of large block-lengths. The perception measure is based on a divergence between the distributions of the source and reconstruction sequences conditioned on the encoder output, first proposed by Mentzer et al. We consider the case when there is no shared randomness between the encoder and the decoder and derive a single-letter characterization of the RDP function for the case of discrete memoryless sources. This is in contrast to the marginal-distribution metric case (introduced by Blau and Michaeli), whose RDP characterization remains open when there is no shared randomness. The achievability scheme is based on lossy source coding with a posterior reference map. For the case of continuous valued sources under the squared error distortion measure and the squared quadratic Wasserstein perception measure, we also derive a single-letter characterization and show that the decoder can be restricted to a noise-adding mechanism. Interestingly, the RDP function characterized for the case of zero perception loss coincides with that of the marginal metric, and further zero perception loss can be achieved with a 3-dB penalty in minimum distortion. Finally we specialize to the case of Gaussian sources, and derive the RDP function for Gaussian vector case and propose a reverse water-filling type solution. We also partially characterize the RDP function for a mixture of Gaussian vector sources.

Key facts. Cited by 8 papers in the map (data through 14 Oct 2026). Builds on 17 of its 32 references that are in the map. First posted on arXiv 22 Jan 2024.

Builds on

17 of 32 references.

References · 17

  1. 2016End-to-end Optimized Image Compressioncited by 696
  2. 2017The Perception-Distortion Tradeoffcited by 587
  3. 2020High-Fidelity Generative Image Compressioncited by 338
  4. 2017Lossy Image Compression with Compressive Autoencoderscited by 294
  5. 2018Generative Adversarial Networks for Extreme Learned Image Compressioncited by 219
  6. 2019Rethinking Lossy Compression: The Rate-Distortion-Perception Tradeoffcited by 211
  7. 2018Conditional Probability Models for Deep Image Compressioncited by 133
  8. 2021A Theory of the Distortion-Perception Tradeoff in Wasserstein Spacecited by 52
  9. 2021Universal Rate-Distortion-Perception Representations for Lossy Compressioncited by 47
  10. 2021Neural Video Compression using GANs for Detail Synthesis and Propagationcited by 36
  11. 2020Feedback Recurrent Autoencoder for Video Compressioncited by 30
  12. 2021A coding theorem for the rate-distortion-perception functioncited by 30
5 more
  1. 2021On the advantages of stochastic encoderscited by 28
  2. 2021On Perceptual Lossy Compression: The Cost of Perceptual Reconstruction and An Optimal Training Frameworkcited by 27
  3. 2022The Rate-Distortion-Perception Tradeoff: The Role of Common Randomnesscited by 21
  4. 2022Optimally Controllable Perceptual Lossy Compressioncited by 13
  5. 2023Conditional Perceptual Quality Preserving Image Compressioncited by 6

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2024: 2; 2025: 3; 2026: 3.

8 papers.