Discriminative Sparsity Graph Embedding for Unconstrained Face Recognition
AbstractIn this paper, we propose a new dimensionality reduction method named Discriminative Sparsity Graph Embedding (DSGE) which considers the local structure information and the global distribution information simultaneously. Firstly, we adopt the intra-class compactness constraint to automatically construct the intrinsic adjacent graph, which enhances the reconstruction relationship between the given sample and the non-neighbor samples with the same class. Meanwhile, the inter-class compactness constraint is exploited to construct the penalty adjacent graph, which reduces the reconstruction influence between the given sample and the pseudo-neighbor samples with the different classes. Then, the global distribution constraints are introduced to the projection objective function for seeking the optimal subspace which compacts intra-classes samples and alienates inter-classes samples at the same time. Extensive experiments are carried out on AR, Extended Yale B, LFW and PubFig databases which are four representative face datasets, and the corresponding experimental results illustrate the effectiveness of our proposed method. View Full-Text
Share & Cite This Article
Tong, Y.; Zhang, J.; Chen, R. Discriminative Sparsity Graph Embedding for Unconstrained Face Recognition. Electronics 2019, 8, 503.
Tong Y, Zhang J, Chen R. Discriminative Sparsity Graph Embedding for Unconstrained Face Recognition. Electronics. 2019; 8(5):503.Chicago/Turabian Style
Tong, Ying; Zhang, Jiachao; Chen, Rui. 2019. "Discriminative Sparsity Graph Embedding for Unconstrained Face Recognition." Electronics 8, no. 5: 503.
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.