Share Email Print

Optical Engineering

Fast search algorithm for vector quantization using dynamic subvectors
Author(s): Chou-Chen Wang; Chi-Wei Tung
Format Member Price Non-Member Price
PDF $20.00 $25.00

Paper Abstract

The encoding of vector quantization (VQ) needs expensive computation for searching the closet codeword to the input vectors. To reduce the computational burden, many researchers have developed some efficient full-search-equivalent algorithms by using the characteristics of the mean values and variances of an input vector to reject unlikely codewords. However, some computational redundancies still exist. As far as we know, Pan's method has the best performance of rejecting unlikely codewords using both characteristics. In this work, 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 computational 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 with the best encoding 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: 1 September 2006
PDF: 10 pages
Opt. Eng. 45(9) 097004 doi: 10.1117/1.2355652
Published in: Optical Engineering Volume 45, Issue 9
Show Author Affiliations
Chou-Chen Wang, I-Shou Univ. (Taiwan)
Chi-Wei Tung, I-Shou Univ. (Taiwan)

© SPIE. Terms of Use
Back to Top