Efficient discriminative K-SVD for facial expression recognition

1Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Dictionary learning has attracted growing intention for its prominent performance in many computer vision applications including facial expression recognition (FER). Discriminative K-SVD (D-KSVD) is one of conventional dictionary learning methods, which can effectively unify dictionary learning and classifier. However, the computation is huge when applying D-KSVD directly on Gabor features which has high dimension. To tackle this problem, we employ random projection on Gabor features and then put the reduced features into D-KSVD schema to obtain sparse representation and dictionary. To evaluate the performance, we implement the proposed method for FER on JAFFE database. We also employ support vector machine (SVM) on the sparse codes for FER. Experimental results show that the computation is reduced a lot with little performance lost. © 2013 Springer-Verlag.

Cite

CITATION STYLE

APA

Liu, W., Song, C., & Wang, Y. (2013). Efficient discriminative K-SVD for facial expression recognition. In Lecture Notes in Electrical Engineering (Vol. 256 LNEE, pp. 11–19). https://doi.org/10.1007/978-3-642-38466-0_2

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free