By Topic

Vector quantization based on dynamic adjustment of Mahalanobis distance

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)
Younis, K.S. ; US Air Force Inst. of Technol., Wright-Patterson AFB, OH, USA ; Rogers, S.K. ; DeSimio, M.P.

Vector quantization (VQ) is widely used in many applications, ranging from image and speech coding to pattern recognition. The authorse propose a method for using the covariance matrix of the individual clusters as the basis for grouping. In this algorithm, the Mahalanobis distance is used as a measure of similarity in each cluster. Properties of the new clustering method are presented by examining the clustering quality for codebooks designed with the proposed method and two competing methods on a variety of data sets. The competing methods are the Linde-Buzo-Gray (LBG) algorithm and the fuzzy c-means (FCM) algorithm using Euclidean distance. The new method provides better results than the competing methods for several data sets. Thus, this method becomes another useful tool for use in codebook design

Published in:

Aerospace and Electronics Conference, 1996. NAECON 1996., Proceedings of the IEEE 1996 National  (Volume:2 )

Date of Conference:

20-23 May 1996