Abstract
Feature extraction by Maximum Margin Criterion (MMC) can more efficiently calculate the discriminant vectors than LDA, by avoiding calculation of the inverse within-class scatter matrix. But MMC ignores the local structures of samples. In this paper, we develop a novel criterion to address this issue, namely Laplacian Maximum Margin Criterion (Laplacian MMC). We define the total Laplacian matrix, within-class Laplacian matrix and between-class Laplacian matrix by using the similar weight of samples to capture the scatter information. Laplacian MMC based feature extraction gets the discriminant vectors by maximizing the difference between between-class laplacian matrix and within-class laplacian matrix. Experiments on FERET and AR face databases show that Laplacian MMC works well.
| Original language | English |
|---|---|
| Pages (from-to) | 99-110 |
| Number of pages | 12 |
| Journal | Neural Processing Letters |
| Volume | 33 |
| Issue number | 1 |
| DOIs | |
| State | Published - Feb 2011 |
| Externally published | Yes |
Keywords
- Face recognition
- Feature extraction
- Laplacian
- Linear discriminant analysis
- Maximum Margin Criterion