We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

Two-stage computational cost reduction algorithm based on Mahalanobis distance approximations

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

6 Author(s)
Sun, F. ; Fac. of Sci. & Technol., Tohoku Bunka Gakuen Univ., Sendai, Japan ; Omachi, S. ; Kato, N. ; Aso, H.
more authors

For many pattern recognition methods, high recognition accuracy is obtained at very high expense of computational cost. In this paper, a new algorithm that reduces the computational cost for calculating discriminant function is proposed. This algorithm consists of two stages which are feature vector. Division and dimensional reduction. The processing of feature division is based on characteristic of covariance matrix. The dimensional reduction in the second stage is done by an approximation of the Mahalanobis distance. Compared with the well-known dimensional reduction method of K-L expansion, experimental results show the proposed algorithm not only reduces the computational cost but also improves the recognition accuracy

Published in:

Pattern Recognition, 2000. Proceedings. 15th International Conference on  (Volume:2 )

Date of Conference: