Multi-resolution dictionary collaborative representation for face recognition

Author(s):  
Zhen Liu ◽  
Xiao-Jun Wu ◽  
Zhenqiu Shu
2013 ◽  
Vol 756-759 ◽  
pp. 3590-3595
Author(s):  
Liang Zhang ◽  
Ji Wen Dong

Aiming at solving the problems of occlusion and illumination in face recognition, a new method of face recognition based on Kernel Principal Components Analysis (KPCA) and Collaborative Representation Classifier (CRC) is developed. The KPCA can obtain effective discriminative information and reduce the feature dimensions by extracting faces nonlinear structures features, the decisive factor. Considering the collaboration among the samples, the CRC which synthetically consider the relationship among samples is used. Experimental results demonstrate that the algorithm obtains good recognition rates and also improves the efficiency. The KCRC algorithm can effectively solve the problem of illumination and occlusion in face recognition.


2018 ◽  
Vol 75 (5) ◽  
pp. 2304-2314
Author(s):  
Xincan Fan ◽  
Kaiyang Liu ◽  
Haibo Yi

2016 ◽  
Vol 45 (3) ◽  
pp. 967-979 ◽  
Author(s):  
Taisong Jin ◽  
Zhiling Liu ◽  
Zhengtao Yu ◽  
Xiaoping Min ◽  
Lingling Li

Sensors ◽  
2019 ◽  
Vol 19 (4) ◽  
pp. 759 ◽  
Author(s):  
Liang Shi ◽  
Xiaoning Song ◽  
Tao Zhang ◽  
Yuquan Zhu

Traditional Collaborative Representation-based Classification algorithms for face recognition (CRC) usually suffer from data uncertainty, especially if it includes various poses and illuminations. To address this issue, in this paper, we design a new CRC method using histogram statistical measurement (H-CRC) combined with a 3D morphable model (3DMM) for pose-invariant face classification. First, we fit a 3DMM to raw images in the dictionary to reconstruct the 3D shapes and textures. The fitting results are used to render numerous virtual samples of 2D images that are frontalized from arbitrary poses. In contrast to other distance-based evaluation algorithms for collaborative (or sparse) representation-based methods, the histogram information of all the generated 2D face images is subsequently exploited. Second, we use a histogram-based metric learning to evaluate the most similar neighbours of the test sample, which aims to obtain ideal result for pose-invariant face recognition using the designed histogram-based 3DMM model and online pruning strategy, forming a unified 3D-aided CRC framework. The proposed method achieves desirable classification results that are conducted on a set of well-known face databases, including ORL, Georgia Tech, FERET, FRGC, PIE and LFW.


Author(s):  
Shuhuan Zhao

Face recognition (FR) is a hotspot in pattern recognition and image processing for its wide applications in real life. One of the most challenging problems in FR is single sample face recognition (SSFR). In this paper, we proposed a novel algorithm based on nonnegative sparse representation, collaborative presentation, and probabilistic graph estimation to address SSFR. The proposed algorithm is named as Nonnegative Sparse Probabilistic Estimation (NNSPE). To extract the variation information from the generic training set, we first select some neighbor samples from the generic training set for each sample in the gallery set and the generic training set can be partitioned into some reference subsets. To make more meaningful reconstruction, the proposed method adopts nonnegative sparse representation to reconstruct training samples, and according to the reconstruction coefficients, NNSPE computes the probabilistic label estimation for the samples of the generic training set. Then, for a given test sample, collaborative representation (CR) is used to acquire an adaptive variation subset. Finally, the NNSPE classifies the test sample with the adaptive variation subset and probabilistic label estimation. The experiments on the AR and PIE verify the effectiveness of the proposed method both in recognition rates and time cost.


Sign in / Sign up

Export Citation Format

Share Document