A new constrained nonnegative matrix factorization for facial expression recognition

A new NMF model, spatial constrained graph sparse nonnegative matrix factorization (SGSNMF) is adopted for facial expression recognition. In this model, the extracted features preserve the topological structure of the original images and achieve sparseness from L2 constraint on coefficient matrix, meanwhile the base satisfy pixel dispersion penalty. The proposed method takes advantage of the project gradient decent and is based on the alternating nonnegative least square framework. Experiments on two facial expression recognition scenarios that involve a whole face and an occluded face reveal that the proposed algorithm outperforms the prevalent NMF methods.