Share Email Print

Proceedings Paper

A fast encoding algorithm for vector quantization using dynamic subvector technique
Author(s): Chou-Chen Wang; Chi-Wei Tung; Jung-Yang Kao
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

The encoding of vector quantization (VQ) needs expensive computation for searching the closet codeword to the input vectors. In order to reduce computation burden, Pan et al. have developed an efficient full-search-equivalent algorithm by using the characteristics of the sums and variances of a vector and its two fixed subvectors recently. However, some computational redundancies still exist in it. In this paper, we introduce a technique to efficiently partition a vector into two dynamic subvectors according to the patterns inside the block (or vector) and then further improve the computation load given by Pan's method. Experimental results show that the proposed method is superior to other algorithms in terms of processing time and the number of distortion calculations. Compared to Pan's algorithm, our algorithm can further reduce the processing time and the number of distortion calculations for various codebook sizes by 14.7% to 41.3% and 14.9% to 44.6%, respectively.

Paper Details

Date Published: 24 June 2005
PDF: 11 pages
Proc. SPIE 5960, Visual Communications and Image Processing 2005, 596001 (24 June 2005); doi: 10.1117/12.631381
Show Author Affiliations
Chou-Chen Wang, I-Shou Univ. (Taiwan)
Chi-Wei Tung, I-Shou Univ. (Taiwan)
Jung-Yang Kao, Industrial Technology Research Institute (Taiwan)

Published in SPIE Proceedings Vol. 5960:
Visual Communications and Image Processing 2005
Shipeng Li; Fernando Pereira; Heung-Yeung Shum; Andrew G. Tescher, Editor(s)

© SPIE. Terms of Use
Back to Top