Open Access Open Access  Restricted Access Subscription or Fee Access

Centroid Based Fast Search Algorithm for Vector Quantization

H. B. Kekre, Tanuja K. Sarode


Vector Quantization(VQ) is an efficient technique for data compression and has been successfully used in various applications. In this paper we present new fast codebook search algorithm which uses sorting and centroid technique to search the closest codevector in the codebook. The proposed search algorithm is faster since it reduces number of Euclidean distance computation as compared to Exhaustive search algorithm while keep the image quality imperceptibly close to Exhaustive search algorithm. We have used the mean absolute error as the quality factor since it gives better feel of distortion. Also the proposed algorithm is compared with other codebook search algorithms given in literature and it is found that the performance parameter' average execution time and average number of Euclidean distance computation per image training vector of the proposed algorithm is considerably better compared to most of them.


Vector Quantization (VQ), Codebook, Codevector, data compression, Encoding

Full Text:



  • There are currently no refbacks.

Disclaimer/Regarding indexing issue:

We have provided the online access of all issues and papers to the indexing agencies (as given on journal web site). It’s depend on indexing agencies when, how and what manner they can index or not. Hence, we like to inform that on the basis of earlier indexing, we can’t predict the today or future indexing policy of third party (i.e. indexing agencies) as they have right to discontinue any journal at any time without prior information to the journal. So, please neither sends any question nor expects any answer from us on the behalf of third party i.e. indexing agencies.Hence, we will not issue any certificate or letter for indexing issue. Our role is just to provide the online access to them. So we do properly this and one can visit indexing agencies website to get the authentic information.