2013
DOI: 10.1109/tnnls.2013.2245340
|View full text |Cite
|
Sign up to set email alerts
|

Robust Kernel Representation With Statistical Local Features for Face Recognition

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3

Citation Types

0
62
0

Year Published

2014
2014
2018
2018

Publication Types

Select...
4
2
2

Relationship

0
8

Authors

Journals

citations
Cited by 113 publications
(62 citation statements)
references
References 60 publications
(77 reference statements)
0
62
0
Order By: Relevance
“…This is probably why progress in face identification has been relatively insignificant over the last five years. Though the proposed face identification approaches have become increasingly complex, recognition performance according to the benchmark evaluations remained relatively constant (Xie et al, 2010;Yang et al, 2013;Cament et al, 2014;Chai et al, 2014). To make a breakthrough in face identification, it seems we must revisit the foundation of face recognition, and have a fresh look at the fundamental building blocks of face recognition.…”
Section: Introductionmentioning
confidence: 99%
“…This is probably why progress in face identification has been relatively insignificant over the last five years. Though the proposed face identification approaches have become increasingly complex, recognition performance according to the benchmark evaluations remained relatively constant (Xie et al, 2010;Yang et al, 2013;Cament et al, 2014;Chai et al, 2014). To make a breakthrough in face identification, it seems we must revisit the foundation of face recognition, and have a fresh look at the fundamental building blocks of face recognition.…”
Section: Introductionmentioning
confidence: 99%
“…Hybrid architectures are formed to overcome limitations of individual system. The power in such systems stem from their capabilities to exhibit multiple information processing [1,2,3,12] Recent developments in the area of image recognition involve methods for extraction, classification, and selections [4,13,14]. An open problem in this area is to find the best features that enable success recognition in classification processes.…”
Section: Introductionmentioning
confidence: 99%
“…A classical way to deal with this is to adopt the "kernel trick " [25], which maps the features into high dimensional feature space to make features of different categories more linearly separable. In this case, we may find a sparse representation for the features more easily [5,41]. With the introduction of kernel techniques, the learned dictionary becomes versatile.…”
Section: Introductionmentioning
confidence: 99%