Feature Extraction For Face Recognition Research Articles

TIFd-FR: Trends, Issues and Future directions of feature extraction in Face Recognition

Today, face recognition is the most prevalent and effective mechanism among various biometric technologies as it is non-invasive method. It helps in identifying or verifying the identity of a person by utilizing its face. But face recognition (FR) can be prone to high error rate. Therefore, efficient feature extraction methods are required for extracting robust facial features to develop efficient FR system. A FR system comprises of mainly three phases, that is, face detection and orientation, extracting facial features and classification of features. The most vital part of an efficient recognition system is extraction of robust features. Hence, extracting facial features is active research area of image processing. Although algorithms have been developed for extracting features, efficient and robust feature extraction still offers great challenge to researchers. Hence, a thorough analysis of feature extraction techniques presented in this work will enable the researchers to select the best suited technique for developing efficient system for recognition of face images. The performance of different feature extraction methods varies under variations in illumination, occlusion and pose etc. It is observed that deep-learning based feature extraction methods outperform wavelet-based methods. After rigorous analysis of various state-of-art techniques it is found that highest accuracy rate of 99.5% is achieved on AR database using wavelet based feature extraction whereas 99.78% is attained using convolutional neural network accuracy and various results achieved till now are stated.

Reweighted robust and discriminative latent subspace projection for face recognition

Subspace projection has been widely studied to implement the feature extraction for face recognition. However, it scarcely facilitates exploring the label information in the subspace projection procedure. The feature extraction and classification are usually divided into two separate procedures. This fails to explore the discriminative information from the training data, and thus degrades the discrimination of the extracted features and lowers the face recognition accuracy. To address this issue, we present a novel reweighted robust and discriminative latent subspace projection (ReRDLSP) method which organically integrates the reweighted latent low-rank representation model and discriminative ridge regression into a union framework. We employ a reweighted nuclear norm minimization to realize the low-rank regularization, which provides adaptive weighted values assignment, regularizes the representation matrix adaptively, and thus boosts the capability and flexibility of the method. Moreover, a discriminative ridge regression method is presented by employing a nonnegative relaxation, which enlarges the margins of the face samples from different classes as much as possible and boosts the freedom of fitting the label information. The computational complexity and convergence analysis are also discussed in detail. Extensive experiments are demonstrated and very promising results are achieved compared with some state-of-the-art face recognition methods.

Performance Evaluation of Face Recognition Model in Deep Learning using Old Facial Photos: A Mathematical Modelling Using SVM Supervised Learning

Deep Learning has been a remarkable state-of-the-art method in any classification challenge, particularly in face recognition applications. In this paper, Feature Extraction in face recognition using Deep CNNs handpicked pre-trained CNN architectures such as InceptionV3, MobileNetV2, ResNet50, and VGG19 were experimentally explored. Initially, these architectures extracted important features from eight (8) classes of face photos with large age differences of ten (10) years from the present age of an individual. The features were processed with the application of a Support Vector Machine (SVM) classifier to enhance its performance. The evaluation of each model was based on average scores ofaccuracy, precision, recall, and f1-score. The results concluded an accuracy of 84.60%, a weighted precision of 85%, a weighted recall of 84.60%, and a weighted f1-score of 84.60% obtained by ResNet50.Further, ResNet50 has the highest obtained 98% generated ROC-AUC score. With the results presented, ResNet50 isrecommended for application development related to face recognition with the consideration of large age gaps of 10 years.

Empirical mode decomposition and local binary pattern based feature extraction for face recognition

ABSTRACT Facial recognition is a challenging pattern recognition problem in computer vision. This paper proposes a face recognition system that uses Empirical Mode Decomposition (EMD) and Local Binary Pattern (LBP) based feature extraction for a robust face recognition system. This scheme initially decomposes the image into 2N number of IMF (Intrinsic Mode Function) images, where N numbers of IMF images are estimated in the X direction and N number of IMF images are estimated in the Y direction. From the 2N number of IMFs, the M number of best matching IMF image pairs is estimated using 2D Discrete Fourier Transform (DFT). The IMF pair is added to extract the IC-LBP (Intensity Compensated-Local Binary Pattern) features. The IC-LBP features are extracted from the IMF images such that the center intensity is adjusted based on an adaptive intensity threshold. The use of EMD and IC-LBP features uses the essential descriptors that best represent a facial image. The same process is repeated in the testing phase where the test image is categorized from the trained images using the Naïve Bayes algorithm. The performance evaluation was done using the Yale, MORPH, and FGNET using metrics such as time complexity and recognition rate on different types of test face images like partial faces, different lightning, and rotation. Results show that the proposed face recognition system outperforms the traditional algorithms. Results show that the proposed face recognition system outperforms the traditional algorithms.

Empirical Mode Decomposition and Local Binary Pattern Based Feature Extraction for Face Recognition

Empirical Mode Decomposition and Local Binary Pattern Based Feature Extraction for Face Recognition

Generalized DCT and DWT hybridization based robust feature extraction for face recognition

Pose, expression and light variations are the major complications in recognition of face images. Hence, a robust technique is introduced in this paper which deals with variations in light in the face images. Hybridization of fractional discrete Cosine transform (FrDCT) and DWT are utilized as the feature extraction technique which helps in normalizing the light variations in the face images. DWT helps in obtaining the global behaviour of the light compensated face image. Also, use of DWT with FrDCT helps in obtaining the redundancy which is difficult to obtain with FrDCT alone. Therefore, it is obtained with DWT and after that, FrDCT is exploited for the local correlation. The proposed method is experimented and investigated on YALE, Yale B and CMU PIE face databases and very good performance outcome has been achieved as compared to the other state of art methods.

An Effective Feature Descriptor with Gabor Filter and Uniform Local Binary Pattern Transcoding for Iris Recognition

Iris recognition is recognized as one of the most reliable and efficient technique for human identification in the biometric fields. The Gabor filter and local binary pattern (LBP) are widely adopted for feature extraction in face recognition. However, it is difficult to achieve high recognition accuracy when the Gabor filter or LBP is directly applied to iris texture representation. This paper presents an effective iris feature descriptor, which first uses 2D-Gabor filter to extract multi-orientation imaginary (MOI) feature, and then applies uniform LBP for region feature encoding. Thus, the MOI feature-by-point energy is converted into that of the uniform LBP histogram-by-block, during which the distributions of the intra- and inter-class are greatly widened. Such process largely improves distinguishability of MOI features. Finally, the Bhattacharyya distance is adopted for matching. Experimental results on CASIA and JLU iris image databases show that this method performs better for combining MOI features and LBP encoding as compared to their individual function.

Comparative Analysis of Illumination Normalizations on Principal Component Analysis Based Feature Extraction for Face Recognition

Principle Component Analysis (PCA) is an appearance-based technique for extraction of feature extraction that is commonly used in computer vision and image processing. This technique suffers from illumination variations, thus knowing which illumination control method to be used in PCA-based face recognition system is very important. This paper applies three selected normalization techniques; Discrete Cosine Transform (DCT), Adaptive Histogram Equalization (AHE) and Contrast Limited Adaptive Histogram Equalization (CLAHE) to normalize face images. PCA was further used to extract features from the normalized face images. Euclidean distance was used to classify extracted features. The best recognition accuracy of 91.84% was obtained in DCT for ORL Database, while the best accuracy of 76% was achieved in DCT for FERET Database. The highest FAR of 0.9 was achieved in DCT for ORL Database, while the highest FAR of 0.5 was obtained in DCT and AHE for FERET Database. The highest FRR of 0.2821 was achieved in CLAHE for ORL Database, while 0.3000 was obtained in AHE for FERET Database. It was concluded that illumination control approaches have predominant effect on PCA–based facial recognition system. Keywords— Adaptive Histogram Equalization, Contrast Adaptive Histogram Equalization, Discrete Cosine Transform Illumination Normalization, Principal Component Analysis

A robust multi-level sparse classifier with multi-modal feature extraction for face recognition

In the past few years, face recognition based on sparse representation is providing satisfactory classification accuracy. Face images involved in real life applications usually exhibit considerable pose, lighting, and expression variations, resulting in significant performance degradation of traditional sparse-based algorithms. In this paper, a novel face recognition method is developed as multi-level sparse (MLS) classifier with multi-modal feature extraction, which integrates benefits of sparse representation manifolds. In MLS classifier, sparse representation-based classification is performed at multiple levels to extract the hierarchical relationship information between training and testing images, which not only improves classification accuracy but also makes the system scalable. Also, the use of multi-modal feature in MLS classifier makes it discriminative to face changes while robust to intra-personal variations. To highlight the competency of proposed method, results are compared with sparse representation and other existing state-of-art methods in terms of mean classification error. An investigation on classification accuracy is performed to showcase the reliability of proposed method.

A robust multi-level sparse classifier with multi-modal feature extraction for face recognition

A robust multi-level sparse classifier with multi-modal feature extraction for face recognition

Optimized regularized linear discriminant analysis for feature extraction in face recognition

In a reduced dimensional space, linear discriminant analysis looks for a projective transformation that can maximizes separability among classes. Since linear discriminant analysis demands the within-class scatter matrix appear to non-singular, which cannot directly used in condition of small sample size (SSS) issues in which the dimension of image is much higher, while the number of samples isn’t unlimited. Both the between-class and within-class scatter matrices are always exceedingly ill-posed in SSS problems. And many algorithms are suffered from small sample size issues still. To solve SSS problems, many methods including regularized linear discriminant analysis were proposed. In this article, a way was presented by optimized regularized linear discriminant analysis for feature extraction in FR which can not only fix the singularity problem existing in scatter matrix but also the problem of parameter estimation. The experiment is conducted on several databases and promising results are obtained compared to some state-of-the-art methods to demonstrate the effectiveness of the proposed approach.

Face Recognition Based on Rearranged Modular Two-Dimensional Locality Preserving Projection

This paper proposes a novel algorithm for feature extraction for face recognition, namely the rearranged modular two-dimensional locality preserving projection (Rm2DLPP). In the proposed algorithm, the original images are first divided into modular blocks, then the subblocks are rearranged to form two-dimensional matrices and finally the two-dimensional locality preserving projection algorithm is applied directly on the arranged matrices. The advantage of the Rm2DLPP algorithm is that it can utilize the local block features and global spatial structures of 2D face images simultaneously. The performance of the proposed method is evaluated and compared with other face recognition methods on the ORL, AR and FERET databases. The experimental results demonstrate the effectiveness and superiority of the proposed approach.

Feature extraction for face recognition via Active Shape Model (ASM) and Active Appearance Model (AAM)

Biometric is a pattern recognition system which is used for automatic recognition of persons based on characteristics and features of an individual. Face recognition with high recognition rate is still a challenging task and usually accomplished in three phases consisting of face detection, feature extraction, and expression classification. Precise and strong location of trait point is a complicated and difficult issue in face recognition. Cootes proposed a Multi Resolution Active Shape Models (ASM) algorithm, which could extract specified shape accurately and efficiently. Furthermore, as the improvement of ASM, Active Appearance Models algorithm (AAM) is proposed to extracts both shape and texture of specified object simultaneously. In this paper we give more details about the two algorithms and give the results of experiments, testing their performance on one dataset of faces. We found that the ASM is faster and gains more accurate trait point location than the AAM, but the AAM gains a better match to the texture.

BULDP: Biomimetic Uncorrelated Locality Discriminant Projection for Feature Extraction in Face Recognition.

This paper develops a new dimensionality reduction method, named Biomimetic Uncorrelated Locality Discriminant Projection (BULDP), for face recognition. It is based on unsupervised discriminant projection and two human bionic characteristics: principle of homology continuity and principle of heterogeneous similarity. With these two human bionic characteristics, we propose a novel adjacency coefficient representation, which does not only capture the category information between different samples, but also reflects the continuity between similar samples and the similarity between different samples. By applying this new adjacency coefficient into the unsupervised discriminant projection, it can be shown that we can transform the original data space into an uncorrelated discriminant subspace. A detailed solution of the proposed BULDP is given based on singular value decomposition. Moreover, we also develop a nonlinear version of our BULDP using kernel functions for nonlinear dimensionality reduction. The performance of the proposed algorithms is evaluated and compared with the state-of-the-art methods on four public benchmarks for face recognition. Experimental results show that the proposed BULDP method and its nonlinear version achieve much competitive recognition performance.

Example image-based feature extraction for face recognition

This paper proposes a novel method for recognizing facial images based on the relative distances between an input image and example images. Example facial images can be easily collected online, and a large example database can span new possible facial variations not sufficiently learned during the learning phase. We first extract facial features using a baseline classifier that has a certain degree of accuracy. To achieve a better performance of the proposed method, we divide the collected examples into groups using a clustering method (e.g., k-means), where each clustered group contains examples with similar characteristics. We then hierarchically partition a group formed in the previous level into other groups to analyze more specific facial characteristics, which represent an example pyramid. To describe the characteristics of a group using the clustered examples, we divide the example group into a number of sub-groups. We calculate the averages of the sub-groups and select an example most similar to the average in each sub-group because we assume that the averages of the sub-groups can directly represent their characteristics. Using the selected examples, we build example code words for a novel feature extraction. The example code words are used to measure the distances to an input image and serve as anchors to analyze a facial image in the example domain. The distance values are normalized for each group at all pyramid levels, and are concatenated to form novel features for face recognition. We verified the effectiveness of the proposed example pyramid framework using well-known proposed features, including LBP, HOG, Gabor, and the deep learning method, on the LFW database, and showed that it can yield significant improvements in recognition performance.

Face Identification and Verification using Hidden Markov Model with Maximum Score Approach

Objectives/Background: To analyse image using highest score estimation which will help to identify the accuracy in term of recognition rate with different likelihood. Methods/Statistical Analysis: To perform the accuracy measurement, first we initialize the HMM to find out the uniform segmentation and then extracting the feature of image by parameter initialization and subsequently train the feature image using Viterbi algorithm. Further, input image is converted into super and embedded state and transformation matrix is evaluated using maximum score estimation for each face. After that we check for maximum score HMM parameters if found ‘YES’ or go for some new feature extraction if found ‘NO’ condition. Findings: In this paper we try to find out the rate of recognition for different approaches using different class and compare it to achieve the best classification performance with twenty five facial images. Maximum score approach has been widely reported in many literature but only for the verification purpose. But, here we try to interpret the highest level of maximum score HMM by considering different class of feature of face which will also be used for identification and verification application. We also try to highlight that this algorithm brings highest process of recognition rate with massive proficiency to deal with new data and that makes it unique from other approach. Novelty/Improvement: This paper chooses discriminative feature extraction for face recognition. An experimental result concluded significant changes in term of improvement with respect to other existing conventional HMM based recognition and reflects better accuracy and efficient capability using proposed approaches. Applications: The application domain in face recognition includes surveillance, biometric, home appliances because of its richness. It is also used for access control like PC face based login, PC cameras beyond the password and physical security. Keywords: Discriminative Feature Extraction, Face Identification, Face Verification, Pattern Recognition, HMM

Discriminative multi-layer illumination-robust feature extraction for face recognition

Tackling illumination variation is a major problem and it is also an important challenge for practical face recognition systems. Some related methods consider that lighting intensity components mainly lie in large-scale features, and they use a lot of image decomposition techniques to extract the small-scale illumination-invariant features and remove the large-scale features from original face images. However, it argues that the large-scale features contain a lot useful information which can be further extracted, and the small-scale illumination-invariant features are not robust enough due to they contain some detrimental features (noise, etc.). In this paper, we propose a discriminative multi-layer illumination-robust feature extraction (DMI) model to address this problem. First, we decompose the large-scale features into multi-layer small-scale illumination-robust features as a linear combination, and then a weight is assigned to each layer to adjust its importance and influence. The idea is to take full advantage of these useful information in large-scale features for face recognition. Second, we learn a discriminant filter to improve the robustness and statistical discriminative ability of the reconstructed illumination-robust face for face recognition under poor lighting conditions. Extensive experiments on three benchmark face databases and a video image database show that DMI performs better than the related methods, especially in difficult lighting conditions.

Learning compact feature descriptor and adaptive matching framework for face recognition.

Dense feature extraction is becoming increasingly popular in face recognition tasks. Systems based on this approach have demonstrated impressive performance in a range of challenging scenarios. However, improvements in discriminative power come at a computational cost and with a risk of over-fitting. In this paper, we propose a new approach to dense feature extraction for face recognition, which consists of two steps. First, an encoding scheme is devised that compresses high-dimensional dense features into a compact representation by maximizing the intrauser correlation. Second, we develop an adaptive feature matching algorithm for effective classification. This matching method, in contrast to the previous methods, constructs and chooses a small subset of training samples for adaptive matching, resulting in further performance gains. Experiments using several challenging face databases, including labeled Faces in the Wild data set, Morph Album 2, CUHK optical-infrared, and FERET, demonstrate that the proposed approach consistently outperforms the current state of the art.

Local Spectrum Feature Extraction for Face Recognition

Authors : Muhammad Imran Ahmad, Ruzelita Ngadiran, Mohd Nazrin Md Isa, Nor Ashidi Mat Isa, Mohd ZaizuIlyas, Raja Abdullah Raja Ahmad, Said Amirul Anwar Ab Hamid, Muzammil Jusoh Abstract : This paper presents two technique, local feature extraction using image spectrum and low frequency spectrum modelling using GMM to capture the underlying statistical information to improve the performance of face recognition system. Local spectrum features are extracted using overlap sub block window that are mapping on the face image. For each of this block, spatial domain is transformed to frequency domain using DFT. A low frequency coefficient is preserved by discarding high frequency coefficients by applying rectangular mask on the spectrum of the facial image. Low frequency information is non Gaussian in the feature space and by using combination of several Gaussian function that has different statistical properties, the best feature representation can be model using probability density function. The recognition process is performed using maximum likelihood value computed using pre-calculate GMM components. The method is tested using FERET data sets and is able to achieved 92% recognition rates.

A Quadratic Lagrange Multipliers Based Approach to Feature Extraction in Face Recognition

Fisher Linear Discriminant Analysis (LDA) has been widely used for feature extraction in face recognition. However, it cannot be used when each object has only one training sample because, within-class scatters cannot be statistically measured in this case. In addition, the respective axes of the projection matrix are not necessarily orthogonal in the strict sense. In this paper, a new method is proposed to solve those problems by quadratic Lagrange multipliers fisher linear discriminant analysis, which could not only eliminate the singular problem, but also obtain the optimal orthogonal projection matrix. The proposed approach is compared to the 2D-LDA method on the well-known ORL, CMU and YALE B+Extend YALE B face databases. It shows that the proposed method achieves better recognition accuracy and faster computational speed than 2D-LDA method does, especially in solving the matrix singular problem with only one training sample.