A fast vector quantization encoding algorithm using multiple projection axes

Computation of nearest neighbor generally requires a large number of expensive distance calculations. In this paper, we present an algorithm which uses multiple projection axes to accelerate the encoding process of VQ by eliminating the necessity of calculating many distances. Since the proposed algorithm rejects those codewords that are impossible to be the nearest codeword, it produces the same output as a conventional full search algorithm. The simulation results confirm the effectiveness of the proposed algorithm.

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

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

[3]  K. Sung,et al.  A fast encoding algorithm for vector quantization , 1997, IEEE Signal Process. Lett..

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

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

[6]  R. Gray,et al.  Vector quantization , 1984, IEEE ASSP Magazine.

[7]  G. S. Stiles,et al.  Fast full search equivalent encoding algorithms for image compression using vector quantization , 1992, IEEE Trans. Image Process..