Face recognition algorithm based on Gabor wavelet and locality preserving projections

2017 ◽  
Vol 31 (19-21) ◽  
pp. 1740041 ◽  
Author(s):  
Xiaojie Liu ◽  
Lin Shen ◽  
Honghui Fan
Keyword(s):  
Face Recognition ◽  
Gabor Filter ◽  
Recognition Rate ◽  
Recognition Algorithm ◽  
Gabor Wavelet ◽  
Light Illumination ◽  
Locality Preserving Projections ◽  
Locality Preserving ◽  
Illumination Changes ◽  
The Face

In order to solve the effects of illumination changes and differences of personal features on the face recognition rate, this paper presents a new face recognition algorithm based on Gabor wavelet and Locality Preserving Projections (LPP). The problem of the Gabor filter banks with high dimensions was solved effectively, and also the shortcoming of the LPP on the light illumination changes was overcome. Firstly, the features of global image information were achieved, which used the good spatial locality and orientation selectivity of Gabor wavelet filters. Then the dimensions were reduced by utilizing the LPP, which well-preserved the local information of the image. The experimental results shown that this algorithm can effectively extract the features relating to facial expressions, attitude and other information. Besides, it can reduce influence of the illumination changes and the differences in personal features effectively, which improves the face recognition rate to 99.2%.

Face Recognition Based on Gabor Filter and Improved Linear Local Tangent Space Alignment Algorithm

2014 ◽  
Vol 989-994 ◽  
pp. 4091-4094
Author(s):  
Xue Yan Xu ◽  
Jiao Yu Liu ◽  
Yuan Shi ◽  
Tuo Deng
Keyword(s):  
Face Recognition ◽  
Tangent Space ◽  
Gabor Filter ◽  
Recognition Rate ◽  
Gabor Wavelet ◽  
Alignment Algorithm ◽  
Gabor Filtering ◽  
The Face ◽  
Secondary Feature ◽  
Local Tangent

In this paper, Gabor filtering and linear local tangent space alignment algorithm and its improved algorithm are used on face recognition. The Gabor wavelet transform can detect the image information in different directions and scales, according to its selective direction and frequency characteristics. The LLTSA reduces the dimension of the sample while the LLTSA and the other improved algorithms extract secondary feature. Experiment and analyze the average recognition rate of the LLTSA and its improved algorithms with the variation of dimension. The experiment results show the effectiveness of the method, increasing the face recognition accuracy.

scholarly journals Incremental Graph Regulated Nonnegative Matrix Factorization for Face Recognition

2014 ◽  
Vol 2014 ◽  
pp. 1-10 ◽  
Author(s):  
Zhe-Zhou Yu ◽  
Yu-Hao Liu ◽  
Bin Li ◽  
Shu-Chao Pang ◽  
Cheng-Cheng Jia
Keyword(s):  
Face Recognition ◽  
Matrix Factorization ◽  
Information Needs ◽  
Nonnegative Matrix Factorization ◽  
Recognition Rate ◽  
Nonnegative Matrix ◽  
Recognition Algorithm ◽  
Incremental Method ◽  
Real World Application ◽  
The Face

In a real world application, we seldom get all images at one time. Considering this case, if a company hired an employee, all his images information needs to be recorded into the system; if we rerun the face recognition algorithm, it will be time consuming. To address this problem, In this paper, firstly, we proposed a novel subspace incremental method called incremental graph regularized nonnegative matrix factorization (IGNMF) algorithm which imposes manifold into incremental nonnegative matrix factorization algorithm (INMF); thus, our new algorithm is able to preserve the geometric structure in the data under incremental study framework; secondly, considering we always get many face images belonging to one person or many different people as a batch, we improved our IGNMF algorithms to Batch-IGNMF algorithms (B-IGNMF), which implements incremental study in batches. Experiments show that (1) the recognition rate of our IGNMF and B-IGNMF algorithms is close to GNMF algorithm while it runs faster than GNMF. (2) The running times of our IGNMF and B-IGNMF algorithms are close to INMF while the recognition rate outperforms INMF. (3) Comparing with other popular NMF-based face recognition incremental algorithms, our IGNMF and B-IGNMF also outperform then both the recognition rate and the running time.

Bayesian Robust Coding Face Recognition Algorithm Based on New Dictionary

2014 ◽  
Vol 644-650 ◽  
pp. 4080-4083
Author(s):  
Ye Cai Guo ◽  
Ling Hua Zhang
Keyword(s):  
Face Recognition ◽  
Recognition Rate ◽  
Recognition Algorithm ◽  
Binary Image ◽  
Test Image ◽  
Face Database ◽  
Robust Coding ◽  
The Face ◽  
Isolated Points ◽  
Rate Comparison

In order to overcome the defects that the face recognition rate can be greatly reduced in the existing uncontrolled environments, Bayesian robust coding for face recognition based on new dictionary was proposed. In this proposed algorithm, firstly a binary image is gained by gray threshold transformation and a more clear image without some isolated points can be obtained via smoothing, secondly a new dictionary can be reconstructed via fusing the binary image with the original training dictionary, finally the test image can be classified as the existing class via Bayesian robust coding. The experimental results based on AR face database show that the proposed algorithm has higher face recognition rate comparison with RRC and RSC algorithm.

Application of Gabor Dictionary and SL0 Norm in Disguise Face Recognition

2013 ◽  
Vol 278-280 ◽  
pp. 1211-1214
Author(s):  
Jun Ying Zeng ◽  
Jun Ying Gan ◽  
Yi Kui Zhai
Keyword(s):  
Face Recognition ◽  
Function Approximation ◽  
Multiple Scales ◽  
Recognition Rate ◽  
Principal Component ◽  
Facial Feature ◽  
Training Image ◽  
Recognition Algorithm ◽  
The Face ◽  
Gabor Dictionary

A fast sparse representation face recognition algorithm based on Gabor dictionary and SL0 norm is proposed in this paper. The Gabor filters, which could effectively extract local directional features of the image at multiple scales, are less sensitive to variations of illumination, expression and camouflage. SL0 algorithm, with the advantages of calculation speed，require fewer measurement values by continuously differentiable function approximation L0 norm and reconstructed sparse signal by minimizing the approximate L0 norm. The algorithm obtain the local feature face by extracting the Gabor face feature, reduce the dimensions by principal component analysis, fast sparse classify by the SL0 norm. Under camouflage condition, The algorithm block the Gabor facial feature and improve the speed of formation of the Gabor dictionary. The experimental results on AR face database show that the proposed algorithm can improve recognition speed and recognition rate to some extent and can generalize well to the face recognition, even with a few training image per class.

scholarly journals Unrestricted Face Recognition Algorithm Based on Transfer Learning on Self-Pickup Cabinet

2021 ◽  
Vol 2021 ◽  
pp. 1-12
Author(s):  
Zhixue Liang
Keyword(s):  
Face Recognition ◽  
Transfer Learning ◽  
Recognition Rate ◽  
Recognition Algorithm ◽  
Face Image ◽  
Delivery Device ◽  
Face Images ◽  
Region Extraction ◽  
The Face ◽  
Enhancement Algorithm

In the contactless delivery scenario, the self-pickup cabinet is an important terminal delivery device, and face recognition is one of the efficient ways to achieve contactless access express delivery. In order to effectively recognize face images under unrestricted environments, an unrestricted face recognition algorithm based on transfer learning is proposed in this study. First, the region extraction network of the faster RCNN algorithm is improved to improve the recognition speed of the algorithm. Then, the first transfer learning is applied between the large ImageNet dataset and the face image dataset under restricted conditions. The second transfer learning is applied between face image under restricted conditions and unrestricted face image datasets. Finally, the unrestricted face image is processed by the image enhancement algorithm to increase its similarity with the restricted face image, so that the second transfer learning can be carried out effectively. Experimental results show that the proposed algorithm has better recognition rate and recognition speed on the CASIA-WebFace dataset, FLW dataset, and MegaFace dataset.

Study on face recognition under unconstrained conditions based on LBP and deep learning

2020 ◽  
pp. 1-12
Author(s):  
Liping Zhou ◽  
Mingwei Gao ◽  
Chun He
Keyword(s):  
Deep Learning ◽  
Face Recognition ◽  
Input Data ◽  
Recognition Rate ◽  
Texture Feature ◽  
Recognition Algorithm ◽  
Correct Recognition ◽  
Layer By Layer ◽  
The Face ◽  
Correct Recognition Rate

At present, the correct recognition rate of face recognition algorithm is limited under unconstrained conditions. To solve this problem, a face recognition algorithm based on deep learning under unconstrained conditions is proposed in this paper. The algorithm takes LBP texture feature as the input data of deep network, and trains the network layer by layer greedily to obtain optimized parameters of network, and then uses the trained network to predict the test samples. Experimental results on the face database LFW show that the proposed algorithm has higher correct recognition rate than some traditional algorithms under unconstrained conditions. In order to further verify its effectiveness and universality, this algorithm was also tested in YALE and YALE-B, and achieved a high correct recognition rate as well, which indicated that the deep learning method using LBP texture feature as input data is effective and robust to face recognition.

A Face Recognition Algorithm Based on Block PCA and Wavelet Transform

2010 ◽  
Vol 40-41 ◽  
pp. 523-530 ◽  
Author(s):  
Dong Cheng Shi ◽  
Qing Qing Wang
Keyword(s):  
Face Recognition ◽  
Wavelet Transform ◽  
Recognition Rate ◽  
Low Frequency ◽  
Principal Component ◽  
Recognition Algorithm ◽  
Global Features ◽  
Face Area ◽  
The Face ◽  
Pca Method

As the most successful method of linear distinguish, principal component analysis(PCA) method is widely used in identify areas, such as face recognition. But traditional PCA is influenced by light conditions, facial expression and it extracts the global features of the image, so the recognition rate is not very high. In order to improve more accurately identify facial features and extract local features which account for a larger contribution to the identification. This paper brings up a method of a block face recognition based on wavelet transform (WT-BPCA). In the algorithm, face images are done two-dimensional wavelet decomposition, then from which extract low frequency sub-images. According to different face area makes different contribution to recognition, we use sub-block PCA method. According to the contribution of the block recognition results generate weighting factors, the face recognition rate based on PCA is effectively improved. Finally we construct classification to recognite. Do experiments in the ORL face database. Results show that this method is superior to the method of the traditional PCA.

A novel face recognition in uncontrolled environment based on block 2D-CS-LBP features and deep residual network

2020 ◽  
Vol 13 (2) ◽  
pp. 207-221
Author(s):  
Minghua Wei
Keyword(s):  
Face Recognition ◽  
Recognition Rate ◽  
Texture Features ◽  
Recognition Algorithm ◽  
Residual Network ◽  
Content Type ◽  
Identity Recognition ◽  
Local Texture ◽  
Computation Efficiency ◽  
The Face

PurposeIn order to solve the problem that the performance of the existing local feature descriptors in uncontrolled environment is greatly affected by illumination, background, occlusion and other factors, we propose a novel face recognition algorithm in uncontrolled environment which combines the block central symmetry local binary pattern (CS-LBP) and deep residual network (DRN) model.Design/methodology/approachThe algorithm first extracts the block CSP-LBP features of the face image, then incorporates the extracted features into the DRN model, and gives the face recognition results by using a well-trained DRN model. The features obtained by the proposed algorithm have the characteristics of both local texture features and deep features that robust to illumination.FindingsCompared with the direct usage of the original image, the usage of local texture features of the image as the input of DRN model significantly improves the computation efficiency. Experimental results on the face datasets of FERET, YALE-B and CMU-PIE have shown that the recognition rate of the proposed algorithm is significantly higher than that of other compared algorithms.Originality/valueThe proposed algorithm fundamentally solves the problem of face identity recognition in uncontrolled environment, and it is particularly robust to the change of illumination, which proves its superiority.

Sign in / Sign up

Export Citation Format

Share Document