Abstract
Diagonal principal component analysis (DiaPCA) is an important method for dimensionality reduction and feature extraction. It usually makes use of the ℓ2-norm criterion for optimization, and is thus sensitive to outliers. In this paper, we present a DiaPCA with non-greedy ℓ1-norm maximization (DiaPCA-L1 non-greedy), which is more robust to outliers. Experimental results on two benchmark datasets show the effectiveness and advantages of our proposed method.
| Original language | English |
|---|---|
| Pages (from-to) | 57-62 |
| Number of pages | 6 |
| Journal | Neurocomputing |
| Volume | 171 |
| DOIs | |
| State | Published - 1 Jan 2016 |
| Externally published | Yes |
Keywords
- Diagonal PCA
- Face recognition
- Non-greedy strategy
- Principal component analysis (PCA)
- ℓ-norm
Fingerprint
Dive into the research topics of 'Diagonal principal component analysis with non-greedy ℓ1-norm maximization for face recognition'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver