Graph Regularized Within-Class Sparsity Preserving Projection for Face Recognition

Information

Songjiang Lou¹  Xiaoming Zhao²  Wenping Guo²  Ying Chen² 

[1] Institute of Image Processing & Pattern Recognition, Tai Zhou University, Taizhou 318000, China;

关键词: dimensionality reduction;    sparse representation;    graph embedding;    face recognition;   

DOI  :  10.3390/info6020152

来源: mdpi

【 摘 要 】

As a dominant method for face recognition, the subspace learning algorithm shows desirable performance. Manifold learning can deal with the nonlinearity hidden in the data, and can project high dimensional data onto low dimensional data while preserving manifold structure. Sparse representation shows its robustness for noises and is very practical for face recognition. In order to extract the facial features from face images effectively and robustly, in this paper, a method called graph regularized within-class sparsity preserving analysis (GRWSPA) is proposed, which can preserve the within-class sparse reconstructive relationship and enhances separatability for different classes. Specifically, for each sample, we use the samples in the same class (except itself) to represent it, and keep the reconstructive weight unchanged during projection. To preserve the manifold geometry structure of the original space, one adjacency graph is constructed to characterize the interclass separability and is incorporated into its criteria equation as a constraint in a supervised manner. As a result, the features extracted are sparse and discriminative and helpful for classification. Experiments are conducted on the two open face databases, the ORL and YALE face databases, and the results show that the proposed method can effectively and correctly find the key facial features from face images and can achieve better recognition rate compared with other existing ones.

【 授权许可】

CC BY   
© 2015 by the authors; licensee MDPI, Basel, Switzerland.