Robust Face Recognition via Sparse Representation
نویسنده
چکیده
In this project, we implement a robust face recognition system via sparse representation and convex optimization. We treat each test sample as sparse linear combination of training samples, and get the sparse solution via L1-minimization. We also explore the group sparseness (L2-norm) as well as normal L1-norm regularization.We discuss the role of feature extraction and classification robustness to occlusion or pixel corruption of face recognition system. The experiments demonstrate the choice of features is no longer critical once the sparseness is properly harnessed. We also verify that the proposed algorithm outperforms other methods.
منابع مشابه
Efficient Misalignment-Robust Representation for Real-Time Face Recognition
Sparse representation techniques for robust face recognition have been widely studied in the past several years. Recently face recognition with simultaneous misalignment, occlusion and other variations has achieved interesting results via robust alignment by sparse representation (RASR). In RASR, the best alignment of a testing sample is sought subject by subject in the database. However, such ...
متن کاملRobust face recognition via low-rank sparse representation-based classification
Face recognition has attracted great interest due to its importance in many real-world applications. In this paper, we present a novel low-rank sparse representation-based classification (LRSRC) method for robust face recognition. Given a set of test samples, LRSRC seeks the lowest-rank and sparsest representation matrix over all training samples. Since low-rank model can reveal the subspace st...
متن کاملFace Recognition with Image Misalignment via Structure Constraint Coding
Face recognition (FR) via sparse representation has been widely studied in the past several years. Recently many sparse representation based face recognition methods with simultaneous misalignment were proposed and showed interesting results. In this paper, we present a novel method called structure constraint coding (SCC) for face recognition with image misalignment. Unlike those sparse repres...
متن کاملRobust Face Recognition via Block Sparse Bayesian Learning
Face recognition (FR) is an important task in pattern recognition and computer vision. Sparse representation (SR) has been demonstrated to be a powerful framework for FR. In general, an SR algorithm treats each face in a training dataset as a basis function, and tries to find a sparse representation of a test face under these basis functions. The sparse representation coefficients then provide ...
متن کاملGabor feature based robust representation and classification for face recognition with Gabor occlusion dictionary
By representing the input testing image as a sparse linear combination of the training samples via l1-norm minimization, sparse representation based classification (SRC) has shown promising results for face recognition (FR). Particularly, by introducing an identity occlusion dictionary to code the occluded portions of face images, SRC could lead to robust FR results against face occlusion. Howe...
متن کامل