Pith. sign in

REVIEW 2 cited by

On Distribution Preserving 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

arxiv 1108.3728 v1 pith:UQGN5RKG submitted 2011-08-18 cs.IT math.IT

classification cs.ITmath.IT
keywords quantizationdistributiondp-rdfpreservingschemedistortionfunctionrate
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Upon compressing perceptually relevant signals, conventional quantization generally results in unnatural outcomes at low rates. We propose distribution preserving quantization (DPQ) to solve this problem. DPQ is a new quantization concept that confines the probability space of the reconstruction to be identical to that of the source. A distinctive feature of DPQ is that it facilitates a seamless transition between signal synthesis and quantization. A theoretical analysis of DPQ leads to a distribution preserving rate-distortion function (DP-RDF), which serves as a lower bound on the rate of any DPQ scheme, under a constraint on distortion. In general situations, the DP-RDF approaches the classic rate-distortion function for the same source and distortion measure, in the limit of an increasing rate. A practical DPQ scheme based on a multivariate transformation is also proposed. This scheme asymptotically achieves the DP-RDF for i.i.d. Gaussian sources and the mean squared error.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Rate-Distortion-Perception Trade-off with Strong Realism Constraints: Role of Side Information and Common Randomness

    cs.IT 2025-07 accept novelty 7.0 of 10

    The paper gives single-letter rate-distortion-perception limits for lossy compression with side information under strong realism constraints, including a complete Gaussian solution.

  2. Lossy Compression, Realism, and Coordination

    cs.IT 2026-08 accept novelty 4.0 of 10

    Rate-distortion-perception compression and channel-synthesis coordination are two sides of the same coin, and the paper proposes transferring batched-critic realism ideas to coordination as an open problem.

Pith tools