scholarly journals MFCosface: A Masked-Face Recognition Algorithm Based on Large Margin Cosine Loss

2021 ◽  
Vol 11 (16) ◽  
pp. 7310
Author(s):  
Hongxia Deng ◽  
Zijian Feng ◽  
Guanyu Qian ◽  
Xindong Lv ◽  
Haifang Li ◽  
...  

The world today is being hit by COVID-19. As opposed to fingerprints and ID cards, facial recognition technology can effectively prevent the spread of viruses in public places because it does not require contact with specific sensors. However, people also need to wear masks when entering public places, and masks will greatly affect the accuracy of facial recognition. Accurately performing facial recognition while people wear masks is a great challenge. In order to solve the problem of low facial recognition accuracy with mask wearers during the COVID-19 epidemic, we propose a masked-face recognition algorithm based on large margin cosine loss (MFCosface). Due to insufficient masked-face data for training, we designed a masked-face image generation algorithm based on the detection of the detection of key facial features. The face is detected and aligned through a multi-task cascaded convolutional network; and then we detect the key features of the face and select the mask template for coverage according to the positional information of the key features. Finally, we generate the corresponding masked-face image. Through analysis of the masked-face images, we found that triplet loss is not applicable to our datasets, because the results of online triplet selection contain fewer mask changes, making it difficult for the model to learn the relationship between mask occlusion and feature mapping. We use a large margin cosine loss as the loss function for training, which can map all the feature samples in a feature space with a smaller intra-class distance and a larger inter-class distance. In order to make the model pay more attention to the area that is not covered by the mask, we designed an Att-inception module that combines the Inception-Resnet module and the convolutional block attention module, which increases the weight of any unoccluded area in the feature map, thereby enlarging the unoccluded area’s contribution to the identification process. Experiments on several masked-face datasets have proved that our algorithm greatly improves the accuracy of masked-face recognition, and can accurately perform facial recognition with masked subjects.

2021 ◽  
Vol 2021 ◽  
pp. 1-12
Author(s):  
Zhixue Liang

In the contactless delivery scenario, the self-pickup cabinet is an important terminal delivery device, and face recognition is one of the efficient ways to achieve contactless access express delivery. In order to effectively recognize face images under unrestricted environments, an unrestricted face recognition algorithm based on transfer learning is proposed in this study. First, the region extraction network of the faster RCNN algorithm is improved to improve the recognition speed of the algorithm. Then, the first transfer learning is applied between the large ImageNet dataset and the face image dataset under restricted conditions. The second transfer learning is applied between face image under restricted conditions and unrestricted face image datasets. Finally, the unrestricted face image is processed by the image enhancement algorithm to increase its similarity with the restricted face image, so that the second transfer learning can be carried out effectively. Experimental results show that the proposed algorithm has better recognition rate and recognition speed on the CASIA-WebFace dataset, FLW dataset, and MegaFace dataset.


Author(s):  
Tang-Tang Yi ◽  

In order to solve the problem of low recognition accuracy in recognition of 3D face images collected by traditional sensors, a face recognition algorithm for 3D point cloud collected by mixed image sensors is proposed. The algorithm first uses the 3D wheelbase to expand the face image edge. According to the 3D wheelbase, the noise of extended image is detected, and median filtering is used to eliminate the detected noise. Secondly, the priority of the boundary pixels to recognize the face image in the denoising image recognition process is determined, and the key parts such as the illuminance line are analyzed, so that the recognition of the 3D point cloud face image is completed. Experiments show that the proposed algorithm improves the recognition accuracy of 3D face images, which recognition time is lower than that of the traditional algorithm by about 4 times, and the recognition efficiency is high.


Kursor ◽  
2018 ◽  
Vol 9 (2) ◽  
Author(s):  
Eva Y Puspaningrum ◽  
Budi Nugroho ◽  
Andri Istifariyanto

Facial recognition is one of the most popular issues in the field of pattern recognition.Face recognition with uncontrolled lighting conditions is more significant than thephysical characteristics of individual faces. Uncontrolled lighting from the right and leftcan affect the face image. A lot of research on facial recognition, but little attention givento the face image is symmetrical object. Several studies to explore and exploit thesymmetrical properties of the face for face recognition were performed. In this paper, wepropose a pre-processing method to solve one of the common problems in facial imageswith varying illumination. We utilize the symmetric property of the face then performedgamma correction then classified using Robust Regression. The results of this experimentgot an average accuracy of 94.31% and the proposed technique improves recognitionaccuracy especially in images with extreme lighting conditions using gamma correctionparameters γ = 0.3.


Author(s):  
Yuxiang Long

Face recognition is difficult due to the higher dimension of face image features and fewer training samples. Firstly, in order to improve the performance of feature extraction, we inventively construct a double hierarchical network structure convolution neural network (CNN) model. The front-end network adopts a relatively simple network model to achieve rough feature extraction from input images and obtain multiple suspect face candidate windows. The back-end network uses a relatively complex network model to filter the best detection window and return the face size and position by nonmaximum suppression. Then, in order to fully extract the face features in the optimal window, a face recognition algorithm based on intermediate layers connected by the deep CNN is proposed in this paper. Based on AlexNet, the front, intermediate and end convolution layers are combined by deep connection. Then, the feature vector describing the face image is obtained by the operation of the pooling layer and the full connection layer. Finally, the auxiliary classifier training method is used to train the model to ensure the effectiveness of the features of the intermediate layer. Experimental results based on open face database show that the recognition accuracy of the proposed algorithm is higher than that of other face recognition algorithms compared in this paper.


2021 ◽  
Vol 2021 ◽  
pp. 1-11
Author(s):  
GuiLing Wu

A contactless delivery cabinet is an important courier self-pickup device, for the reason that COVID-19 can be transmitted by human contact. During the pandemic period of COVID-19, wearing a mask to take delivery is a common application scenario, which makes the study of masked face recognition algorithm greatly significant. A masked face recognition algorithm based on attention mechanism is proposed in this paper in order to improve the recognition rate of masked face images. First, the masked face image is separated by the local constrained dictionary learning method, and the face image part is separated. Then, the dilated convolution is used to reduce the resolution reduction in the subsampling process. Finally, according to the important feature information of the face image, the attention mechanism neural network is used to reduce the information loss in the subsampling process and improve the face recognition rate. In the experimental part, the RMFRD and SMFRD databases of Wuhan University were selected to compare the recognition rate. The experimental results show that the proposed algorithm has a better recognition rate.


2014 ◽  
Vol 2014 ◽  
pp. 1-10 ◽  
Author(s):  
Zhe-Zhou Yu ◽  
Yu-Hao Liu ◽  
Bin Li ◽  
Shu-Chao Pang ◽  
Cheng-Cheng Jia

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.


Author(s):  
Kareem Kamal A. Ghany ◽  
Hossam M. Zawbaa

There are many tools and techniques that can support management in the information security field. In order to deal with any kind of security, authentication plays an important role. In biometrics, a human being needs to be identified based on some unique personal characteristics and parameters. In this book chapter, the researchers will present an automatic Face Recognition and Authentication Methodology (FRAM). The most significant contribution of this work is using three face recognition methods; the Eigenface, the Fisherface, and color histogram quantization. Finally, the researchers proposed a hybrid approach which is based on a DNA encoding process and embedding the resulting data into a face image using the discrete wavelet transform. In the reverse process, the researchers performed DNA decoding based on the data extracted from the face image.


Author(s):  
M. Parisa Beham ◽  
S. M. Mansoor Roomi ◽  
J. Alageshan ◽  
V. Kapileshwaran

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.


2014 ◽  
Vol 644-650 ◽  
pp. 4080-4083
Author(s):  
Ye Cai Guo ◽  
Ling Hua Zhang

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.


Author(s):  
Noradila Nordin ◽  
Nurul Husna Mohd Fauzi

Attendance marking in a classroom is one of the methods used to track the student’s presence in the lecture. The conventional method that is being enforced has shown to be vulnerable, inaccurate and time-consuming especially in a large classroom. It is difficult to identify absentees and proxy attendees based on the conventional attendance marking method. In order to overcome the challenges faced in the conventional method, a web-based mobile attendance system with facial recognition feature is proposed. It incorporated the existing mobile devices with a camera and the face recognition system to allow the attendance system to be used in classrooms automatically and efficiently with minor implementation requirements. The system prototype received positive responses from the volunteers who tested the system to replace the conventional attendance marking.


Sign in / Sign up

Export Citation Format

Share Document