Fast K-dimensional tree algorithms for nearest neighbor search with application to vector quantization encoding
- 1 March 1992
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 40 (3) , 518-531
- https://doi.org/10.1109/78.120795
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- Fast algorithms for vector quantization picture codingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Binary search trees for vector quantisationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- A generalized optimization of the K-d tree for fast nearest-neighbour searchPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- A new vector quantization clustering algorithmIEEE Transactions on Acoustics, Speech, and Signal Processing, 1989
- Effect of ordering the codebook on the efficiency of the partial distance search algorithm for vector quantizationIEEE Transactions on Communications, 1989
- An improvement of the minimum distortion encoding algorithm for vector quantizationIEEE Transactions on Communications, 1985
- Vector quantization in speech codingProceedings of the IEEE, 1985
- An Algorithm for Vector Quantizer DesignIEEE Transactions on Communications, 1980
- An Algorithm for Finding Best Matches in Logarithmic Expected TimeACM Transactions on Mathematical Software, 1977
- Multidimensional binary search trees used for associative searchingCommunications of the ACM, 1975