Abstract
Face recognition is challenging especially when the images from different persons are similar to each other due to variations in illumination, expression, and occlusion. If we have sufficient training images of each person which can span the facial variations of that person under testing conditions, sparse representation based classification (SRC) achieves very promising results. However, in many applications, face recognition often encounters the small sample size problem arising from the small number of available training images for each person. In this paper, we present a novel face recognition framework by utilizing low-rank and sparse error matrix decomposition, and sparse coding techniques (LRSE+SC). Firstly, the low-rank matrix recovery technique is applied to decompose the face images per class into a low-rank matrix and a sparse error matrix. The low-rank matrix of each individual is a class-specific dictionary and it captures the discriminative feature of this individual. The sparse error matrix represents the intra-class variations, such as illumination, expression changes. Secondly, we combine the low-rank part (representative basis) of each person into a supervised dictionary and integrate all the sparse error matrix of each individual into a within-individual variant dictionary which can be applied to represent the possible variations between the testing and training images. Then these two dictionaries are used to code the query image. The within-individual variant dictionary can be shared by all the subjects and only contribute to explain the lighting conditions, expressions, and occlusions of the query image rather than discrimination. At last, a reconstruction-based scheme is adopted for face recognition. Since the within-individual dictionary is introduced, LRSE+SC can handle the problem of the corrupted training data and the situation that not all subjects have enough samples for training. Experimental results show that our method achieves the state-of-the-art results on AR, FERET, FRGC and LFW databases.
Highlights
Face recognition has been an active topic in machine learning, computer vision and pattern recognition research due to its potential value for applications and theoretical challenges
Besides sparse representation based classification (SRC), we compare our method with linear regression for classification (LRC) [29], Extended SRC (ESRC) [25], metaface learning (MFL), RLRC1 and RLRC2 [27]
We have introduced a novel face recognition framework by utilizing low rank matrix recovery
Summary
Face recognition has been an active topic in machine learning, computer vision and pattern recognition research due to its potential value for applications and theoretical challenges. The linear regression based algorithms assume that the images of one individual subject lie on a class-specific linear subspace. SRC assumes that training samples from each subject lie on a linear subspace spanned by the training images from the given subject. . .; βini] 2 Rni is the coefficient vector corresponding to Xi. for a test sample y 2 Rm belonging to class i, if given sufficient training samples of class i, we have y 1⁄4 xi bi1 þ xi bi2 þÁÁÁþ xini bini 1⁄4 Xibi; ð1Þ where βi = [βi; βi2; . . .; βini] 2 Rni is the coefficient vector corresponding to Xi This class-specific subspace is embedded in the linear space spanned by all the training images. Y can be cast as the linear combination of all training samples, i.e
Published Version (Free)
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have