By Topic

Modified K-means algorithm for vector quantizer design

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Daeryong Lee ; Dept. of Electron. Eng., Seoul Nat. Univ., South Korea ; Seongjoon Baek ; Koengmo Sung

The K-means algorithm is widely used in vector quantizer (VQ) design and clustering analysis. In VQ context, this algorithm iteratively updates an initial codebook and converges to a locally optimal codebook in certain conditions. It iteratively satisfies each of the two necessary conditions for an optimal quantizer; the nearest neighbor condition for the partition and centroid condition for the codevectors. In this letter, we propose a new algorithm for both vector quantizer design and clustering analysis as an alternative to the conventional K-means algorithm. The algorithm is almost the same as the K-means algorithm except for a modification at codebook updating step. It does not satisfy the centroid condition iteratively, but asymptotically satisfies it as the number of iterations increases. Experimental results show that the algorithm converges to a better locally optimal codebook with an accelerated convergence speed.

Published in:

Signal Processing Letters, IEEE  (Volume:4 ,  Issue: 1 )