We found a match
Your institution may have rights to this item. Sign in to continue.
- Title
Discriminative Low-Rank Subspace Learning with Nonconvex Penalty.
- Authors
Xie, Kan; Liu, Wei; Lai, Yue; Li, Weijun
- Abstract
Subspace learning has been widely utilized to extract discriminative features for classification task, such as face recognition, even when facial images are occluded or corrupted. However, the performance of most existing methods would be degraded significantly in the scenario of that data being contaminated with severe noise, especially when the magnitude of the gross corruption can be arbitrarily large. To this end, in this paper, a novel discriminative subspace learning method is proposed based on the well-known low-rank representation (LRR). Specifically, a discriminant low-rank representation and the projecting subspace are learned simultaneously, in a supervised way. To avoid the deviation from the original solution by using some relaxation, we adopt the Schatten p -norm and ℓ p -norm, instead of the nuclear norm and ℓ 1 -norm, respectively. Experimental results on two famous databases, i.e. PIE and ORL, demonstrate that the proposed method achieves better classification scores than the state-of-the-art approaches.
- Subjects
HUMAN facial recognition software; NONCONVEX programming
- Publication
International Journal of Pattern Recognition & Artificial Intelligence, 2019, Vol 33, Issue 10, pN.PAG
- ISSN
0218-0014
- Publication type
Article
- DOI
10.1142/S0218001419510066