Skip to content

Robust Face Recognition via Sparse Representation

John N. Wright, A. Yang, Arvind Ganesh, Shankar Sastry, Yi Ma

IEEE Transactions on Pattern Analysis and Machine Intelligence · 2009 · 9,406 citations

No retraction on record in OpenAlex.Check Crossref now

Cite this paper

Wright, J. N., Yang, A., Ganesh, A., Sastry, S., & Ma, Y. (2009). Robust face recognition via sparse representation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 31(2), 210–227. https://doi.org/10.1109/tpami.2008.79

In text: (Wright et al., 2009)

Ask a question about this research

One question, free, no account. Anchorcite finds the papers, checks each against Crossref and links every sentence of the answer to the passage it comes from.

Abstract

We consider the problem of automatically recognizing human faces from frontal views with varying expression and illumination, as well as occlusion and disguise. We cast the recognition problem as one of classifying among multiple linear regression models and argue that new theory from sparse signal representation offers the key to addressing this problem. Based on a sparse representation computed by l{1}-minimization, we propose a general classification algorithm for (image-based) object recognition. This new framework provides new insights into two crucial issues in face recognition: feature extraction and robustness to occlusion. For feature extraction, we show that if sparsity in the recognition problem is properly harnessed, the choice of features is no longer critical. What is critical, however, is whether the number of features is sufficiently large and whether the sparse representation is correctly computed. Unconventional features such as downsampled images and random projections perform just as well as conventional features such as Eigenfaces and Laplacianfaces, as long as the dimension of the feature space surpasses certain threshold, predicted by the theory of sparse representation. This framework can handle errors due to occlusion and corruption uniformly by exploiting the fact that these errors are often sparse with respect to the standard (pixel) basis. The theory of sparse representation helps predict how much occlusion the recognition algorithm can handle and how to choose the training images to maximize robustness to occlusion. We conduct extensive experiments on publicly available databases to verify the efficacy of the proposed algorithm and corroborate the above claims.

  1. Regularization and Variable Selection Via the Elastic Net2005
  2. Reducing the Dimensionality of Data with Neural Networks2006
  3. Nonlinear Dimensionality Reduction by Locally Linear Embedding2000
  4. Representation Learning: A Review and New Perspectives2013
  5. Eigenfaces for Recognition1991

Metadata from OpenAlex (CC0). Citations are generated from the published record.