scholarly journals UFaceNet: Research on Multi-Task Face Recognition Algorithm Based on CNN

Algorithms ◽  
2021 ◽  
Vol 14 (9) ◽  
pp. 268
Author(s):  
Huoyou Li ◽  
Jianshiun Hu ◽  
Jingwen Yu ◽  
Ning Yu ◽  
Qingqiang Wu
Keyword(s):  
Neural Networks ◽  
Face Recognition ◽  
Recognition Algorithm ◽  
Training Data ◽  
Deep Convolutional Neural Networks ◽  
Model Calculations ◽  
Keypoint Detection ◽  
In Vivo Detection ◽  
The Face

With the application of deep convolutional neural networks, the performance of computer vision tasks has been improved to a new level. The construction of a deeper and more complex network allows the face recognition algorithm to obtain a higher accuracy, However, the disadvantages of large computation and storage costs of neural networks limit the further popularization of the algorithm. To solve this problem, we have studied the unified and efficient neural network face recognition algorithm under the condition of a single camera; we propose that the complete face recognition process consists of four tasks: face detection, in vivo detection, keypoint detection, and face verification; combining the key algorithms of these four tasks, we propose a unified network model based on a deep separable convolutional structure—UFaceNet. The model uses multisource data to carry out multitask joint training and uses the keypoint detection results to aid the learning of other tasks. It further introduces the attention mechanism through feature level clipping and alignment to ensure the accuracy of the model, using the shared convolutional layer network among tasks to reduce model calculations amount and realize network acceleration. The learning goal of multi-tasking implicitly increases the amount of training data and different data distribution, making it easier to learn the characteristics with generalization. The experimental results show that the UFaceNet model is better than other models in terms of calculation amount and number of parameters with higher efficiency, and some potential areas to be used.

FACE RECOGNITION IN COLOUR IMAGES USING NEURAL NETWORKS AND GENETIC ALGORITHMS

2005 ◽  
Vol 05 (01) ◽  
pp. 55-67 ◽  
Author(s):  
STEPHEN KARUNGARU ◽  
MINORU FUKUMI ◽  
NORIO AKAMATSU
Keyword(s):  
Neural Networks ◽  
Face Recognition ◽  
Template Matching ◽  
Distance Measure ◽  
Facial Feature ◽  
Training Data ◽  
Segmentation Method ◽  
Facial Feature Extraction ◽  
Matching Process ◽  
The Face

In this paper, a system that can automatically detect and recognise frontal faces is proposed. Three methods are used for face recognition; neural network, template matching and distance measure. One of the main problems encountered when using neural networks for face recognition is insufficient training data. This problem arises because, in most cases, only one image per subject is available. Therefore, amongst the objectives is to solve this problem by "increasing" the data available from the original image using several preprocesses, for example, image mirroring, colour and edges information, etc. Moreover, template matching is not trivial because of differences in the template shapes and sizes. In this work, template matching is aided by a genetic algorithm to automatically test several positions around the target and automatically adjust the size of the template as the matching process progresses. Distance measure method depends heavily on good facial feature extraction results. The image segmentation method applied matches such demand. The face colour information is represented using YIQ and the XYZ colour spaces. The effectiveness of the proposed method is verified by performing computer simulations. Two sets of databases were used. Database1 consists of 267 faces from the Oulu university database and database2 (for comparision purposes) consists of 250 faces from the ORL database.

scholarly journals xCos: An Explainable Cosine Metric for Face Verification Task

2021 ◽  
Vol 17 (3s) ◽  
pp. 1-16
Author(s):  
Yu-Sheng Lin ◽  
Zhe-Yu Liu ◽  
Yu-An Chen ◽  
Yu-Siang Wang ◽  
Ya-Liang Chang ◽  
...  
Keyword(s):  
Neural Networks ◽  
Face Recognition ◽  
Recognition Task ◽  
High Accuracy ◽  
Face Verification ◽  
Verification Task ◽  
Deep Convolutional Neural Networks ◽  
Explainable Ai ◽  
The Face ◽  
Very High

We study the XAI (explainable AI) on the face recognition task, particularly the face verification. Face verification has become a crucial task in recent days and it has been deployed to plenty of applications, such as access control, surveillance, and automatic personal log-on for mobile devices. With the increasing amount of data, deep convolutional neural networks can achieve very high accuracy for the face verification task. Beyond exceptional performances, deep face verification models need more interpretability so that we can trust the results they generate. In this article, we propose a novel similarity metric, called explainable cosine ( xCos ), that comes with a learnable module that can be plugged into most of the verification models to provide meaningful explanations. With the help of xCos , we can see which parts of the two input faces are similar, where the model pays its attention to, and how the local similarities are weighted to form the output xCos score. We demonstrate the effectiveness of our proposed method on LFW and various competitive benchmarks, not only resulting in providing novel and desirable model interpretability for face verification but also ensuring the accuracy as plugging into existing face recognition models.

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 Illumination-robust face recognition based on deep convolutional neural networks architectures

2020 ◽  
Vol 18 (2) ◽  
pp. 1015
Author(s):  
Ridha Ilyas Bendjillali ◽  
Mohammed Beladgham ◽  
Khaled Merit ◽  
Abdelmalik Taleb-Ahmed
Keyword(s):  
Neural Networks ◽  
Face Recognition ◽  
Convolutional Neural Networks ◽  
Feature Learning ◽  
Histogram Equalization ◽  
Detection Algorithm ◽  
Deep Convolutional Neural Networks ◽  
Biometric Technology ◽  
Equalization Algorithm ◽  
Robust Face Recognition

<p><span>In the last decade, facial recognition techniques are considered the most important fields of research in biometric technology. In this research paper, we present a Face Recognition (FR) system divided into three steps: The Viola-Jones face detection algorithm, facial image enhancement using Modified Contrast Limited Adaptive Histogram Equalization algorithm (M-CLAHE), and feature learning for classification. For learning the features followed by classification we used VGG16, ResNet50 and Inception-v3 Convolutional Neural Networks (CNN) architectures for the proposed system. Our experimental work was performed on the Extended Yale B database and CMU PIE face database. Finally, the comparison with the other methods on both databases shows the robustness and effectiveness of the proposed approach. Where the Inception-v3 architecture has achieved a rate of 99, 44% and 99, 89% respectively.</span></p>

Methods for Monitoring the Psychophysiological State of a Human Operator via Emotions Reflected in Facial Expressions and Analysis of Blinking Characteristics using Deep Convolutional Neural Networks

2021 ◽  
pp. 120-134
Author(s):  
O.N. Korsun ◽  
V.N. Yurko
Keyword(s):  
Neural Networks ◽  
Convolutional Neural Networks ◽  
Physiological State ◽  
Human Operator ◽  
Deep Convolutional Neural Networks ◽  
Automated Recognition ◽  
The Neural Network ◽  
Psychophysiological State ◽  
The Face ◽  
Flight Parameters

We analysed two approaches to estimating the state of a human operator according to video imaging of the face. These approaches, both using deep convolutional neural networks, are as follows: 1) automated emotion recognition; 2) analysis of blinking characteristics. The study involved assessing changes in the functional state of a human operator performing a manual landing in a flight simulator. During this process, flight parameters were recorded, and the operator’s face was filmed. Then we used our custom software to perform automated recognition of emotions (blinking), synchronising the emotions (blinking) recognised to the flight parameters recorded. As a result, we detected persistent patterns linking the operator fatigue level to the number of emotions recognised by the neural network. The type of emotion depends on unique psychological characteristics of the operator. Our experiments allow for easily tracing these links when analysing the emotions of "Sadness", "Fear" and "Anger". The study revealed a correlation between blinking properties and piloting accuracy. A higher piloting accuracy meant more blinks recorded, which may be explained by a stable psycho-physiological state leading to confident piloting

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.

scholarly journals Complexity of Deep Convolutional Neural Networks in Mobile Computing

Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-8
Author(s):  
Saad Naeem ◽  
Noreen Jamil ◽  
Habib Ullah Khan ◽  
Shah Nazir
Keyword(s):  
Neural Networks ◽  
Mobile Devices ◽  
Training Data ◽  
Deep Convolutional Neural Networks ◽  
Compression Technique ◽  
Training Time ◽  
Network Pruning ◽  
Highly Nonlinear ◽  
Process Work ◽  
Time Required

Neural networks employ massive interconnection of simple computing units called neurons to compute the problems that are highly nonlinear and could not be hard coded into a program. These neural networks are computation-intensive, and training them requires a lot of training data. Each training example requires heavy computations. We look at different ways in which we can reduce the heavy computation requirement and possibly make them work on mobile devices. In this paper, we survey various techniques that can be matched and combined in order to improve the training time of neural networks. Additionally, we also review some extra recommendations to make the process work for mobile devices as well. We finally survey deep compression technique that tries to solve the problem by network pruning, quantization, and encoding the network weights. Deep compression reduces the time required for training the network by first pruning the irrelevant connections, i.e., the pruning stage, which is then followed by quantizing the network weights via choosing centroids for each layer. Finally, at the third stage, it employs Huffman encoding algorithm to deal with the storage issue of the remaining weights.

A TIED-MIXTURE 2D HMM FACIAL IMAGE RETRIEVAL SYSTEM

2004 ◽  
Vol 13 (05) ◽  
pp. 1133-1146
Author(s):  
H. OTHMAN ◽  
T. ABOULNASR
Keyword(s):  
Face Recognition ◽  
Recognition System ◽  
Training Data ◽  
Expected Improvement ◽  
Model Case ◽  
Face Recognition System ◽  
Image Retrieval System ◽  
The Face ◽  
Institute Of Technology ◽  
Observation Space

In this paper, the effect of mixture tying on a second-order 2D Hidden Markov Model (HMM) is studied as applied to the face recognition problem. While tying HMM parameters is a well-known solution in the case of insufficient training data that leads to nonrobust estimation, it is used here to improve the overall performance in the small model case where the resolution in the observation space is the main problem. The fully-tied-mixture 2D HMM-based face recognition system is applied to the facial database of AT&T and the facial database of Georgia Institute of Technology. The performance of the proposed 2D HMM tied-mixture system is studied and the expected improvement is confirmed.

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 Dealing with Lack of Training Data for Convolutional Neural Networks: The Case of Digital Pathology

Electronics ◽  
2019 ◽  
Vol 8 (3) ◽  
pp. 256
Author(s):  
Francesco Ponzio ◽  
Gianvito Urgese ◽  
Elisa Ficarra ◽  
Santa Di Cataldo
Keyword(s):  
Neural Networks ◽  
Transfer Learning ◽  
Convolutional Neural Networks ◽  
Digital Pathology ◽  
Training Data ◽  
Automated Classification ◽  
Computationally Efficient ◽  
Deep Convolutional Neural Networks ◽  
Cad Systems ◽  
Tissue Characteristics

Thanks to their capability to learn generalizable descriptors directly from images, deep Convolutional Neural Networks (CNNs) seem the ideal solution to most pattern recognition problems. On the other hand, to learn the image representation, CNNs need huge sets of annotated samples that are unfeasible in many every-day scenarios. This is the case, for example, of Computer-Aided Diagnosis (CAD) systems for digital pathology, where additional challenges are posed by the high variability of the cancerous tissue characteristics. In our experiments, state-of-the-art CNNs trained from scratch on histological images were less accurate and less robust to variability than a traditional machine learning framework, highlighting all the issues of fully training deep networks with limited data from real patients. To solve this problem, we designed and compared three transfer learning frameworks, leveraging CNNs pre-trained on non-medical images. This approach obtained very high accuracy, requiring much less computational resource for the training. Our findings demonstrate that transfer learning is a solution to the automated classification of histological samples and solves the problem of designing accurate and computationally-efficient CAD systems with limited training data.

Sign in / Sign up

Export Citation Format

Share Document