REVIEW 2 cited by
Gaussian Rate-Distortion-Perception Coding and Entropy-Constrained Scalar Quantization
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original 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.
Forward citations
Cited by 2 Pith papers
-
Channel-Aware Optimal Transport: A Theoretical Framework for Generative Communication
Without common randomness, a hybrid coding scheme can beat both separation-based and uncoded architectures for channel-aware optimal transport on binary and Gaussian channels.
-
Easz: An Agile Transformer-based Image Compression Framework for Resource-constrained IoTs
Easz compresses images by erasing and squeezing patches on the edge, then reconstructs them on a server with a lightweight transformer at flexible ratios and low edge cost.
Discussion (0). Continue with ORCID to comment.