Various approaches to speed up Mahalanobis distance classifier |
| |
Authors: | N. B. VENKATESWARLU R.P. SINGH |
| |
Affiliation: | School of Computer Studies, University of Leeds , Leeds LS2 9JT, England, U.K. |
| |
Abstract: | In this paper, we propose various approaches to reduce the CPU time requirement of Mahalanobis distance classifier (MDC). Based on the results discussed in this paper, we have found that the Ensemble average approach and Quadratic form range theorem are superior to other algorithms. The algorithms based on these two approaches are found to give a maximum speed of 7 and 9 with MSS and TM data, respectively. |
| |
Keywords: | |
|
|