Facial expression recognition based on graph-preserving sparse non-negative matrix factorization

Authors:
Ruicong Zhi;Markus Flierl;Qiuqi Ruan;Bastiaan Kleijn
Affiliations:
Institute of Information Science, Beijing Jiaotong University, Beijing, P.R. China;ACCESS Linnaeus Center, School of Electrical Engineering, KTH-Royal Institute of Technology, Stockholm;Institute of Information Science, Beijing Jiaotong University, Beijing, P.R. China;ACCESS Linnaeus Center, School of Electrical Engineering, KTH-Royal Institute of Technology, Stockholm
Venue:
ICIP'09 Proceedings of the 16th IEEE international conference on Image processing
Year:
2009

Citing 5
Cited 1

Comprehensive Database for Facial Expression Analysis

FG '00 Proceedings of the Fourth IEEE International Conference on Automatic Face and Gesture Recognition 2000
Face Recognition Using Laplacianfaces

IEEE Transactions on Pattern Analysis and Machine Intelligence
Non-negative Matrix Factorization with Sparseness Constraints

The Journal of Machine Learning Research
Projected Gradient Methods for Nonnegative Matrix Factorization

Neural Computation
Exploiting discriminant information in nonnegative matrix factorization with application to frontal face verification

IEEE Transactions on Neural Networks

Automatic facial expression recognition based on spatiotemporal descriptors

Pattern Recognition Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 subspace 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%.