Abstract
2-D principal component analysis based on ℓ1-norm (2DPCA-L1) is a recently developed approach for robust dimensionality reduction and feature extraction in image domain. Normally, a greedy strategy is applied due to the difficulty of directly solving the ℓ1-norm maximization problem, which is, however, easy to get stuck in local solution. In this paper, we propose a robust 2DPCA with non-greedy ℓ1-norm maximization in which all projection directions are optimized simultaneously. Experimental results on face and other datasets confirm the effectiveness of the proposed approach.
| Original language | English |
|---|---|
| Article number | 6884824 |
| Pages (from-to) | 1108-1112 |
| Number of pages | 5 |
| Journal | IEEE Transactions on Cybernetics |
| Volume | 45 |
| Issue number | 5 |
| DOIs | |
| State | Published - 1 May 2015 |
| Externally published | Yes |
Keywords
- 2-D principal component analysis (2DPCA)
- non-greedy strategy
- outliers
- principal component analysis (PCA)
- ℓ-norm
Fingerprint
Dive into the research topics of 'Robust 2DPCA with non-greedy ℓ1-norm maximization for image analysis'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver