scholarly journals A New Local Descriptor Based on Strings for Face Recognition

2020 ◽  
Vol 2020 ◽  
pp. 1-10 ◽  
Author(s):  
Hicham Zaaraoui ◽  
Abderrahim Saaidi ◽  
Rachid El Alami ◽  
Mustapha Abarkan
Keyword(s):  
Face Recognition ◽  
Nearest Neighbor ◽  
Recognition Rate ◽  
Levenshtein Distance ◽  
Local Descriptor ◽  
Chain Code ◽  
Visual Words ◽  
The Face ◽  
Face Descriptor ◽  
Neighbor Classifier

This paper proposes the use of strings as a new local descriptor for face recognition. The face image is first divided into nonoverlapping subregions from which the strings (words) are extracted using the principle of chain code algorithm and assigned into the nearest words in a dictionary of visual words (DoVW) with the Levenshtein distance (LD) by applying the bag of visual words (BoVW) paradigm. As a result, each region is represented by a histogram of dictionary words. The histograms are then assembled as a face descriptor. Our methodology depends on the path pursued from a starting pixel and do not require a model as the other approaches from the literature. Therefore, the information of the local and global properties of an object is obtained. The recognition is performed by using the nearest neighbor classifier with the Hellinger distance (HD) as a comparison between feature vectors. The experimental results on the ORL and Yale databases demonstrate the efficiency of the proposed approach in terms of preserving information and recognition rate compared to the existing face recognition methods.

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 Optimization of deep learning features for age-invariant face recognition

2020 ◽  
Vol 10 (2) ◽  
pp. 1833
Author(s):  
Amal A. Moustafa ◽  
Ahmed Elnakib ◽  
Nihal F. F. Areed
Keyword(s):  
Deep Learning ◽  
Face Recognition ◽  
Nearest Neighbor ◽  
Recognition Rate ◽  
Manhattan Distance ◽  
Distance Metrics ◽  
K Nearest Neighbor ◽  
Face Images ◽  
Knn Classifier ◽  
Deep Learning Features

This paper presents a methodology for Age-Invariant Face Recognition (AIFR), based on the optimization of deep learning features. The proposed method extracts deep learning features using transfer deep learning, extracted from the unprocessed face images. To optimize the extracted features, a Genetic Algorithm (GA) procedure is designed in order to select the most relevant features to the problem of identifying a person based on his/her facial images over different ages. For classification, K-Nearest Neighbor (KNN) classifiers with different distance metrics are investigated, i.e., Correlation, Euclidian, Cosine, and Manhattan distance metrics. Experimental results using a Manhattan distance KNN classifier achieves the best Rank-1 recognition rate of 86.2% and 96% on the standard FGNET and MORPH datasets, respectively. Compared to the state-of-the-art methods, our proposed method needs no preprocessing stages. In addition, the experiments show its privilege over other related methods.

scholarly journals Pengenalan Wajah Menggunakan Metode Linear Discriminant Analysis dan k Nearest Neighbor

2017 ◽  
Vol 9 (1) ◽  
pp. 1-9
Author(s):  
Fandiansyah Fandiansyah ◽  
Jayanti Yusmah Sari ◽  
Ika Putri Ningrum
Keyword(s):  
Feature Extraction ◽  
Face Recognition ◽  
Discriminant Analysis ◽  
Linear Discriminant Analysis ◽  
Nearest Neighbor ◽  
Experimental Result ◽  
K Nearest Neighbor ◽  
Linear Discriminant ◽  
Nearest Neighbor Classifier ◽  
Neighbor Classifier

Face recognition is one of the biometric system that mostly used for individual recognition in the absent machine or access control. This is because the face is the most visible part of human anatomy and serves as the first distinguishing factor of a human being. Feature extraction and classification are the key to face recognition, as they are to any pattern classification task. In this paper, we describe a face recognition method based on Linear Discriminant Analysis (LDA) and k-Nearest Neighbor classifier. LDA used for feature extraction, which directly extracts the proper features from image matrices with the objective of maximizing between-class variations and minimizing within-class variations. The features of a testing image will be compared to the features of database image using K-Nearest Neighbor classifier. The experiments in this paper are performed by using using 66 face images of 22 different people. The experimental result shows that the recognition accuracy is up to 98.33%. Index Terms—face recognition, k nearest neighbor, linear discriminant analysis.

scholarly journals Using Partial Differential Equation Face Recognition Model to Evaluate Students’ Attention in a College Chinese Classroom

2021 ◽  
Vol 2021 ◽  
pp. 1-10
Author(s):  
Xia Miao ◽  
Ziyao Yu ◽  
Ming Liu
Keyword(s):  
Differential Equation ◽  
Partial Differential Equation ◽  
Face Recognition ◽  
Sparse Representation ◽  
Nearest Neighbor ◽  
Learning Model ◽  
Local Geometry ◽  
Partial Differential ◽  
The Face ◽  
Expression Score

The partial differential equation learning model is applied to another high-level visual-processing problem: face recognition. A novel feature selection method based on partial differential equation learning model is proposed. The extracted features are invariant to rotation and translation and more robust to illumination changes. In the evaluation of students’ concentration in class, this paper firstly uses the face detection algorithm in face recognition technology to detect the face and intercept the expression data, and calculates the rise rate. Then, the improved model of concentration analysis and evaluation of a college Chinese class is used to recognize facial expression, and the corresponding weight is given to calculate the expression score. Finally, the head-up rate calculated at the same time is multiplied by the expression score as the final concentration score. Through the experiment and analysis of the experimental results in the actual classroom, the corresponding conclusions are drawn and teaching suggestions are provided for teachers. For each face, a large neighborhood set is firstly selected by the k -nearest neighbor method, and then, the sparse representation of sample points in the neighborhood is obtained, which effectively combines the locality of k -nearest neighbor and the robustness of sparse representation. In the sparse preserving nonnegative block alignment algorithm, a discriminant partial optimization model is constructed by using sparse reconstruction coefficients to describe local geometry and weighted distance to describe class separability. The two algorithms obtain good clustering and recognition results in various cases of real and simulated occlusion, which shows the effectiveness and robustness of the algorithm. In order to verify the reliability of the model, this paper verified the model through in-class practice tests, teachers’ questions, and interviews with students and teachers. The results show that the proposed joint evaluation method based on expression and head-up rate has high accuracy and reliability.

A Robust and Efficient Face Recognition System Based on Luminance Distribution Using Maximum Likelihood

2012 ◽  
Vol 241-244 ◽  
pp. 1705-1709
Author(s):  
Ching Tang Hsieh ◽  
Chia Shing Hu
Keyword(s):  
Face Recognition ◽  
Maximum Likelihood ◽  
Recognition Rate ◽  
Computation Time ◽  
Likelihood Estimation ◽  
Recognition System ◽  
Luminance Distribution ◽  
Face Region ◽  
Face Recognition System ◽  
The Face

In this paper, a robust and efficient face recognition system based on luminance distribution by using maximum likelihood estimation is proposed. The distribution of luminance components of the face region is acquired and applied to maximum likelihood test for face matching. The experimental results showed that the proposed method has a high recognition rate and requires less computation time.

Performance Analysis of Pose Invariant Face Recognition Approaches in Unconstrained Environments

2015 ◽  
Vol 5 (1) ◽  
pp. 66-81 ◽  
Author(s):  
M. Parisa Beham ◽  
S. M. Mansoor Roomi ◽  
J. Alageshan ◽  
V. Kapileshwaran
Keyword(s):  
Face Recognition ◽  
Nearest Neighbor ◽  
State Of The Art ◽  
Recognition Algorithm ◽  
K Nearest Neighbor ◽  
Research Issues ◽  
Histograms Of Oriented Gradients ◽  
Recognition Phase ◽  
The Face ◽  
Pose Variation

Face recognition and authentication are two significant and dynamic research issues in computer vision applications. There are many factors that should be accounted for face recognition; among them pose variation is a major challenge which severely influence in the performance of face recognition. In order to improve the performance, several research methods have been developed to perform the face recognition process with pose invariant conditions in constrained and unconstrained environments. In this paper, the authors analyzed the performance of a popular texture descriptors viz., Local Binary Pattern, Local Derivative Pattern and Histograms of Oriented Gradients for pose invariant problem. State of the art preprocessing techniques such as Discrete Cosine Transform, Difference of Gaussian, Multi Scale Retinex and Gradient face have also been applied before feature extraction. In the recognition phase K- nearest neighbor classifier is used to accomplish the classification task. To evaluate the efficiency of pose invariant face recognition algorithm three publicly available databases viz. UMIST, ORL and LFW datasets have been used. The above said databases have very wide pose variations and it is proved that the state of the art method is efficient only in constrained situations.

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.

Sign in / Sign up

Export Citation Format

Share Document