PERFORMANCE ANALYSIS OF FACE RECOGNITION ALGORITHMS ON KOREAN FACE DATABASE

2007 ◽  
Vol 21 (06) ◽  
pp. 1017-1033 ◽  
Author(s):  
MYUNG-CHEOL ROH ◽  
SEONG-WHAN LEE
Keyword(s):  
Face Recognition ◽  
Recognition Rate ◽  
Principal Component ◽  
Ground Truth ◽  
Facial Feature ◽  
Recognition Algorithm ◽  
Video Data ◽  
Face Database ◽  
Recognition Algorithms ◽  
Different Characteristics

Human face is one of the most common and useful keys to a person's identity. Although, a number of face recognition algorithms have been proposed, many researchers believe that the technology should be improved further in order to overcome the instability caused by variable illuminations, expressions, poses and accessories. To analyze these face recognition algorithm, it is indispensable to collect various data as much as possible. Face databases such as CMU PIE (USA), FERET (USA), AR Face DB (USA) and XM2VTS (UK) are the representative ones commonly used. However, many databases do not provide adequately annotated information of the pose angle, illumination angle, illumination color and ground-truth. Mostly, they do not include large enough number of images and video data taken under various environments. Furthermore, the faces on these databases have different characteristics from those of Asian. Thus, we have designed and constructed a Korean Face Database (KFDB) which includes not only images but also video clips, ground-truth information of facial feature points and descriptions of subjects and environment conditions so that it can be used for general purposes. In this paper, we present the KFDB which contains image and video data for 1920 subjects and has been constructed in 3 years (sessions). We also present recognition results by CM (Correlation Matching) and PCA (Principal Component Analysis) which are used as baseline algorithms upon CMU PIE and KFDB, so as to understand how recognition rate is changed by altering image taking conditions.

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.

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.

scholarly journals An Improved Face Recognition Using Neighborhood Defined Modular Phase Congruency Based Kernel PCA

2012 ◽  
pp. 288-296
Author(s):  
M.Lokeswara Reddy ◽  
P.Ramana Reddy
Keyword(s):  
Face Recognition ◽  
Recognition Rate ◽  
Principal Component ◽  
Visual Image ◽  
Recognition System ◽  
Recognition Algorithm ◽  
Kernel Pca ◽  
Phase Congruency ◽  
Face Images ◽  
Facial Recognition System

A face recognition algorithm based on NMPKPCA algorithm presented in this paper. The proposed algorithm when compared with conventional Principal component analysis (PCA) algorithms has an improved recognition Rate for face images with large variations in illumination, facial expressions. In this technique, first phase congruency features are extracted from the face image so that effects due to illumination variations are avoided by considering phase component of image. Then, face images are divided into small sub images and the kernel PCA approach is applied to each of these sub images. but, dividing into small or large modules creates some problems in recognition. So a special modulation called neighborhood defined modularization approach presented in this paper, so that effects due to facial variations are avoided. Then, kernel PCA has been applied to each module to extract features. So a feature extraction technique for improving recognition accuracy of a visual image based facial recognition system presented in this paper.

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 HYBRID TWO-PHASE ALGORITHM FOR FACE RECOGNITION

2004 ◽  
Vol 18 (08) ◽  
pp. 1423-1435 ◽  
Author(s):  
FRANK Y. SHIH ◽  
KAI ZHANG ◽  
YAN-YU FU
Keyword(s):  
Face Recognition ◽  
Recognition Rate ◽  
Principal Component ◽  
Recognition Algorithm ◽  
Support Vector ◽  
Second Phase ◽  
Two Phase ◽  
Data Set ◽  
Linear Discriminant ◽  
Database Size

Scientists have developed numerous classifiers in the pattern recognition field, because applying a single classifier is not very conducive to achieve a high recognition rate on face databases. Problems occur when the images of the same person are classified as one class, while they are in fact different in poses, expressions, or lighting conditions. In this paper, we present a hybrid, two-phase face recognition algorithm to achieve high recognition rates on the FERET data set. The first phase is to compress the large class number database size, whereas the second phase is to perform the decision-making. We investigate a variety of combinations of the feature extraction and pattern classification methods. Principal Component Analysis (PCA), Linear Discriminant Analysis (LDA), and Support Vector Machine (SVM) are examined and tested using 700 facial images of different poses from FERET database. Experimental results show that the two combinations, LDA+LDA and LDA+SVM, outperform the other types of combinations. Meanwhile, when classifiers are considered in the two-phase face recognition, it is better to adopt the L1 distance in the first phase and the class mean in the second phase.

scholarly journals A Novel Approach of Low-Light Image Denoising for Face Recognition

2014 ◽  
Vol 6 ◽  
pp. 256790
Author(s):  
Yimei Kang ◽  
Wang Pan
Keyword(s):  
Face Recognition ◽  
Image Denoising ◽  
Recognition Rate ◽  
Low Frequency ◽  
Frequency Noise ◽  
Low Frequency Noise ◽  
Face Database ◽  
Low Light ◽  
Very Low Frequency ◽  
Light Image

Illumination variation makes automatic face recognition a challenging task, especially in low light environments. A very simple and efficient novel low-light image denoising of low frequency noise (DeLFN) is proposed. The noise frequency distribution of low-light images is presented based on massive experimental results. The low and very low frequency noise are dominant in low light conditions. DeLFN is a three-level image denoising method. The first level denoises mixed noises by histogram equalization (HE) to improve overall contrast. The second level denoises low frequency noise by logarithmic transformation (LOG) to enhance the image detail. The third level denoises residual very low frequency noise by high-pass filtering to recover more features of the true images. The PCA (Principal Component Analysis) recognition method is applied to test recognition rate of the preprocessed face images with DeLFN. DeLFN are compared with several representative illumination preprocessing methods on the Yale Face Database B, the Extended Yale face database B, and the CMU PIE face database, respectively. DeLFN not only outperformed other algorithms in improving visual quality and face recognition rate, but also is simpler and computationally efficient for real time applications.

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.

scholarly journals Research of SWNMF with New Iteration Rules for Facial Feature Extraction and Recognition

Symmetry ◽  
2019 ◽  
Vol 11 (3) ◽  
pp. 354
Author(s):  
Jing Zhou
Keyword(s):  
Feature Extraction ◽  
Matrix Factorization ◽  
Nonnegative Matrix Factorization ◽  
Recognition Rate ◽  
Nonnegative Matrix ◽  
Facial Feature ◽  
Face Database ◽  
Base Matrix ◽  
Sparse Nonnegative Matrix Factorization ◽  
Pca Method

Weighted nonnegative matrix factorization (WNMF) is a technology for feature extraction, which can extract the feature of face dataset, and then the feature can be recognized by the classifier. To improve the performance of WNMF for feature extraction, a new iteration rule is proposed in this paper. Meanwhile, the base matrix U is sparse based on the threshold, and the new method is named sparse weighted nonnegative matrix factorization (SWNMF). The new iteration rules are based on the smaller iteration steps, thus, the search is more precise, therefore, the recognition rate can be improved. In addition, the sparse method based on the threshold is adopted to update the base matrix U, which can make the extracted feature more sparse and concentrate, and then easier to recognize. The SWNMF method is applied on the ORL and JAFEE datasets, and from the experiment results we can find that the recognition rates are improved extensively based on the new iteration rules proposed in this paper. The recognition rate of new SWNMF method reached 98% for ORL face database and 100% for JAFEE face database, respectively, which are higher than the PCA method, the sparse nonnegative matrix factorization (SNMF) method, the convex non-negative matrix factorization (CNMF) method and multi-layer NMF method.

scholarly journals On the Robustness of Face Recognition Algorithms Against Attacks and Bias

2020 ◽  
Vol 34 (09) ◽  
pp. 13583-13589
Author(s):  
Richa Singh ◽  
Akshay Agarwal ◽  
Maneet Singh ◽  
Shruti Nagpal ◽  
Mayank Vatsa
Keyword(s):  
Face Recognition ◽  
Recognition Performance ◽  
Recognition Algorithm ◽  
Future Research ◽  
Research Directions ◽  
Recognition Algorithms ◽  
Future Research Directions ◽  
And Gender ◽  
Gender Variations ◽  
Very High

Face recognition algorithms have demonstrated very high recognition performance, suggesting suitability for real world applications. Despite the enhanced accuracies, robustness of these algorithms against attacks and bias has been challenged. This paper summarizes different ways in which the robustness of a face recognition algorithm is challenged, which can severely affect its intended working. Different types of attacks such as physical presentation attacks, disguise/makeup, digital adversarial attacks, and morphing/tampering using GANs have been discussed. We also present a discussion on the effect of bias on face recognition models and showcase that factors such as age and gender variations affect the performance of modern algorithms. The paper also presents the potential reasons for these challenges and some of the future research directions for increasing the robustness of face recognition models.

Sign in / Sign up

Export Citation Format

Share Document