In this paper, we propose two self-adapting patch strategies, which are obtained by employing the integral projection technique on images’ edge images, while the edge images are recovered by the two-dimensional discrete wavelet transform. The patch strategies are equipped with the advantage of considering the single image’s unique properties and maintaining the integrity of some particular local information. Combining the self-adapting patch strategies with local binary pattern feature extraction and the classifier of the forward and backward greedy algorithms under strong sparse constraint, we propose two new face recognition methods. Experiments are run on the Georgia Tech, LFW and AR face databases. The obtained numerical results show that the new methods outperform some related patch-based methods to a larger extent.

Face recognition has been extensively studied by many scholars in the recent decades. Local binary pattern (LBP) is one of the most popular local descriptors and has been widely applied to face recognition. Wavelet transform is also more and more active in the field of pattern recognition. In this paper, a novel feature extraction method is proposed to overcome illumination influence. First, a given face image is processed by the LBP operator, and an LBP image is obtained. Second, wavelet transform is used to extract discriminant feature from the LBP image. The experiment results on LFW, Extended YaleB and CMU-PIE face databases show that the proposed method outperforms several popular face recognition methods, and the preprocessing step plays an important role to extract effective features for classification.

In this paper, a novel feature extraction method based on an improved color local binary pattern (LBP) is proposed for color face recognition. Firstly, in a given neighborhood of every pixel, we choose some sampling points from three color channels simultaneously and the numbers of the sampling points from every channel may be different. Secondly, we use a new rule to select the threshold which does not always locate in the geometrical center of the given neighborhood. Thirdly, in order to excavate the potential of the proposed sampling method, we use the [Formula: see text]-uniform LBP to obtain the binary code of each pixel. In addition, we embed the Hamming distance into our method for improving the recognition rate of the proposed method. For evaluating the performance of our method, we implement the proposed method and several related methods on five public face databases: FERET, CMU-PIE, Georgia, FEI and Asian databases. Experimental results show that our method possesses higher recognition rates and lower computational cost than other related color face recognition methods.

In this paper, a customized sparse representation model is proposed to take advantage of the variational information for undersampled face recognition. The proposed model with the mixed norm is a generalization of the extended sparse representation-based classification model. This model guarantees the sparsity of representation coefficient and the robustness for the variational information from generic data set. The mixed norm well fits the distribution of variational information (such as illumination, expression, poses, and occlusion) and the interference information (somewhat face-specific in generic data set) simultaneously. We compare the proposed method with the related methods on several popular face databases, including AR, CMU-PIE, Georgia, and LFW databases. The experimental results show that the proposed method outperforms several popular face recognition methods.