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
Journal ArticleDOI
Prior Knowledge-Based Probabilistic Collaborative Representation for Visual Recognition
TL;DR: This paper proposes a novel classifier, called the prior knowledge-based probabilistic collaborative representation-based classifier (PKPCRC), for visual recognition that outperforms several state-of-the-art classifiers.
Journal ArticleDOI
Tensor Low-Rank Representation for Data Recovery and Clustering
TL;DR: Experimental results on two computer vision data analysis tasks, image/video recovery and face clustering, clearly demonstrate the superior performance, efficiency and robustness of the developed method over state-of-the-arts including the popular LRR and SSC methods.
Journal ArticleDOI
Landmark recognition with sparse representation classification and extreme learning machine
Jiuwen Cao,Yanfei Zhao,Xiaoping Lai,Marcus Eng Hock Ong,Marcus Eng Hock Ong,Chun Yin,Zhi Xiong Koh,Nan Liu,Nan Liu +8 more
TL;DR: A novel landmark recognition algorithm using the spatial pyramid kernel based bag-of-words (SPK-BoW) histogram approach with the feedforward artificial neural networks (FNN) and the sparse representation classifier (SRC) is proposed.
Proceedings ArticleDOI
Approximating discrete probability distribution of image emotions by multi-modal features fusion
TL;DR: A novel machine learning approach that formulates the categorical image emotions as a discrete probability distribution (DPD) to associate emotions with the extracted visual features is proposed and a weighted multi-modal shared sparse leaning to learn the combination coefficients is presented.
Proceedings Article
Persistent target tracking using likelihood fusion in wide-area and full motion video sequences
Rengarajan Pelapur,Sema Candemir,Filiz Bunyak,Mahdieh Poostchi,Guna Seetharaman,Kannappan Palaniappan +5 more
TL;DR: Comparison with a number of single object tracking systems shows that LoFT outperforms other visual trackers, including state-of-the-art sparse representation and learning based methods, by a significant amount on the CLIF sequences and is competitive on FMV sequences.
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.