Fast tree-structured nearest neighbor encoding for vector quantization

This work examines the nearest neighbor encoding problem with an unstructured codebook of arbitrary size and vector dimension. We propose a new tree-structured nearest neighbor encoding method that significantly reduces the complexity of the full-search method without any performance degradation in terms of distortion. Our method consists of efficient algorithms for constructing a binary tree for the codebook and nearest neighbor encoding by using this tree. Numerical experiments are given to demonstrate the performance of the proposed method.

[1]  S. Ra,et al.  A fast mean-distance-ordered partial codebook search algorithm for image vector quantization , 1993 .

[2]  M. Reza Soleymani,et al.  A fast MMSE encoding technique for vector quantization , 1989, IEEE Trans. Commun..

[3]  Jon Louis Bentley,et al.  Multidimensional binary search trees used for associative searching , 1975, CACM.

[4]  Forest Baskett,et al.  An Algorithm for Finding Nearest Neighbors , 1975, IEEE Transactions on Computers.

[5]  Allen Gersho,et al.  Vector quantization and signal compression , 1991, The Kluwer international series in engineering and computer science.

[6]  Allen Gersho,et al.  Fast search algorithms for vector quantization and pattern matching , 1984, ICASSP.

[7]  Michael T. Orchard,et al.  A fast nearest-neighbor search algorithm , 1991, [Proceedings] ICASSP 91: 1991 International Conference on Acoustics, Speech, and Signal Processing.

[8]  W. Millar,et al.  Binary search trees for vector quantisation , 1987, ICASSP '87. IEEE International Conference on Acoustics, Speech, and Signal Processing.

[9]  Wayne E. Stark,et al.  Fine-coarse vector quantization , 1991, IEEE Trans. Signal Process..

[10]  G. Clifford Carter,et al.  On using backpropagation neural networks to separate single echoes from multiple echoes , 1993, 1993 IEEE International Conference on Acoustics, Speech, and Signal Processing.

[11]  Robert M. Gray,et al.  An Improvement of the Minimum Distortion Encoding Algorithm for Vector Quantization , 1985, IEEE Trans. Commun..

[12]  Kuldip K. Paliwal,et al.  Fast K-dimensional tree algorithms for nearest neighbor search with application to vector quantization encoding , 1992, IEEE Trans. Signal Process..

[13]  J. Makhoul,et al.  Vector quantization in speech coding , 1985, Proceedings of the IEEE.

[14]  L. Torres,et al.  An improvement on codebook search for vector quantization , 1994, IEEE Trans. Commun..

[15]  Robert M. Gray,et al.  An Algorithm for Vector Quantizer Design , 1980, IEEE Trans. Commun..

[16]  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.

[17]  Zhen Zhang,et al.  Fast generalized Lloyd iteration for vector quantizers (VQ) codebook design , 1995, Electronic Imaging.

[18]  C.-C. Jay Kuo,et al.  A new initialization technique for generalized Lloyd iteration , 1994, IEEE Signal Processing Letters.