Title :
A sparse representation approach for local feature based expression recognition
Author :
Jia, Qi ; Liu, Yu ; Guo, He ; Luo, Zhongxuan ; Wang, Yuxin
Author_Institution :
Sch. of Software Technol., Dalian Univ. of Technol., Dalian, China
Abstract :
A novel facial expression recognition method based on sparse representation (SR) is proposed. To enhance the effect of important face region, fisher separation criterion is introduced to calculate the weight of local binary patterns (LBP) patches. Expression recognition technique using the new mathematical theory from sparse representation an compressive sensing is proposed, and the improvements in performance are discussed. Furthermore, a multi-layer sparse representation (MLSR) algorithm is proposed for multi-intensity expression recognition. Experiments showed a better result than conventional sparse representation. More important, MLSR can be generalized to similar classification problems. To verify the efficiency of the proposed methods, a serious of experiments on publicly available databases is performed, including comparisons among SVM, SR, and MLSR. Especially, our method shows better performance against low-resolution images.
Keywords :
face recognition; image classification; image representation; image resolution; mathematical analysis; visual databases; SVM; classification problems; compressive sensing; databases; facial expression recognition method; fisher separation criterion; local binary patterns; local feature based expression recognition; low-resolution images; mathematical theory; multi-intensity expression recognition; multilayer sparse representation algorithm; Face; Face recognition; Image recognition; Image resolution; Strontium; Support vector machines; Training; Compressive sensing; Facial expression recognition; Local binary patterns; Sparse representation; Weighted patches;
Conference_Titel :
Multimedia Technology (ICMT), 2011 International Conference on
Conference_Location :
Hangzhou
Print_ISBN :
978-1-61284-771-9
DOI :
10.1109/ICMT.2011.6003056