Name
Abstract | ||
|---|---|---|
The existing margin-based discriminant analysis methods such as nonparametric discriminant analysis use K-nearest neighbor (K-NN) technique to characterize the margin. The manifold learning-based methods use K-NN technique to characterize the local structure. These methods encounter a common problem, that is, the nearest neighbor parameter K should be chosen in advance. How to choose an optimal K is a theoretically difficult problem. In this paper, we present a new margin characterization method named sparse margin-based discriminant analysis (SMDA) using the sparse representation. SMDA can successfully avoid the difficulty of parameter selection. Sparse representation can be considered as a generalization of K-NN technique. For a test sample, it can adaptively select the training samples that give the most compact representation. We characterize the margin by sparse representation. The proposed method is evaluated by using AR, Extended Yale B database, and the CENPARMI handwritten numeral database. Experimental results show the effectiveness of the proposed method; its performance is better than some other state-of-the-art feature extraction methods. © 2013 Springer-Verlag London Limited. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1007/s00521-012-1124-x | Neural Computing and Applications |
Keywords | DocType | Volume |
Dimensional reduction,Feature extraction,Sparse margin | Journal | 23 |
Issue | ISSN | Citations |
6 | 1433-3058 | 3 |
PageRank | References | Authors |
0.38 | 12 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zhenghong Gu | 1 | 42 | 3.14 |
| Jian Yang | 2 | 10 | 3.53 |