2015
DOI: 10.1007/s11633-015-0901-2
|View full text |Cite
|
Sign up to set email alerts
|

Robust face recognition via low-rank sparse representation-based classification

Abstract: Face recognition has attracted great interest due to its importance in many real-world applications. In this paper, we present a novel low-rank sparse representation-based classification (LRSRC) method for robust face recognition. Given a set of test samples, LRSRC seeks the lowest-rank and sparsest representation matrix over all training samples. Since low-rank model can reveal the subspace structures of data while sparsity helps to recognize the data class, the obtained test sample representations are both r… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2017
2017
2022
2022

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 21 publications
(3 citation statements)
references
References 24 publications
0
3
0
Order By: Relevance
“…This section mainly verifies the convergence, role of unlabeled data, sparsity, effectiveness for class imbalance problem as well as comparison with the latest published results and some deep-learning algorithms. Since the inverse projection sparse representation-based classification methods [21][22][23][24] have been proven to be superior to some classic classifiers, here S 1/2 -L 1/2 -PFSRC-CS is only compared with S 1/2 -L 1/2 -PFSRC, LR-S-PFSRC [24], PFSRC [23], and LRSRC [18]. And L 1/2 -ISRC-CS is only compared with L 1/2 -ISRC, ISSRC [22], IPRC [21], and SRC [16].…”
Section: Experiments and Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…This section mainly verifies the convergence, role of unlabeled data, sparsity, effectiveness for class imbalance problem as well as comparison with the latest published results and some deep-learning algorithms. Since the inverse projection sparse representation-based classification methods [21][22][23][24] have been proven to be superior to some classic classifiers, here S 1/2 -L 1/2 -PFSRC-CS is only compared with S 1/2 -L 1/2 -PFSRC, LR-S-PFSRC [24], PFSRC [23], and LRSRC [18]. And L 1/2 -ISRC-CS is only compared with L 1/2 -ISRC, ISSRC [22], IPRC [21], and SRC [16].…”
Section: Experiments and Discussionmentioning
confidence: 99%
“…Wright et al [16] proposed sparse representation-based classification (SRC), which was a sparse coding technique based on sufficient labeled samples per class without learning. SRC has made remarkable success in pattern recognition fields, such as face recognition [17,18] and tumor recognition [19,20]. However, 2 Construction of S 1/2 -L 1/2 -PFSR model…”
Section: Introductionmentioning
confidence: 99%
“…Currently, and in the past few years, representation-based classification method (RBCM), 1,2 which can be applied in a wide variety of fields – e.g. face recognition 36 and hyperspectral imagery classification – has received more attention. 7 – 9 RBCM represents a test sample as a linear combination of training samples and then employs the representation results to classify the test sample.…”
Section: Introductionmentioning
confidence: 99%