Robust principal component analysis for recognition

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

Abstract

Recently, exactly recovering the intrinsic data structure from highly corrupted observations, which is known as robust principal component analysis (RPCA), has attracted great interest and found many applications in computer vision. Previous work has used RPCA to remove shadows and illuminations from face images. To go further, this paper introduces a method to use RPCA directly for recognition. And the inexact Augmented Lagrange Multiplier algorithm (ALM) is used to solve the RPCA problem. We actually utilize RPCA to reconstruct the testing sample from the training samples and compare the reconstructed one with the original one to do classification. Although the method is not very complicated, through experiments on some face databases we can see that it has better performance compared with some existing methods, especially under rigorous circumstances of occlusions and illuminations. © 2013 Springer-Verlag Berlin Heidelberg.

Author supplied keywords

Cite

CITATION STYLE

APA

Chen, Y., & Yang, J. (2013). Robust principal component analysis for recognition. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8261 LNCS, pp. 223–229). Springer Verlag. https://doi.org/10.1007/978-3-642-42057-3_29

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