Datasets of face images for face recognition systems

2015 ◽  
pp. 317-328
Keyword(s):  
Face Recognition ◽  
Face Images ◽  
Recognition Systems

Pose-Invariant Face Synthesis and Recognition via Sparse Coding and Symmetrical Information

2013 ◽  
Vol 437 ◽  
pp. 894-900
Author(s):  
Shuai Zhang ◽  
Hai Rui Wang ◽  
Xiao Li He
Keyword(s):  
Face Recognition ◽  
Sparse Coding ◽  
Estimation Algorithm ◽  
Collaborative Representation ◽  
Synthesis Algorithm ◽  
Face Images ◽  
Symmetric Information ◽  
Recognition Systems ◽  
Pose Variation ◽  
Face Synthesis

Pose variation which brings illumination change, occlusion and non-linear scale variation, dramatically drops the performance of face recognition systems. In this paper, we propose a novel pose invariant face recognition method, in which we build a joint sparse coding scheme to predict face images from a certain pose to another. By introducing autoregressive regularization and symmetric information, our algorithm could achieve high robustness to local misalignment and large pose differences. Besides, we propose a new coarse pose estimation algorithm by collaborative representation classifier, which is very fast and enough accurate for our synthesis algorithm. The experiment results on multi-pose subsets of CMU-PIE and FERET database show the efficiency of the proposed method on multi-pose face recognition.

scholarly journals A novel framework for face recognition using robust local representation–based classification

2019 ◽  
Vol 15 (3) ◽  
pp. 155014771983608
Author(s):  
Aihua Yu ◽  
Gang Li ◽  
Beiping Hou ◽  
Hongan Wang ◽  
Gaoya Zhou
Keyword(s):  
Face Recognition ◽  
Local Binary Pattern ◽  
Recognition Performance ◽  
Recognition Rate ◽  
Recall Rate ◽  
Data Sets ◽  
Computation Complexity ◽  
Face Images ◽  
In The Wild ◽  
Recognition Systems

Face recognition via representation-based classification is a trending technique in the recent years. However, the recognition performance of the systems using such a technique degrades in an unconstrained environment. In this article, a novel framework is proposed for representation-based face recognition. To deal with the unconstrained environment, a pre-process is used to frontalize face images, and aligned downsampling local binary pattern features of the frontalized images are used for classification. A dimension reduction is then adopted in order to reduce the computation complexity via an optimized projection matrix. The recognition is carried out using an improved robust sparse coding algorithm. Such an algorithm is expected to avoid the overfitting problem. The open-universe test on labeled faces in the wild data sets shows that the recognition rate of the proposed system can reach 95% with a recall rate of 80%, which is best among those representation-based classification face recognition systems.

scholarly journals Assessing the Performance of DWT-PCA/SVD Face Recognition Algorithm under Multiple Constraints

2021 ◽  
Vol 2021 ◽  
pp. 1-12
Author(s):  
Joseph Agyapong Mensah ◽  
Louis Asiedu ◽  
Felix O. Mettle ◽  
Samuel Iddi
Keyword(s):  
Face Recognition ◽  
Pairwise Comparison ◽  
Recognition Algorithm ◽  
Discrete Wavelet ◽  
Multiple Constraints ◽  
Comparison Test ◽  
Face Images ◽  
Significant Difference ◽  
Left And Right ◽  
Recognition Systems

Many architectures of face recognition modules have been developed to tackle the challenges posed by varying environmental constraints such as illumination, occlusions, pose, and expressions. These recognition systems have mainly focused on a single constraint at a time and have achieved remarkable successes. However, the presence of multiple constraints may deteriorate the performance of these face recognition systems. In this study, we assessed the performance of Principal Component Analysis and Singular Value Decomposition using Discrete Wavelet Transform (DWT-PCA/SVD) for preprocessing face recognition algorithm on multiple constraints (partially occluded face images acquired with varying expressions). Numerical evaluation of the study algorithm gave reasonably average recognition rates of 77.31% and 76.85% for left and right reconstructed face images with varying expressions, respectively. A statistically significant difference was established between the average recognition distance of the left and right reconstructed face images acquired with varying expressions using pairwise comparison test. The post hoc analysis using the Bonferroni simultaneous confidence interval revealed that the significant difference established through the pairwise comparison test was mainly due to the sad expressions. Although the performance of the DWT-PCA/SVD algorithm declined as compared to its performance on single constraints, the algorithm attained appreciable performance level under multiple constraints. The DWT-PCA/SVD recognition algorithm performs reasonably well for recognition when partial occlusion with varying expressions is the underlying constraint.

scholarly journals Some Information Geometric Aspects of Cyber Security by Face Recognition

Entropy ◽  
2021 ◽  
Vol 23 (7) ◽  
pp. 878
Author(s):  
C. T. J. Dodson ◽  
John Soldera ◽  
Jacob Scharcanski
Keyword(s):  
Face Recognition ◽  
Cyber Security ◽  
Probability Distributions ◽  
Geodesic Distance ◽  
Recognition Method ◽  
Frequency Distributions ◽  
Face Images ◽  
User Access ◽  
Multidimensional Methods ◽  
Joint Probabilities

Secure user access to devices and datasets is widely enabled by fingerprint or face recognition. Organization of the necessarily large secure digital object datasets, with objects having content that may consist of images, text, video or audio, involves efficient classification and feature retrieval processing. This usually will require multidimensional methods applicable to data that is represented through a family of probability distributions. Then information geometry is an appropriate context in which to provide for such analytic work, whether with maximum likelihood fitted distributions or empirical frequency distributions. The important provision is of a natural geometric measure structure on families of probability distributions by representing them as Riemannian manifolds. Then the distributions are points lying in this geometrical manifold, different features can be identified and dissimilarities computed, so that neighbourhoods of objects nearby a given example object can be constructed. This can reveal clustering and projections onto smaller eigen-subspaces which can make comparisons easier to interpret. Geodesic distances can be used as a natural dissimilarity metric applied over data described by probability distributions. Exploring this property, we propose a new face recognition method which scores dissimilarities between face images by multiplying geodesic distance approximations between 3-variate RGB Gaussians representative of colour face images, and also obtaining joint probabilities. The experimental results show that this new method is more successful in recognition rates than published comparative state-of-the-art methods.

Face recognition in an intelligent door lock with ResNet model based on deep learning

2021 ◽  
pp. 1-11
Author(s):  
Suphawimon Phawinee ◽  
Jing-Fang Cai ◽  
Zhe-Yu Guo ◽  
Hao-Ze Zheng ◽  
Guan-Chen Chen
Keyword(s):  
Face Recognition ◽  
Detection System ◽  
Low Cost ◽  
Ease Of Use ◽  
Raspberry Pi ◽  
Training Methods ◽  
Graphics Recognition ◽  
Face Images ◽  
The Face ◽  
Door Lock

Internet of Things is considerably increasing the levels of convenience at homes. The smart door lock is an entry product for smart homes. This work used Raspberry Pi, because of its low cost, as the main control board to apply face recognition technology to a door lock. The installation of the control sensing module with the GPIO expansion function of Raspberry Pi also improved the antitheft mechanism of the door lock. For ease of use, a mobile application (hereafter, app) was developed for users to upload their face images for processing. The app sends the images to Firebase and then the program downloads the images and captures the face as a training set. The face detection system was designed on the basis of machine learning and equipped with a Haar built-in OpenCV graphics recognition program. The system used four training methods: convolutional neural network, VGG-16, VGG-19, and ResNet50. After the training process, the program could recognize the user’s face to open the door lock. A prototype was constructed that could control the door lock and the antitheft system and stream real-time images from the camera to the app.

scholarly journals Multimodal Low Resolution Face and Frontal Gait Recognition from Surveillance Video

Electronics ◽  
2021 ◽  
Vol 10 (9) ◽  
pp. 1013
Author(s):  
Sayan Maity ◽  
Mohamed Abdel-Mottaleb ◽  
Shihab S. Asfour
Keyword(s):  
Face Recognition ◽  
High Resolution ◽  
Gait Cycle ◽  
Gait Recognition ◽  
Recognition System ◽  
Multimodal Fusion ◽  
Surveillance Video ◽  
Low Resolution ◽  
Model Free ◽  
Face Images

Biometric identification using surveillance video has attracted the attention of many researchers as it can be applicable not only for robust identification but also personalized activity monitoring. In this paper, we present a novel multimodal recognition system that extracts frontal gait and low-resolution face images from frontal walking surveillance video clips to perform efficient biometric recognition. The proposed study addresses two important issues in surveillance video that did not receive appropriate attention in the past. First, it consolidates the model-free and model-based gait feature extraction approaches to perform robust gait recognition only using the frontal view. Second, it uses a low-resolution face recognition approach which can be trained and tested using low-resolution face information. This eliminates the need for obtaining high-resolution face images to create the gallery, which is required in the majority of low-resolution face recognition techniques. Moreover, the classification accuracy on high-resolution face images is considerably higher. Previous studies on frontal gait recognition incorporate assumptions to approximate the average gait cycle. However, we quantify the gait cycle precisely for each subject using only the frontal gait information. The approaches available in the literature use the high resolution images obtained in a controlled environment to train the recognition system. However, in our proposed system we train the recognition algorithm using the low-resolution face images captured in the unconstrained environment. The proposed system has two components, one is responsible for performing frontal gait recognition and one is responsible for low-resolution face recognition. Later, score level fusion is performed to fuse the results of the frontal gait recognition and the low-resolution face recognition. Experiments conducted on the Face and Ocular Challenge Series (FOCS) dataset resulted in a 93.5% Rank-1 for frontal gait recognition and 82.92% Rank-1 for low-resolution face recognition, respectively. The score level multimodal fusion resulted in 95.9% Rank-1 recognition, which demonstrates the superiority and robustness of the proposed approach.

scholarly journals PEM-PCA: A Parallel Expectation-Maximization PCA Face Recognition Architecture

2014 ◽  
Vol 2014 ◽  
pp. 1-16 ◽  
Author(s):  
Kanokmon Rujirakul ◽  
Chakchai So-In ◽  
Banchar Arnonkijpanich
Keyword(s):  
Feature Extraction ◽  
Face Recognition ◽  
Expectation Maximization ◽  
High Speed ◽  
Expectation Maximization Algorithm ◽  
Parallel Architecture ◽  
Principal Component ◽  
Eigenvalue Decomposition ◽  
Computational Time ◽  
Recognition Systems

Principal component analysis or PCA has been traditionally used as one of the feature extraction techniques in face recognition systems yielding high accuracy when requiring a small number of features. However, the covariance matrix and eigenvalue decomposition stages cause high computational complexity, especially for a large database. Thus, this research presents an alternative approach utilizing an Expectation-Maximization algorithm to reduce the determinant matrix manipulation resulting in the reduction of the stages’ complexity. To improve the computational time, a novel parallel architecture was employed to utilize the benefits of parallelization of matrix computation during feature extraction and classification stages including parallel preprocessing, and their combinations, so-called a Parallel Expectation-Maximization PCA architecture. Comparing to a traditional PCA and its derivatives, the results indicate lower complexity with an insignificant difference in recognition precision leading to high speed face recognition systems, that is, the speed-up over nine and three times over PCA and Parallel PCA.

Adapted discriminative coupled mappings for low-resolution face recognition with one-shot

2021 ◽  
pp. 1-15
Author(s):  
Yongjie Chu ◽  
Touqeer Ahmad ◽  
Lindu Zhao
Keyword(s):  
Face Recognition ◽  
Law Enforcement ◽  
High Resolution ◽  
Domain Adaptation ◽  
Face Image ◽  
Discriminative Learning ◽  
Low Resolution ◽  
Face Images ◽  
World Environment

Low-resolution face recognition with one-shot is a prevalent problem encountered in law enforcement, where it generally requires to recognize the low-resolution face images captured by surveillance cameras with the only one high-resolution profile face image in the database. The problem is very tough because the available samples is quite few and the quality of unknown images is quite low. To effectively address this issue, this paper proposes Adapted Discriminative Coupled Mappings (AdaDCM) approach, which integrates domain adaptation and discriminative learning. To achieve good domain adaptation performance for small size dataset, a new domain adaptation technique called Bidirectional Locality Matching-based Domain Adaptation (BLM-DA) is first developed. Then the proposed AdaDCM is formulated by unifying BLM-DA and discriminative coupled mappings into a single framework. AdaDCM is extensively evaluated on FERET, LFW, and SCface databases, which includes LR face images obtained in constrained, unconstrained, and real-world environment. The promising results on these datasets demonstrate the effectiveness of AdaDCM in LR face recognition with one-shot.

Sign in / Sign up

Export Citation Format

Share Document