Feature Extraction Based on Maximum Nearest Subspace Margin Criterion |
| |
Authors: | Yi Chen Zhenzhen Li Zhong Jin |
| |
Affiliation: | 1. School of Computer Science and Technology, Nanjing University of Science and Technology, Nanjing, 210094, People’s Republic of China 2. School of Information Engineering, Jiangxi Manufacturing Technology College, Nanchang, 330095, China
|
| |
Abstract: | Based on the classification rule of sparse representation-based classification (SRC) and linear regression classification (LRC), we propose the maximum nearest subspace margin criterion for feature extraction. The proposed method can be seen as a preprocessing step of SRC and LRC. By maximizing the inter-class reconstruction error and minimizing the intra-class reconstruction error simultaneously, the proposed method significantly improves the performances of SRC and LRC. Compared with linear discriminant analysis, the proposed method avoids the small sample size problem and can extract more features. Moreover, we extend LRC to overcome the potential singular problem. The experimental results on the extended Yale B (YALE-B), AR, PolyU finger knuckle print and the CENPARMI handwritten numeral databases demonstrate the effectiveness of the proposed method. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|