Facial expression recognition based on graph-preserving sparse non-negative matrix factorization
2009 (English)Conference paper (Refereed)
In this paper, we present a novel algorithm for representing facial expressions. The algorithm is based on the non-negative matrix factorization (NMF) algorithm, which decomposes the original facial image matrix into two non-negative matrices, namely the coefficient matrix and the basis image matrix. We call the novel algorithm graph-preserving sparse non-negative matrix factorization (GSNMF). GSNMF utilizes both sparse and graph-preserving constraints to achieve a non-negative factorization. The graph-preserving criterion preserves the structure of the original facial images in the embedded sub-space while considering the class information of the facial images. Therefore, GSNMF has more discriminant power than NMF. GSNMF is applied to facial images for the recognition of six basic facial expressions. Our experiments show that GSNMF achieves on average a recognition rate of 93.5% compared to that of discriminant NMF with 91.6%.
Place, publisher, year, edition, pages
2009. 3257-3260 p.
Facial expression recognition, non-negative matrix factorization, graph-preserving constraint, sparse representations
IdentifiersURN: urn:nbn:se:kth:diva-36092DOI: 10.1109/ICIP.2009.5413940ISI: 000280464301271ScopusID: 2-s2.0-77951956531OAI: oai:DiVA.org:kth-36092DiVA: diva2:430391
IEEE International Conference on Image Processing
QC 201107082011-07-082011-07-082016-05-02Bibliographically approved