Low-Resolution Face Recognition of Multi-Scale Blocking CS-LBP and Weighted PCA

2016 ◽  
Vol 30 (08) ◽  
pp. 1656005 ◽  
Author(s):  
Jiadi Li ◽  
Zhenxue Chen ◽  
Chengyun Liu
Keyword(s):  
Face Recognition ◽  
Local Binary Pattern ◽  
Recognition Accuracy ◽  
Recognition Rate ◽  
Principal Component ◽  
Low Resolution ◽  
Multi Scale ◽  
Face Features ◽  
Weighted Principal Component ◽  
Pca Algorithm

A novel method is proposed in this paper to improve the recognition accuracy of Local Binary Pattern (LBP) on low-resolution face recognition. More precise descriptors and effectively face features can be extracted by combining multi-scale blocking center symmetric local binary pattern (CS-LBP) based on Gaussian pyramids and weighted principal component analysis (PCA) on low-resolution condition. Firstly, the features statistical histograms of face images are calculated by multi-scale blocking CS-LBP operator. Secondly, the stronger classification and lower dimension features can be got by applying weighted PCA algorithm. Finally, the different classifiers are used to select the optimal classification categories of low-resolution face set and calculate the recognition rate. The results in the ORL human face databases show that recognition rate can get 89.38% when the resolution of face image drops to 12[Formula: see text]10 pixel and basically satisfy the practical requirements of recognition. The further comparison of other descriptors and experiments from videos proved that the novel algorithm can improve recognition accuracy.

Robust face recognition based on a new Kernel-PCA using RRQR factorization

2021 ◽  
Vol 25 (5) ◽  
pp. 1233-1245
Author(s):  
Ayyad Maafiri ◽  
Khalid Chougdali
Keyword(s):  
Face Recognition ◽  
Recognition Accuracy ◽  
Recognition Rate ◽  
Principal Component ◽  
Qr Factorization ◽  
Lp Norm ◽  
Rank Revealing ◽  
Robust Face Recognition ◽  
Value Decomposition ◽  
Pca Algorithm

In the last ten years, many variants of the principal component analysis were suggested to fight against the curse of dimensionality. Recently, A. Sharma et al. have proposed a stable numerical algorithm based on Householder QR decomposition (HQR) called QR PCA. This approach improves the performance of the PCA algorithm via a singular value decomposition (SVD) in terms of computation complexity. In this paper, we propose a new algorithm called RRQR PCA in order to enhance the QR PCA performance by exploiting the Rank-Revealing QR Factorization (RRQR). We have also improved the recognition rate of RRQR PCA by developing a nonlinear extension of RRQR PCA. In addition, a new robust RBF Lp-norm kernel is proposed in order to reduce the effect of outliers and noises. Extensive experiments on two well-known standard face databases which are ORL and FERET prove that the proposed algorithm is more robust than conventional PCA, 2DPCA, PCA-L1, WTPCA-L1, LDA, and 2DLDA in terms of face recognition accuracy.

Research of Face Recognition Methods Based on Binding Feature Extraction

2014 ◽  
Vol 568-570 ◽  
pp. 668-671
Author(s):  
Yi Long ◽  
Fu Rong Liu ◽  
Guo Qing Qiu
Keyword(s):  
Feature Extraction ◽  
Face Recognition ◽  
Extraction Method ◽  
Local Binary Pattern ◽  
Feature Vector ◽  
Recognition Rate ◽  
Principal Component ◽  
Face Image ◽  
Feature Extraction Method ◽  
Histogram Feature

To address the problem that the dimension of the feature vector extracted by Local Binary Pattern (LBP) for face recognition is too high and Principal Component Analysis (PCA) extract features are not the best classification features, an efficient feature extraction method using LBP, PCA and Maximum scatter difference (MSD) has been introduced in this paper. The original face image is firstly divided into sub-images, then the LBP operator is applied to extract the histogram feature. and the feature dimensions are further reduced by using PCA. Finally,MSD is performed on the reduced PCA-based feature.The experimental results on ORL and Yale database demonstrate that the proposed method can classify more effectively and can get higher recognition rate than the traditional recognition methods.

scholarly journals Normalization of Facial Occlusion in Face Recognition

2019 ◽  
Vol 8 (11) ◽  
pp. 2523-2527
Keyword(s):  
Principal Component Analysis ◽  
Face Recognition ◽  
Face Detection ◽  
Error Rate ◽  
Recognition Accuracy ◽  
Recognition Rate ◽  
Principal Component ◽  
Normalization Method ◽  
Analysis Algorithm ◽  
Principal Component Analysis Algorithm

Face recognition accuracy is determined by face detection results. Detected faces will be in view of clear and occlusion faces. If detected face has occlusion than recognition accuracy is reduced. This research is directed to increase recognition rate when detected occlusion face. In this paper is proposed normalization occlusion faces by Principal component analysis algorithm. After applying normalization method in occlusion faces false reject error rate is decreased.

scholarly journals Research on Face Recognition Based on Embedded System

2013 ◽  
Vol 2013 ◽  
pp. 1-6 ◽  
Author(s):  
Hong Zhao ◽  
Xi-Jun Liang ◽  
Peng Yang
Keyword(s):  
Face Recognition ◽  
Embedded System ◽  
High Performance ◽  
Recognition Rate ◽  
Principal Component ◽  
Image Feature ◽  
Stable Operation ◽  
Embedded Platform ◽  
Face Features ◽  
The Face

Because a number of image feature data to store, complex calculation to execute during the face recognition, therefore the face recognition process was realized only by PCs with high performance. In this paper, the OpenCV facial Haar-like features were used to identify face region; the Principal Component Analysis (PCA) was employed in quick extraction of face features and the Euclidean Distance was also adopted in face recognition; as thus, data amount and computational complexity would be reduced effectively in face recognition, and the face recognition could be carried out on embedded platform. Finally, based on Tiny6410 embedded platform, a set of embedded face recognition systems was constructed. The test results showed that the system has stable operation and high recognition rate can be used in portable and mobile identification and authentication.

scholarly journals Parameters Optimization and Application of SVM Based on PCA-Particle Swarm Algorithm

2019 ◽  
pp. 325-330 ◽  
Author(s):  
Qingmi Yang
Keyword(s):  
Parameter Optimization ◽  
Recognition Accuracy ◽  
Recognition Rate ◽  
Particle Swarm ◽  
Optimal Solution ◽  
Principal Component ◽  
Pso Algorithm ◽  
Parameters Optimization ◽  
Support Vector ◽  
Particle Swarm Algorithm

The parameter optimization of Support Vector Machine (SVM) has been a hot research direction. To improve the optimization rate and classification performance of SVM, the Principal Component Analysis (PCA) - Particle Swarm Optimization (PSO) algorithm was used to optimize the penalty parameters and kernel parameters of SVM. PSO which is to find the optimal solution through continuous iteration combined with PCA that eliminates linear redundancy between data, effectively enhance the generalization ability of the model, reduce the optimization time of parameters, and improve the recognition accuracy. The simulation comparison experiments on 6 UCI datasets illustrate that the excellent performance of the PCA-PSO-SVM model. The results show that the proposed algorithm has higher recognition accuracy and better recognition rate than simple PSO algorithm in the parameter optimization of SVM. It is an effective parameter optimization method.

scholarly journals Shuffle block SRGAN for face image super-resolution reconstruction

2020 ◽  
Vol 53 (7-8) ◽  
pp. 1429-1439
Author(s):  
Ziwei Zhang ◽  
Yangjing Shi ◽  
Xiaoshi Zhou ◽  
Hongfei Kan ◽  
Juan Wen
Keyword(s):  
Face Recognition ◽  
Learning Strategy ◽  
Signal To Noise Ratio ◽  
Similarity Index ◽  
Super Resolution ◽  
Face Image ◽  
Low Resolution ◽  
Index Method ◽  
Face Features ◽  
Image Super Resolution

When low-resolution face images are used for face recognition, the model accuracy is substantially decreased. How to recover high-resolution face features from low-resolution images precisely and efficiently is an essential subtask in face recognition. In this study, we introduce shuffle block SRGAN, a new image super-resolution network inspired by the SRGAN structure. By replacing the residual blocks with shuffle blocks, we can achieve efficient super-resolution reconstruction. Furthermore, by considering the generated image quality in the loss function, we can obtain more realistic super-resolution images. We train and test SB-SRGAN in three public face image datasets and use transfer learning strategy during the training process. The experimental results show that shuffle block SRGAN can achieve desirable image super-resolution performance with respect to visual effect as well as the peak signal-to-noise ratio and structure similarity index method metrics, compared with the performance attained by the other chosen deep-leaning models.

A Hybrid Approach for Facial Expression Recognition Using Extended Local Binary Patterns and Principal Component Analysis

2019 ◽  
Vol 8 (2) ◽  
pp. 1-25
Author(s):  
Gopal Krishan Prajapat ◽  
Rakesh Kumar
Keyword(s):  
Principal Component Analysis ◽  
Feature Extraction ◽  
Facial Expression ◽  
Facial Expression Recognition ◽  
Local Binary Pattern ◽  
Recognition Rate ◽  
Principal Component ◽  
Component Analysis ◽  
Expression Recognition ◽  
Distance Method

Facial feature extraction and recognition plays a prominent role in human non-verbal interaction and it is one of the crucial factors among pose, speech, facial expression, behaviour and actions which are used in conveying information about the intentions and emotions of a human being. In this article an extended local binary pattern is used for the feature extraction process and a principal component analysis (PCA) is used for dimensionality reduction. The projections of the sample and model images are calculated and compared by Euclidean distance method. The combination of extended local binary pattern and PCA (ELBP+PCA) improves the accuracy of the recognition rate and also diminishes the evaluation complexity. The evaluation of proposed facial expression recognition approach will focus on the performance of the recognition rate. A series of tests are performed for the validation of algorithms and to compare the accuracy of the methods on the JAFFE, Extended Cohn-Kanade images database.

Adaptive GLOH with PSO-trained NN for the recognition of plastic surgery faces and their types

2019 ◽  
Vol 15 (1) ◽  
Author(s):  
Archana Harsing Sable ◽  
Sanjay N. Talbar
Keyword(s):  
Neural Network ◽  
Face Recognition ◽  
Plastic Surgery ◽  
Local Binary Pattern ◽  
Principal Component ◽  
Traditional Learning ◽  
Swarm Optimization ◽  
The Neural Network ◽  
Orientation Histogram ◽  
The Face

Abstract Numerous algorithms have met complexity in recognizing the face, which is invariant to plastic surgery, owing to the texture variations in the skin. Though plastic surgery serves to be a challenging issue in the domain of face recognition, the concerned theme has to be restudied for its hypothetical and experimental perspectives. In this paper, Adaptive Gradient Location and Orientation Histogram (AGLOH)-based feature extraction is proposed to accomplish effective plastic surgery face recognition. The proposed features are extracted from the granular space of the faces. Additionally, the variants of the local binary pattern are also extracted to accompany the AGLOH features. Subsequently, the feature dimensionality is reduced using principal component analysis (PCA) to train the artificial neural network. The paper trains the neural network using particle swarm optimization, despite utilizing the traditional learning algorithms. The experimentation involved 452 plastic surgery faces from blepharoplasty, brow lift, liposhaving, malar augmentation, mentoplasty, otoplasty, rhinoplasty, rhytidectomy and skin peeling. Finally, the proposed AGLOH proves its performance dominance.

Sign in / Sign up

Export Citation Format

Share Document