Fast Clustering Algorithms for Vector Quantization (original) (raw)

Pattern Recognition, 1996

Abstract

Some fast clustering algorithms for vector quantization (VQ) based on the LBG recursive algorithm are presented and compared. Experimental results in comparison to the conventional vector-quantization (VQ) clustering algorithm with speech data demonstrate that the best approach will save more than 99% in the number of multiplications, as well as considerable saving in the number of additions. The increase in the number of comparisons is moderate. An improve absolute error inequality (AEI) criterion for Euclidean distortion measure is also proposed and utilized in the VQ clustering algorithm.

Fergus McInnes hasn't uploaded this paper.

Let Fergus know you want this paper to be uploaded.

Ask for this paper to be uploaded.