Eigenfaces vs. Fisherfaces: Recognition Using Class Specific Linear Projection
IEEE Transactions on Pattern Analysis and Machine Intelligence
On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems
Theoretical Computer Science
From Few to Many: Illumination Cone Models for Face Recognition under Variable Lighting and Pose
IEEE Transactions on Pattern Analysis and Machine Intelligence
Face recognition: A literature survey
ACM Computing Surveys (CSUR)
Convex Optimization
Face Recognition Using Laplacianfaces
IEEE Transactions on Pattern Analysis and Machine Intelligence
Acquiring Linear Subspaces for Face Recognition under Variable Lighting
IEEE Transactions on Pattern Analysis and Machine Intelligence
Learning a dictionary of shape-components in visual cortex: comparison with neurons, humans and machines
Robust Face Recognition via Sparse Representation
IEEE Transactions on Pattern Analysis and Machine Intelligence
A regularized correntropy framework for robust pattern recognition
Neural Computation
Maximum Correntropy Criterion for Robust Face Recognition
IEEE Transactions on Pattern Analysis and Machine Intelligence
IEEE Transactions on Information Theory
Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
IEEE Transactions on Information Theory
Graph Regularized Sparse Coding for Image Representation
IEEE Transactions on Image Processing
Engineering Applications of Artificial Intelligence
One-shot learning gesture recognition from RGB-D data using bag of features
The Journal of Machine Learning Research
Hi-index | 0.01 |
Sparse representation has received an increasing amount of interest in recent years. By representing the testing image as a sparse linear combination of the training samples, sparse representation based classification (SRC) has been successfully applied in face recognition. In SRC, the @?^1 minimization instead of the @?^0 minimization is used to seek for the sparse solution for its computational convenience and efficiency. However, @?^1 minimization does not always yield sufficiently sparse solution in many practical applications. In this paper, we propose a novel SRC method, namely the @?^p (0