Proceedings Article10.1109/DCC.1991.213341
A better tree-structured vector quantizer
Xiaolin Wu,K. Zhang +1 more
- 08 Apr 1991
- pp 392-401
74
TL;DR: A new vector quantizer permits logarithmic-time encoding and yet performs better than the locally optimal quantizers generated by the LBG algorithm.
read more
Abstract: A new vector quantizer permits logarithmic-time encoding and yet performs better than the locally optimal quantizers generated by the LBG algorithm. The success is credited to an elaborated tree-structured optimization process in the codebook design. >
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
How much can k-means be improved by using better initialization and repeats?
Pasi Fränti,Sami Sieranoja +1 more
TL;DR: The main finding is that when the clusters overlap, k-means can be significantly improved using these two tricks, and if high clustering accuracy is needed, a better algorithm should be used instead.
414
Statistical Pattern Recognition: Webb/Statistical Pattern Recognition
Andrew R. Webb,Keith D. Copsey +1 more
- 07 Oct 2011
TL;DR: Applications such as data mining, web searching, multimedia data retrieval, face recognition, and cursive handwriting recognition, all require robust and efficient pattern recognition techniques.
338
Color quantization by dynamic programming and principal analysis
TL;DR: This paper shows that by ordering the N colors along their principal axis and partitioning the color space with respect to this ordering, the resulting constrained optimization problem can be solved in O(N) time by dynamic programming.
171
Randomised Local Search Algorithm for the Clustering Problem
Pasi Fränti,Juha Kivijärvi +1 more
TL;DR: This work introduces a new randomised local search algorithm for the clustering problem that is easy to implement, sufficiently fast, and competitive with the best clustering methods.
122
A comparison of several vector quantization codebook generation approaches
C.-M. Huang,R.W. Harris +1 more
TL;DR: A new directed-search binary-splitting method which reduces the complexity of the LBG algorithm, and a new initial codebooks selection method which can obtain a good initial codebook is presented.
89
References
Numerical recipes in C
William H. Press,Saul A. Teukolsky,William T. Vetterling,Brian P. Flannery +3 more
- 01 Jan 1994
TL;DR: The Diskette v 2.06, 3.5''[1.44M] for IBM PC, PS/2 and compatibles [DOS] Reference Record created on 2004-09-07, modified on 2016-08-08.
Least squares quantization in PCM
TL;DR: In this article, the authors derived necessary conditions for any finite number of quanta and associated quantization intervals of an optimum finite quantization scheme to achieve minimum average quantization noise power.
Least Squares Quantization in PCM
S. P. Lloyd
- 01 Jan 1982
TL;DR: The corresponding result for any finite number of quanta is derived; that is, necessary conditions are found that the quanta and associated quantization intervals of an optimum finite quantization scheme must satisfy.
9.6K
An Algorithm for Vector Quantizer Design
Y. Linde,A. Buzo,Robert M. Gray +2 more
TL;DR: An efficient and intuitive algorithm is presented for the design of vector quantizers based either on a known probabilistic model or on a long training sequence of data.