A fast search algorithm for vector quantization using L2-norm pyramid of codewords

Vector quantization for image compression requires expensive encoding time to find the closest codeword to the input vector. This paper presents a fast algorithm to speed up the closest codeword search process in vector quantization encoding. By using an appropriate topological structure of the codebook, we first derive a condition to eliminate unnecessary matching operations from the search procedure. Then, based on this elimination condition, a fast search algorithm is suggested. Simulation results show that with little preprocessing and memory cost, the proposed search algorithm significantly reduces the encoding complexity while maintaining the same encoding quality as that of the full search algorithm. It is also found that the proposed algorithm outperforms the existing search algorithms.

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

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

[3]  Chang-Hsing Lee,et al.  A fast search algorithm for vector quantization using mean pyramids of codewords , 1995, IEEE Trans. Commun..

[4]  Richard E. Ladner,et al.  Fast nearest neighbor search of entropy-constrained vector quantization , 2000, IEEE Trans. Image Process..

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

[6]  Jeng-Shyang Pan,et al.  Fast codeword search algorithm for image coding based on mean-variance pyramids of codewords , 2000 .

[7]  Weiping Li,et al.  A fast search algorithm for vector quantization using a directed graph , 2000, IEEE Trans. Circuits Syst. Video Technol..

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

[9]  Chin-Chen Chang,et al.  Diagonal axes method (DAM): a fast search algorithm for vector quantization , 1997, IEEE Trans. Circuits Syst. Video Technol..

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

[11]  William Equitz,et al.  A new vector quantization clustering algorithm , 1989, IEEE Trans. Acoust. Speech Signal Process..

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

[13]  Ezzatollah Salari,et al.  A fast vector quantization encoding method for image compression , 1995, IEEE Trans. Circuits Syst. Video Technol..

[14]  Chaur-Heh Hsieh,et al.  Fast search algorithms for vector quantization of images using multiple triangle inequalities and wavelet transform , 2000, IEEE Trans. Image Process..

[15]  Edward H. Adelson,et al.  The Laplacian Pyramid as a Compact Image Code , 1983, IEEE Trans. Commun..

[16]  Ja-Chen Lin,et al.  Fast VQ encoding by an efficient kick-out condition , 2000, IEEE Trans. Circuits Syst. Video Technol..