2014
DOI: 10.1016/j.patcog.2014.05.001
|View full text |Cite
|
Sign up to set email alerts
|

Fisher discrimination based low rank matrix recovery for face recognition

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
5
0

Year Published

2016
2016
2021
2021

Publication Types

Select...
7
2

Relationship

0
9

Authors

Journals

citations
Cited by 28 publications
(5 citation statements)
references
References 39 publications
0
5
0
Order By: Relevance
“…That is to say, we hope that the selected features should make the distance between the samples from the same class small and distance between the samples from different classes as large as possible. Fisher criterion has been widely used to learn discriminative subspace,, and it is usually defined as to minimize the trace ratio tr ( S W ( X ))/ tr ( S B ( X )), where tr (· ) means the trace of a matrix. Instead of minimizing the trace ratio, another commonly used variant of the Fisher criterion is to minimize the trace difference which is defined as: trueminWtr(WT(SW(X)-αSB(X))W) …”
Section: Methodsmentioning
confidence: 99%
“…That is to say, we hope that the selected features should make the distance between the samples from the same class small and distance between the samples from different classes as large as possible. Fisher criterion has been widely used to learn discriminative subspace,, and it is usually defined as to minimize the trace ratio tr ( S W ( X ))/ tr ( S B ( X )), where tr (· ) means the trace of a matrix. Instead of minimizing the trace ratio, another commonly used variant of the Fisher criterion is to minimize the trace difference which is defined as: trueminWtr(WT(SW(X)-αSB(X))W) …”
Section: Methodsmentioning
confidence: 99%
“…Their model can also recover the correct column space of data. The linear low-rank recovery has been applied to many computer vision tasks, such as face recognition [14] and image classification [15], where they perform very well. Besides, for low-rank matrix recovery, Liu et al [16] propose a fast tri-factorization method, and Cui et al [17] come up with a transformed affine matrix rank minimization method.…”
Section: Linear Low-rank Recoverymentioning
confidence: 99%
“…Zheng et al [43] addressed a low-rank matrix recovery algorithm with fisher discrimination regularization for face recognition. D 2 L 2 R 2 [6] seeks low-rank dictionary for each class.…”
Section: Low-rank Learningmentioning
confidence: 99%