2013
DOI: 10.1007/978-3-642-38466-0_2
|View full text |Cite
|
Sign up to set email alerts
|

Efficient Discriminative K-SVD for Facial Expression Recognition

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
3
0

Year Published

2017
2017
2017
2017

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(3 citation statements)
references
References 20 publications
0
3
0
Order By: Relevance
“…With regard to image classification the sparserepresentation-based classification (SRC) methods have been widely employed such as face recognition, [22][23][24] facial expression recognition, 25 weather recognition, 26 PolSAR image classification, 27 hyperspectral image classification, 28 scene image categorization, 29 satellite image classification, 30 etc. Specifically, Wright et al proposed the SRC algorithm for face recognition: training images are selected to construct a dictionary and distinguishing a new image is realized by solving the sparse coefficients corresponding to the dictionary.…”
Section: Introductionmentioning
confidence: 99%
See 2 more Smart Citations
“…With regard to image classification the sparserepresentation-based classification (SRC) methods have been widely employed such as face recognition, [22][23][24] facial expression recognition, 25 weather recognition, 26 PolSAR image classification, 27 hyperspectral image classification, 28 scene image categorization, 29 satellite image classification, 30 etc. Specifically, Wright et al proposed the SRC algorithm for face recognition: training images are selected to construct a dictionary and distinguishing a new image is realized by solving the sparse coefficients corresponding to the dictionary.…”
Section: Introductionmentioning
confidence: 99%
“…For the initialization value of D, the method is similar to the classification method based on K-SVD without classifier, in which a subdictionary corresponding to each class is trained with K-SVD algorithm and subsequently the subdictionaries are concatenated to construct a whole dictionary. Then, the sparse coefficients S can be solved using the whole dictionary as initial values through K-SVD algorithm, which is used to compute the initialization values of A and W in equation (25).…”
mentioning
confidence: 99%
See 1 more Smart Citation