Structure preserving low-rank representation for semi-supervised face recognition

5Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Constructing an informative and discriminative graph plays an important role in the graph based semi-supervised learning methods. Among these graph construction methods, low-rank representation based graph, which calculates the edge weights of both labeled and unlabeled samples as the low-rank representation (LRR) coefficients, has shown excellent performance in semi-supervised learning. In this paper, we additionally impose twofold constraints (local affinity and distant repulsion) on the LRR graph. The improved model, termed structure preserving LRR (SPLRR), can preserve the local geometrical structure but without distorting the distant repulsion property. Experiments are taken on three widely used face data sets to investigate the performance of SPLRR and the results show that it is superior to some state-of-the-art semi-supervised graphs. © Springer-Verlag 2013.

Cite

CITATION STYLE

APA

Peng, Y., Wang, S., Wang, S., & Lu, B. L. (2013). Structure preserving low-rank representation for semi-supervised face recognition. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8227 LNCS, pp. 148–155). https://doi.org/10.1007/978-3-642-42042-9_19

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free