A mapping approach to rate-distortion computation and analysis
- 1 January 1994
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 40 (6) , 1939-1952
- https://doi.org/10.1109/18.340468
Abstract
In rate-distortion theory, results are often derived and stated in terms of the optimizing density over the reproduction space. In this paper, the problem is reformulated in terms of the optimal mapping from the unit interval with Lebesgue measure that would induce the desired reproduction probability density. This results in optimality conditions that are “random relatives” of the known Lloyd (1982) optimality conditions for deterministic quantizers. The validity of the mapping approach is assured by fundamental isomorphism theorems for measure spaces. We show that for the squared error distortion, the optimal reproduction random variable is purely discrete at supercritical distortion (where the Shannon (1948) lower bound is not tight). The Gaussian source is thus the only source that produces continuous reproduction variables for the entire range of positive rate. To analyze the evolution of the optimal reproduction distribution, we use the mapping formulation and establish an analogy to statistical mechanics. The solutions are given by the distribution at isothermal statistical equilibrium, and are parameterized by the temperature in direct correspondence to the parametric solution of the variational equations in rate-distortion theory. The analysis of an annealing process shows how the number of “symbols” grows as the system undergoes phase transitions. Thus, an algorithm based on the mapping approach often needs but a few variables to find the exact solution, while the Blahut (1972) algorithm would only approach it at the limit of infinite resolution. Finally, a quick “deterministic annealing” algorithm to generate the rate-distortion curve is suggested. The resulting curve is exact as long as continuous phase transitions in the process are accurately followedKeywords
This publication has 14 references indexed in Scilit:
- Elements of Information TheoryPublished by Wiley ,2001
- Vector quantization by deterministic annealingIEEE Transactions on Information Theory, 1992
- Probability, Random Processes, and Ergodic PropertiesPublished by Springer Nature ,1988
- Least squares quantization in PCMIEEE Transactions on Information Theory, 1982
- Optimal encoding of discrete-time continuous-amplitude memoryless sources with finite output alphabetsIEEE Transactions on Information Theory, 1980
- An Algorithm for Vector Quantizer DesignIEEE Transactions on Communications, 1980
- Evaluation of rate-distortion functions for a class of independent identically distributed sources under an absolute-magnitude criterionIEEE Transactions on Information Theory, 1975
- Computation of channel capacity and rate-distortion functionsIEEE Transactions on Information Theory, 1972
- An algorithm for computing the capacity of arbitrary discrete memoryless channelsIEEE Transactions on Information Theory, 1972
- A Mathematical Theory of CommunicationBell System Technical Journal, 1948