Face Recognition by PCA and Improved LBP Fusion Algorithm

2015 ◽  
Vol 734 ◽  
pp. 562-567 ◽  
Author(s):  
En Zeng Dong ◽  
Yan Hong Fu ◽  
Ji Gang Tong

This paper proposed a theoretically efficient approach for face recognition based on principal component analysis (PCA) and rotation invariant uniform local binary pattern texture features in order to weaken the effects of varying illumination conditions and facial expressions. Firstly, the rotation invariant uniform LBP operator was adopted to extract the local texture feature of the face images. Then PCA method was used to reduce the dimensionality of the extracted feature and get the eigenfaces. Finally, the nearest distance classification was used to distinguish each face. The method has been accessed on Yale and ATR-Jaffe face databases. Results demonstrate that the proposed method is superior to standard PCA and its recognition rate is higher than the traditional PCA. And the proposed algorithm has strong robustness against the illumination changes, pose, rotation and expressions.

2018 ◽  
Vol 2018 ◽  
pp. 1-9 ◽  
Author(s):  
Kun Sun ◽  
Xin Yin ◽  
Mingxin Yang ◽  
Yang Wang ◽  
Jianying Fan

At present, the face recognition method based on deep belief network (DBN) has advantages of automatically learning the abstract information of face images and being affected slightly by active factors, so it becomes the main method in the face recognition area. Because DBN ignores the local information of face images, the face recognition rate based on DBN is badly affected. To solve this problem, a face recognition method based on center-symmetric local binary pattern (CS-LBP) and DBN (FRMCD) is proposed in this paper. Firstly, the face image is divided into several subblocks. Secondly, CS-LBP is used to extract texture features of each image subblock. Thirdly, texture feature histograms are formed and input into the DBN visual layer. Finally, face classification and face recognition are completed through deep learning in DBN. Through the experiments on face databases ORL, Extend Yale B, and CMU-PIE by the proposed method (FRMCD), the best partitioning way of the face image and the hidden unit number of the DBN hidden layer are obtained. Then, comparative experiments between the FRMCD and traditional methods are performed. The results show that the recognition rate of FRMCD is superior to those of traditional methods; the highest recognition rate is up to 98.82%. When the number of training samples is less, the FRMCD has more significant advantages. Compared with the method based on local binary pattern (LBP) and DBN, the time-consuming of FRMCD is shorter.


2010 ◽  
Vol 40-41 ◽  
pp. 523-530 ◽  
Author(s):  
Dong Cheng Shi ◽  
Qing Qing Wang

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.


2017 ◽  
Vol 2017 ◽  
pp. 1-9 ◽  
Author(s):  
Tai-Xiang Jiang ◽  
Ting-Zhu Huang ◽  
Xi-Le Zhao ◽  
Tian-Hui Ma

We have proposed a patch-based principal component analysis (PCA) method to deal with face recognition. Many PCA-based methods for face recognition utilize the correlation between pixels, columns, or rows. But the local spatial information is not utilized or not fully utilized in these methods. We believe that patches are more meaningful basic units for face recognition than pixels, columns, or rows, since faces are discerned by patches containing eyes and noses. To calculate the correlation between patches, face images are divided into patches and then these patches are converted to column vectors which would be combined into a new “image matrix.” By replacing the images with the new “image matrix” in the two-dimensional PCA framework, we directly calculate the correlation of the divided patches by computing the total scatter. By optimizing the total scatter of the projected samples, we obtain the projection matrix for feature extraction. Finally, we use the nearest neighbor classifier. Extensive experiments on the ORL and FERET face database are reported to illustrate the performance of the patch-based PCA. Our method promotes the accuracy compared to one-dimensional PCA, two-dimensional PCA, and two-directional two-dimensional PCA.


Author(s):  
A. Kasthuri ◽  
A. Suruliandi ◽  
S. P. Raja

Face annotation, a modern research topic in the area of image processing, has useful real-life applications. It is a really difficult task to annotate the correct names of people to the corresponding faces because of the variations in facial appearance. Hence, there still is a need for a robust feature to improve the performance of the face annotation process. In this work, a novel approach called the Deep Gabor-Oriented Local Order Features (DGOLOF) for feature representation has been proposed, which extracts deep texture features from face images. Seven recently proposed face annotation methods are considered to evaluate the proposed deep texture feature under uncontrolled situations like occlusion, expression changes, illumination and pose variations. Experimental results on the LFW, IMFDB, Yahoo and PubFig databases show that the proposed deep texture feature provides efficient results with the Name Semantic Network (NSN)-based face annotation. Moreover, it is observed that the proposed deep texture feature improves the performance of face annotation, regardless of all the challenges involved.


2013 ◽  
Vol 278-280 ◽  
pp. 1211-1214
Author(s):  
Jun Ying Zeng ◽  
Jun Ying Gan ◽  
Yi Kui Zhai

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.


2021 ◽  
Vol 2021 ◽  
pp. 1-12
Author(s):  
Zhixue Liang

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.


Author(s):  
Liping Zhou ◽  
Mingwei Gao ◽  
Chun He

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.


2017 ◽  
Vol 14 (1) ◽  
pp. 829-834 ◽  
Author(s):  
Chunwei Tian ◽  
Qi Zhang ◽  
Jian Zhang ◽  
Guanglu Sun ◽  
Yuan Sun

The two-dimensional principal component analysis (2D-PCA) method has been widely applied in fields of image classification, computer vision, signal processing and pattern recognition. The 2D-PCA algorithm also has a satisfactory performance in both theoretical research and real-world applications. It not only retains main information of the original face images, but also decreases the dimension of original face images. In this paper, we integrate the 2D-PCA and spare representation classification (SRC) method to distinguish face images, which has great performance in face recognition. The novel representation of original face image obtained using 2D-PCA is complementary with original face image, so that the fusion of them can obviously improve the accuracy of face recognition. This is also attributed to the fact the features obtained using 2D-PCA are usually more robust than original face image matrices. The experiments of face recognition demonstrate that the combination of original face images and new representations of the original face images is more effective than the only original images. Especially, the simultaneous use of the 2D-PCA method and sparse representation can extremely improve accuracy in image classification. In this paper, the adaptive weighted fusion scheme automatically obtains optimal weights and it has no any parameter. The proposed method is not only simple and easy to achieve, but also obtains high accuracy in face recognition.


2010 ◽  
Vol 4 (1) ◽  
pp. 58-62
Author(s):  
Santosh S Saraf ◽  
Gururaj R Udupi ◽  
Santosh D Hajare

Face recognition technology has evolved over years with the Principal Component Analysis (PCA) method being the benchmark for recognition efficiency. The face recognition techniques take care of variation of illumination, pose and other features of the face in the image. We envisage an application of these face recognition techniques for classification of medical images. The motivating factor being, given a condition of an organ it is represented by some typical features. In this paper we report the use of the face recognition techniques to classify the type of Esophagitis, a condition of inflammation of the esophagus. The image of the esophagus is captured in the process of endoscopy. We test PCA, Fisher Face method and Independent Component Analysis techniques to classify the images of the esophagus. Esophagitis is classified into four categories. The results of classification for each method are reported and the results are compared.


Author(s):  
Seyed Omid Shahdi ◽  
S. A. R. Abu-Bakar

At present, frontal or even near frontal face recognition problem is no longer considered as a challenge. Recently, the shift has been to improve the recognition rate for the nonfrontal face. In this work, a neural network paradigm based on the radial basis function approach is proposed to tackle the challenge of recognizing faces in different poses. Exploiting the symmetrical properties of human face, our work takes the advantage of the existence of even half of the face. The strategy is to maximize the linearity relationship based on the local information of the face rather than on the global information. To establish the relationship, our proposed method employs discrete wavelet transform and multi-color uniform local binary pattern (ULBP) in order to obtain features for the local information. The local information will then be represented by a single vector known as the face feature vector. This face feature vector will be used to estimate the frontal face feature vector which will be used for matching with the actual vector. With such an approach, our proposed method relies on a database that contains only single frontal face images. The results shown in this paper demonstrate the robustness of our proposed method even at low-resolution conditions.


Sign in / Sign up

Export Citation Format

Share Document