FAST ALGORITHM FOR VQ CODEBOOK DESIGN
暂无分享,去创建一个
[1] Behrooz Kamgar-Parsi,et al. An improved branch and bound algorithm for computing k-nearest neighbors , 1985, Pattern Recognit. Lett..
[2] Enrique Vidal-Ruiz,et al. An algorithm for finding nearest neighbours in (approximately) constant average time , 1986, Pattern Recognit. Lett..
[3] Laveen N. Kanal,et al. Analysis of k-nearest neighbor branch and bound rules , 1986, Pattern Recognit. Lett..
[4] Allen Gersho,et al. Fast search algorithms for vector quantization and pattern matching , 1984, ICASSP.
[5] E. Ruiz. An algorithm for finding nearest neighbours in (approximately) constant average time , 1986 .
[6] Keinosuke Fukunaga,et al. A Branch and Bound Algorithm for Computing k-Nearest Neighbors , 1975, IEEE Transactions on Computers.
[7] Heinrich Niemann,et al. An efficient branch-and-bound nearest neighbour classifier , 1988, Pattern Recognition Letters.
[8] Robert M. Gray,et al. An Algorithm for Vector Quantizer Design , 1980, IEEE Trans. Commun..
[9] Allen Gersho,et al. A fast codebook search algorithm for nearest-neighbor pattern matching , 1986, ICASSP '86. IEEE International Conference on Acoustics, Speech, and Signal Processing.
[10] Robert M. Gray,et al. An Improvement of the Minimum Distortion Encoding Algorithm for Vector Quantization , 1985, IEEE Trans. Commun..
[11] Salvatore D. Morgera,et al. A high-speed search algorithm for vector quantization , 1987, ICASSP '87. IEEE International Conference on Acoustics, Speech, and Signal Processing.
[12] Sin-Horng Chen,et al. Fast search algorithm for vq-based recognition of isolated word , 1989, INFOCOM 1989.