Gaussian Rate-Distortion-Perception Coding and Entropy-Constrained Scalar Quantization
Li Xie, Liangyan Li, Jun Chen, Lei Yu, Zhongshan Zhang
TL;DR
This work analyzes the quadratic Gaussian rate-distortion-perception problem under limited common randomness for two perception measures: KL divergence and squared Wasserstein-2 distance. It establishes that KL-based and W2-based bounds are nondegenerate (not derivable from one another via refined Talagrand inequalities), and proves an improved, tunable lower bound for the W2 case. By linking rate-distortion-perception to entropy-constrained scalar quantization, it shows that these bounds are not generally tight in the weak-perception regime and that restricting reconstructions to Gaussian distributions can incur penalties under i.i.d. constraints. The results illuminate when Gaussian extremality holds, clarify the relation between KL and W2 measures, and suggest that discrete reconstructions may yield better performance in practice, with important implications for perception-aware coding design.
Abstract
This paper investigates the best known bounds on the quadratic Gaussian distortion-rate-perception function with limited common randomness for the Kullback-Leibler divergence-based perception measure, as well as their counterparts for the squared Wasserstein-2 distance-based perception measure, recently established by Xie et al. These bounds are shown to be nondegenerate in the sense that they cannot be deduced from each other via a refined version of Talagrand's transportation inequality. On the other hand, an improved lower bound is established when the perception measure is given by the squared Wasserstein-2 distance. In addition, it is revealed by exploiting the connection between rate-distortion-perception coding and entropy-constrained scalar quantization that all the aforementioned bounds are generally not tight in the weak perception constraint regime.
