Stepwise Nearest Neighbor Discriminant Analysis
نویسندگان
چکیده
Linear Discriminant Analysis (LDA) is a popular feature extraction technique in statistical pattern recognition. However, it often suffers from the small sample size problem when dealing with the high dimensional data. Moreover, while LDA is guaranteed to find the best directions when each class has a Gaussian density with a common covariance matrix, it can fail if the class densities are more general. In this paper, a new nonparametric feature extraction method, stepwise nearest neighbor discriminant analysis(SNNDA), is proposed from the point of view of the nearest neighbor classification. SNNDA finds the important discriminant directions without assuming the class densities belong to any particular parametric family. It does not depend on the nonsingularity of the within-class scatter matrix either. Our experimental results demonstrate that SNNDA outperforms the existing variant LDA methods and the other stateof-art face recognition approaches on three datasets from ATT and FERET face databases.
منابع مشابه
Two-dimensional nearest neighbor discriminant analysis
Recently, some feature extraction methods have been developed by representing images with matrix directly, however few of them are proposed to improve accuracy of classification directly. In this paper, a novel feature extraction method, twodimensional nearest neighbor discriminant analysis(2DNNDA), is proposed from the view of the nearest neighbor classification, which makes use of the matrix ...
متن کاملFrom classifiers to discriminators: A nearest neighbor rule induced discriminant analysis
The current discriminant analysis method design is generally independent of classifiers, thus the connection between discriminant analysis methods and classifiers is loose. This paper provides a way to design discriminant analysis methods that are bound with classifiers. We begin with a local mean based nearest neighbor (LM-NN) classifier and use its decision rule to supervise the design of a d...
متن کاملDiscriminant Adaptive Nearest Neighbor Classification and Regression
Robert Tibshirani Department of Statistics University of Toronto tibs@utstat .toronto.edu Nearest neighbor classification expects the class conditional probabilities to be locally constant, and suffers from bias in high dimensions We propose a locally adaptive form of nearest neighbor classification to try to finesse this curse of dimensionality. We use a local linear discriminant analysis to e...
متن کاملFeature extraction for nearest neighbor classification: Application to gender recognition
In this article, we perform an extended analysis of different face-processing techniques for gender recognition problems. Prior research works show that support vector machines (SVM) achieve the best classification results. We will show that a nearest neighbor classification approach can reach a similar performance or improve the SVM results, given an adequate selection of features of the input...
متن کاملNearest Neighbor Discriminant Analysis
Linear Discriminant Analysis (LDA) is a popular feature extraction technique in statistical pattern recognition. However, it often suffers from the small sample size problem when dealing with high dimensional data. Moreover, while LDA is guaranteed to find the best directions when each class has a Gaussian density with a common covariance matrix, it can fail if the class densities are more gene...
متن کامل