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

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.