An improved codeword searching algorithm for vector quantization

Xu Runsheng; Zhang Weidong; Xu Xiaoming; Lu Zheming

Volume 24 Issue 5

May 2002

Turn off MathJax

Article Contents

Article Navigation > Journal of Electronics & Information Technology > 2002 > 24(5): 604-609

Xu Runsheng, Zhang Weidong, Xu Xiaoming, Lu Zheming. An improved codeword searching algorithm for vector quantization[J]. Journal of Electronics & Information Technology, 2002, 24(5): 604-609.

Citation:

Xu Runsheng, Zhang Weidong, Xu Xiaoming, Lu Zheming. An improved codeword searching algorithm for vector quantization[J]. Journal of Electronics & Information Technology, 2002, 24(5): 604-609.

Xu Runsheng, Zhang Weidong, Xu Xiaoming, Lu Zheming. An improved codeword searching algorithm for vector quantization[J]. Journal of Electronics & Information Technology, 2002, 24(5): 604-609.

Citation:

Xu Runsheng, Zhang Weidong, Xu Xiaoming, Lu Zheming. An improved codeword searching algorithm for vector quantization[J]. Journal of Electronics & Information Technology, 2002, 24(5): 604-609.

PDF( 1012 KB)

An improved codeword searching algorithm for vector quantization

Received Date: 2000-10-08
Rev Recd Date: 2001-05-09
Publish Date: 2002-05-19

Abstract

Abstract

In this paper, an improved codeword searching algorithm is proposed on the basis of nearest-neighbor search algorithm. The new algorithm considers the sums and variances of image vectors. A vector is separated into two subvectors: the first half of the coordinates and the second half of the coordinates. Calculate the sums and variances of the vector and its two subvectors. Apply the result to a set of inequalities to eliminate the impossible codeword candidates. The simulation results show that the proposed algorithm is faster than the improved EENNS algorithm, and it also has the advantage in decreasing the computing complexity.

FullText(HTML)

References(1)

References

R.M. Gray, Vector quantization, IEEE ASSP Magazine, 1984, 1(1), 4-29.[2]Y. Linde, A. Buzo, R. M. Gray, An algorithm for vector quantizer design, IEEE Trans. on Commun, 1980, COM-28(1), 84 95.[3]C.D. Bei. R. M. Gray, An improvement of the minimum distortion encoding algorithm for vector quantization, IEEE Trans. on Commun, 1985, COM-33(10), 1132-1133.[4]C.M. Huang, Q. Bi, G. S. Stiles, R. W. Harris, Fast full search equivalent encoding algorithms for image compression using vector quantization, IEEE Trans. on Image Processing, 1992, 1(3),413-416.[5]L. Guan, M. Kamel, Equal-average hyperplane partitioning method for vector quantization of image data, Pattern Recognition letter, 1992, 13(10), 693-699.[6]S.W. Ra, J. K. Kim, Fast mean-distance-ordered partial codebook search algorithm for image vector quantization, IEEE Trans. on CAS II, 1993, 40(9), 576-579.[7]J.S. Pan, K. C. Huang, A new vector quantization image coding algorithm based on the extension of the bound for Minkowski metric, Pattern Recognition, 1998, 31(11), 1757-1760.

Relative Articles

Supplements(0)

Cited By

Proportional views