A fast search algorithm for vector quantization using mean pyramids of codewords
- 1 February 1995
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 43 (2/3/4) , 1697-1702
- https://doi.org/10.1109/26.380218
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- A high-speed search algorithm for vector quantizationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Binary search trees for vector quantisationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- An efficient approximation-elimination algorithm for fast nearest-neighbour search based on a spherical distance coordinate formulationPattern Recognition Letters, 1992
- Fast K-dimensional tree algorithms for nearest neighbor search with application to vector quantization encodingIEEE Transactions on Signal Processing, 1992
- Globally optimal vector quantizer design by stochastic relaxationIEEE Transactions on Signal Processing, 1992
- Fast codebook generation algorithm for vector quantization of imagesPattern Recognition Letters, 1991
- A fast nearest-neighbor search algorithmPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1991
- A new vector quantization clustering algorithmIEEE Transactions on Acoustics, Speech, and Signal Processing, 1989
- An algorithm for finding nearest neighbours in (approximately) constant average timePattern Recognition Letters, 1986
- An Algorithm for Vector Quantizer DesignIEEE Transactions on Communications, 1980