A fast nearest-neighbor search algorithm
作者： M.T. Orchard
DOI: 10.1109/ICASSP.1991.150755
关键词: Pattern recognition 、 Vector quantization 、 Algorithm design 、 Nearest neighbor search 、 Codebook 、 Linde–Buzo–Gray algorithm 、 Mathematics 、 Algorithm 、 Encoding (memory) 、 Computation 、 Search algorithm 、 Artificial intelligence
摘要: … Letting j ( z ) denote the index of the nearest neighbor codevector to 2, we define the total … of the LBG algorithm because it requires a nearest neighbor search to be per- formed for each …
computer.org
sci-hub.se 参考文章(6)
M. Soleymani, S. Morgera, An Efficient Nearest Neighbor Search Method IEEE Transactions on Communications. ,vol. 35, pp. 677- 679 ,(1987) , 10.1109/TCOM.1987.1096830
Chang-Da Bei, R. Gray, An Improvement of the Minimum Distortion Encoding Algorithm for Vector Quantization IEEE Transactions on Communications. ,vol. 33, pp. 1132- 1133 ,(1985) , 10.1109/TCOM.1985.1096214
Y. Linde, A. Buzo, R. Gray, An Algorithm for Vector Quantizer Design IEEE Transactions on Communications. ,vol. 28, pp. 84- 95 ,(1980) , 10.1109/TCOM.1980.1094577
A. Madisetti, R. Subramonian, V.R. Algazi, A radius-bucketing approach to fast vector quantization encoding international conference on acoustics, speech, and signal processing. pp. 1767- 1770 ,(1989) , 10.1109/ICASSP.1989.266792
M.T. Orchard, C.A. Bouman, Color quantization of images IEEE Transactions on Signal Processing. ,vol. 39, pp. 2677- 2690 ,(1991) , 10.1109/78.107417
R. Gray, Vector quantization IEEE Assp Magazine. pp. 75- 100 ,(1984)