2016
DOI: 10.1016/j.neucom.2015.07.146
|View full text |Cite
|
Sign up to set email alerts
|

Improved sparse representation with low-rank representation for robust face recognition

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
8
0

Year Published

2017
2017
2021
2021

Publication Types

Select...
10

Relationship

0
10

Authors

Journals

citations
Cited by 25 publications
(8 citation statements)
references
References 25 publications
0
8
0
Order By: Relevance
“…Dehghan et al (2015) used a portion of the training data for data modeling and used a knowledge score to define the result, which are features of confidence representation [17]. Zheng et al (2016) developing a comprehensive divided representation dictionary for facial recognition that can effectively overcome occlusion issues [18]. Gao et al (2017) offered a new strategy by generating a low range of the data representation and each fault image generated by the occlusion in real-time [19].…”
Section: Literature Reviewmentioning
confidence: 99%
“…Dehghan et al (2015) used a portion of the training data for data modeling and used a knowledge score to define the result, which are features of confidence representation [17]. Zheng et al (2016) developing a comprehensive divided representation dictionary for facial recognition that can effectively overcome occlusion issues [18]. Gao et al (2017) offered a new strategy by generating a low range of the data representation and each fault image generated by the occlusion in real-time [19].…”
Section: Literature Reviewmentioning
confidence: 99%
“…Consider the multi-view dimensionality reduction problem proposed in Section I. Previous studies have shown that LRR mentioned in Section II can spontaneously learn the low-rank representation coefficient matrix [38], [39]. And based on the coefficient matrix, the cross-view similarity matrix of sample points can be constructed, which does not need to select the global parameters as K-nearest neighbor algorithm [40] does, but can automatically obtain the adaptive neighborhood of sample points.…”
Section: A Lrmcca Modelmentioning
confidence: 99%
“…Unlike these sparse representation methods which use the 1-D pixel-based error model to address the face classification problem, the works [29,37,40,46,47,19] introduced the local consistency concept (nearby data points share the same properties) by imposing that the error images have low-rank or approximately low-rank structure. As a convex relaxation of the rank-function, in [40] the authors proposed the minimization of the nuclear norm of the error matrix.…”
Section: Related Workmentioning
confidence: 99%