Efficient and robust feature extraction by maximum margin criterion.
In pattern recognition, feature extraction techniques are widely employed to reduce the dimensionality of data and to enhance the discriminatory information. Principal component analysis (PCA) and linear discriminant analysis (LDA) are the two most popular linear dimensionality reduction methods. However, PCA is not very effective for the extraction of the most discriminant features, and LDA is not stable due to the small sample size problem. In this paper, we propose some new (linear and nonlinear) feature extractors based on maximum margin criterion (MMC). Geometrically, feature extractors based on MMC maximize the (average) margin between classes after dimensionality reduction. It is shown that MMC can represent class separability better than PCA. As a connection to LDA, we may also derive LDA from MMC by incorporating some constraints. By using some other constraints, we establish a new linear feature extractor that does not suffer from the small sample size problem, which is known to cause serious stability problems for LDA. The kernelized (nonlinear) counterpart of this linear feature extractor is also established in the paper. Our extensive experiments demonstrate that the new feature extractors are effective, stable, and efficient.
Li
Haifeng
H
Department of Computer Science and Engineering, University of California, Riverside, CA 92521, USA. hli@cs.ucr.edu
Jiang
Tao
T
Zhang
Keshu
K
D000465:Algorithms; D005145:Face; D006801:Humans; D016014:Linear Models; D016571:Neural Networks, Computer; D017711:Nonlinear Dynamics; D010363:Pattern Recognition, Automated