Uniform distributions on curves and quantization
0
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
The basic goal of quantization for probability distribution is to reduce the number of values, which is typically uncountable, describing a probability distribution to some finite set and thus to make an approximation of a continuous probability distribution by a discrete distribution. It has broad application in signal processing and data compression. In this paper, first we define the uniform distributions on different curves such as a line segment, a circle, and the boundary of an equilateral triangle. Then, we give the exact formulas to determine the optimal sets of $n$-means and the $n$th quantization errors for different values of $n$ with respect to the uniform distributions defined on the curves. In each case, we further calculate the quantization dimension and show that it is equal to the dimension of the object; and the quantization coefficient exists as a finite positive number. This supports the well-known result of Bucklew and Wise \cite{BW}, which says that for a Borel probability measure $P$ with non-vanishing absolutely continuous part the quantization coefficient exists as a finite positive number.
Abstract
The basic goal of quantization for probability distribution is to reduce the number of values, which is typically uncountable, describing a probability distribution to some finite set and thus to make an approximation of a continuous probability distribution by a discrete distribution. It has broad application in signal processing and data compression. In this paper, first we define the uniform distributions on different curves such as a line segment, a circle, and the boundary of an equilateral triangle. Then, we give the exact formulas to determine the optimal sets of $n$-means and the $n$th quantization errors for different values of $n$ with respect to the uniform distributions defined on the curves. In each case, we further calculate the quantization dimension and show that it is equal to the dimension of the object; and the quantization coefficient exists as a finite positive number. This supports the well-known result of Bucklew and Wise \cite{BW}, which says that for a Borel probability measure $P$ with non-vanishing absolutely continuous part the quantization coefficient exists as a finite positive number.
참고문헌 (12)
- E. F. Abaya, "Some remarks on the existence of optimal quantizers", Statist. Probab. Lett, 2(6), pp.349~351 (1984)[DOI]
- J. A. Bucklew, "Multidimensional asymptotic quantization theory with rth power distortion measures", IEEE Trans. Inform. Theory, 28(2), pp.239~247 (1982)[DOI]
- C. P. Dettmann, "Quantization for uniform distributions on equilateral triangles", Real Anal. Exchange, 42(1), pp.149~166 (2017)[DOI]
- A. Gersho, "Vector Quantization and Signal Compression" (1992), Kluwer Academy publishers
- R. M. Gray, "Locally optimal block quantizer design", Inform. and Control, 45(2), pp.178~198 (1980)[DOI]
- S. Graf, "Foundations of quantization for probability distributions", Lecture Notes in Mathematics, 1730 (2000), Springer-Verlag[DOI]
- R. M. Gray, "Quantization", IEEE Trans. Inform. Theory, 44(6), pp.2325~2383 (1998)[DOI]
- A. Gy¨orgy, "On the structure of optimal entropy-constrained scalar quantizers", IEEE Trans. Inform. Theory, 48(2), pp.416~427 (2002)[DOI]
- S. Matsuura, "Optimal estimators of principal points for minimizing expected mean squared distance", J. Statist. Plann. Inference, 167, pp.102~122 (2015)[DOI]
- J. Rosenblatt, "Optimal quantization for piecewise uniform distributions", Unif. Distrib. Theory, 13(2), pp.23~55 (2018)
- M. K. Roychowdhury, "Optimal quantizers for some absolutely continuous probability measures", Real Anal. Exchange, 43(1), pp.105~136 (2018)[DOI]
- R. Zam, "Lattice Coding for Signals and Networks: A Structured Coding Approach to Quantization, Modulation, and Multiuser Information Theory" (2014), Cambridge University Press