Robust Face Recognition via Sparse Representation
TLDR
This work considers the problem of automatically recognizing human faces from frontal views with varying expression and illumination, as well as occlusion and disguise, and proposes a general classification algorithm for (image-based) object recognition based on a sparse representation computed by C1-minimization.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 C1-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.read more
Citations
More filters
Proceedings ArticleDOI
Fast and Robust Archetypal Analysis for Representation Learning
TL;DR: A fast optimization scheme using an active-set strategy is proposed and an efficient open-source implementation interfaced with Matlab, R, and Python is provided, demonstrating the usefulness of archetypal analysis for computer vision tasks, such as codebook learning, signal classification, and large image collection visualization.
Journal ArticleDOI
Classification accuracy is not enough
TL;DR: It is argued that an evaluation of system behavior at the level of the music is required to usefully address the fundamental problems of music genre recognition (MGR), and indeed other tasks of music information retrieval, such as autotagging.
Journal ArticleDOI
A visual attention based ROI detection method for facial expression recognition
Wenyun Sun,Haitao Zhao,Zhong Jin +2 more
TL;DR: The visualization shows that the learned regions of interest are partly consistent with the locations of emotion specific Action Units, which confirms the interpretation of Facial Action Coding System and Emotional facial expression recognition from a machine learning perspective.
Journal ArticleDOI
Transform-Invariant PCA: A Unified Approach to Fully Automatic FaceAlignment, Representation, and Recognition
TL;DR: A transform-invariant PCA technique which aims to accurately characterize the intrinsic structures of the human face that are invariant to the in-plane transformations of the training images, and suggests that state-of-the-art invariant descriptors, such as local binary pattern, histogram of oriented gradient, and Gabor energy filter, can benefit from using the TIPCA-aligned faces.
Proceedings ArticleDOI
Facial action unit recognition with sparse representation
TL;DR: A novel framework for recognition of facial action unit (AU) combinations by viewing the classification as a sparse representation problem and building an overcomplete dictionary whose main elements are mean Gabor features of AU combinations under examination.
References
More filters
Journal ArticleDOI
Regression Shrinkage and Selection via the Lasso
TL;DR: A new method for estimation in linear models called the lasso, which minimizes the residual sum of squares subject to the sum of the absolute value of the coefficients being less than a constant, is proposed.
Book
The Nature of Statistical Learning Theory
TL;DR: Setting of the learning problem consistency of learning processes bounds on the rate of convergence ofLearning processes controlling the generalization ability of learning process constructing learning algorithms what is important in learning theory?
Book
Convex Optimization
Stephen Boyd,Lieven Vandenberghe +1 more
TL;DR: In this article, the focus is on recognizing convex optimization problems and then finding the most appropriate technique for solving them, and a comprehensive introduction to the subject is given. But the focus of this book is not on the optimization problem itself, but on the problem of finding the appropriate technique to solve it.
Journal ArticleDOI
Eigenfaces for recognition
Matthew Turk,Alex Pentland +1 more
TL;DR: A near-real-time computer system that can locate and track a subject's head, and then recognize the person by comparing characteristics of the face to those of known individuals, and that is easy to implement using a neural network architecture.
Journal ArticleDOI
Eigenfaces vs. Fisherfaces: recognition using class specific linear projection
TL;DR: A face recognition algorithm which is insensitive to large variation in lighting direction and facial expression is developed, based on Fisher's linear discriminant and produces well separated classes in a low-dimensional subspace, even under severe variations in lighting and facial expressions.