DocumentCode
2945158
Title
An Algorithm for Quantization of Discrete Probability Distributions
Author
Reznik, Yuriy A.
Author_Institution
Qualcomm Inc., San Diego, CA, USA
fYear
2011
fDate
29-31 March 2011
Firstpage
333
Lastpage
342
Abstract
We study the problem of quantization of discrete probability distributions, arising in universal coding, as well as other applications. We show, that in many situations this problem can be reduced to the covering problem for the unit simplex, yielding precise characterization in the high-rate regime. Our main contribution is a simple and asymptotically optimal algorithm for solving this problem. Performance of this algorithm is studied and compared with several known solutions.
Keywords
encoding; probability; quantisation (signal); asymptotically optimal algorithm; discrete probability distributions; quantization; universal coding; Encoding; Histograms; Image coding; Image reconstruction; Lattices; Probability distribution; Quantization; covering radius; enumeration of types; lattice; quantization; source coding; two-step codes; types; unversal coding;
fLanguage
English
Publisher
ieee
Conference_Titel
Data Compression Conference (DCC), 2011
Conference_Location
Snowbird, UT
ISSN
1068-0314
Print_ISBN
978-1-61284-279-0
Type
conf
DOI
10.1109/DCC.2011.40
Filename
5749491
Link To Document