Graph Regularized Sparsity Discriminant Analysis for face recognition

• Published in: Neurocomputing (Amsterdam) 2016-01, Vol.173, p.290-297
• Main Authors: Lou, Songjiang, Zhao, Xiaoming, Chuang, Yuelong, Yu, Haitao, Zhang, Shiqing
• Format: Article
• Language: English
• Subjects: Face recognition; Feature extraction; Graph embedding; Sparse representation; Sparsity preserving projection
• ISSN: 0925-2312; 1872-8286
• DOI: 10.1016/j.neucom.2015.04.116

Manifold learning and Sparse Representation Classifier are two popular techniques for face recognition. Because manifold learning can find low-dimensional representations for high-dimensional data, it is widely applied in computer vision and pattern recognition. Most of the manifold learning algorithms can be unified in the graph embedding framework, where the first step is to determine the adjacent graphs. Traditional methods use k nearest neighbor or the ε-ball schemes. However, they are parametric and sensitive to noises. Moreover, it is hard to determine the size of appropriate neighborhoods. To deal with these problems, in this paper, Graph Regularized Sparsity Discriminant Analysis, GRSDA, for short, is proposed. Based on graph embedding and sparsity preserving projection, the weight matrices for intrinsic and penalty graphs are obtained through sparse representation. GRSDA seeks a subspace in which samples in intra-classes are as compact as possible while samples in inter-classes are as separable as possible. Specifically, samples in the low-dimensional space can preserve the sparse locality relationship in the same class, while enhancing the separability for samples in different classes. Hence, GRSDA can achieve better performance. Extensive experiments were carried out on ORL, YALE-B and AR face databases, and the results confirmed that the proposed algorithm outperformed LPP, UDP, SPP and DSNPE.