A better tree-structured vector quantizer

9 December 2002

conference paper
Published by Institute of Electrical and Electronics Engineers (IEEE)

p. 392-401
https://doi.org/10.1109/dcc.1991.213341

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.<>

Keywords

This publication has 10 references indexed in Scilit:

Binary search trees for vector quantisation
Published by Institute of Electrical and Electronics Engineers (IEEE) ,2005
A tree-structured locally optimal vector quantizer
Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
Optimal quantization by matrix searching
Journal of Algorithms, 1991
A new vector quantization clustering algorithm
IEEE Transactions on Acoustics, Speech, and Signal Processing, 1989
Using simulated annealing to design good codes
IEEE Transactions on Information Theory, 1987
Vector quantization
IEEE ASSP Magazine, 1984
Speech coding based upon vector quantization
IEEE Transactions on Acoustics, Speech, and Signal Processing, 1980
An Algorithm for Vector Quantizer Design
IEEE Transactions on Communications, 1980
Design of absolutely optimal quantizers for a wide class of distortion measures
IEEE Transactions on Information Theory, 1978
An Algorithm for Finding Best Matches in Logarithmic Expected Time
ACM Transactions on Mathematical Software, 1977