z-logo
open-access-imgOpen Access
Convergence Analysis of Codebook Generation Techniques for Vector Quantization using KMeans Clustering Technique
Author(s) -
S. Vimala
Publication year - 2011
Publication title -
international journal of computer applications
Language(s) - English
Resource type - Journals
ISSN - 0975-8887
DOI - 10.5120/2533-3457
Subject(s) - codebook , k means clustering , linde–buzo–gray algorithm , computer science , vector quantization , cluster analysis , learning vector quantization , convergence (economics) , pattern recognition (psychology) , data mining , artificial intelligence , economics , economic growth
Quantization (VQ) is one of the lossy image compression techniques. VQ comprises of three different phases: Codebook Generation, Image Encoding and Image Decoding. The performance of VQ is mainly based on the codebook generation phase. In this paper, five different codebook generation techniques namely the Simple Codebook Generation (SCG), Ordered Codebook Generation (OCG), Codebook Generation by Sorting the Sum of Sib Vectors (CBSSSV), Codebook Generation with Edge Features (CBEF) and Codebook Generation with Cluster Density (CBCD) for Vector Quantization have been discussed and their performance in terms of number of iterations required to converge with respect to Peak Signal to Noise Ratio (PSNR) is compared when k0 Means Clustering technique is used to optimize the initial codebook that is created by any of the above techniques. Of these discussed techniques, the CBEF technique performs better.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom