scholarly journals Unrestricted Face Recognition Algorithm Based on Transfer Learning on Self-Pickup Cabinet

2021 ◽  
Vol 2021 ◽  
pp. 1-12
Author(s):  
Zhixue Liang
Keyword(s):  
Face Recognition ◽  
Transfer Learning ◽  
Recognition Rate ◽  
Recognition Algorithm ◽  
Face Image ◽  
Delivery Device ◽  
Face Images ◽  
Region Extraction ◽  
The Face ◽  
Enhancement Algorithm

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.

scholarly journals Masked Face Recognition Algorithm for a Contactless Distribution Cabinet

2021 ◽  
Vol 2021 ◽  
pp. 1-11
Author(s):  
GuiLing Wu
Keyword(s):  
Face Recognition ◽  
Recognition Rate ◽  
Recognition Algorithm ◽  
Face Image ◽  
Attention Mechanism ◽  
Human Contact ◽  
Face Images ◽  
The Face ◽  
Common Application ◽  
Image Part

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.

Face Recognition Algorithm Based on 3D Point Cloud Acquired by Mixed Image Sensor

2019 ◽  
Vol 23 (2) ◽  
pp. 366-369
Author(s):  
Tang-Tang Yi ◽  
Keyword(s):  
Face Recognition ◽  
Point Cloud ◽  
Recognition Accuracy ◽  
Image Sensor ◽  
Recognition Algorithm ◽  
Face Image ◽  
3D Point Cloud ◽  
3D Face ◽  
Face Images ◽  
The Face

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.

scholarly journals The Face Recognition Method Based on CS-LBP and DBN

2018 ◽  
Vol 2018 ◽  
pp. 1-9 ◽  
Author(s):  
Kun Sun ◽  
Xin Yin ◽  
Mingxin Yang ◽  
Yang Wang ◽  
Jianying Fan
Keyword(s):  
Face Recognition ◽  
Local Binary Pattern ◽  
Recognition Rate ◽  
Texture Feature ◽  
Texture Features ◽  
Face Image ◽  
Recognition Method ◽  
Traditional Methods ◽  
Face Images ◽  
The Face

At present, the face recognition method based on deep belief network (DBN) has advantages of automatically learning the abstract information of face images and being affected slightly by active factors, so it becomes the main method in the face recognition area. Because DBN ignores the local information of face images, the face recognition rate based on DBN is badly affected. To solve this problem, a face recognition method based on center-symmetric local binary pattern (CS-LBP) and DBN (FRMCD) is proposed in this paper. Firstly, the face image is divided into several subblocks. Secondly, CS-LBP is used to extract texture features of each image subblock. Thirdly, texture feature histograms are formed and input into the DBN visual layer. Finally, face classification and face recognition are completed through deep learning in DBN. Through the experiments on face databases ORL, Extend Yale B, and CMU-PIE by the proposed method (FRMCD), the best partitioning way of the face image and the hidden unit number of the DBN hidden layer are obtained. Then, comparative experiments between the FRMCD and traditional methods are performed. The results show that the recognition rate of FRMCD is superior to those of traditional methods; the highest recognition rate is up to 98.82%. When the number of training samples is less, the FRMCD has more significant advantages. Compared with the method based on local binary pattern (LBP) and DBN, the time-consuming of FRMCD is shorter.

scholarly journals A New Face Image Recognition Algorithm Based on Cerebellum-Basal Ganglia Mechanism

2021 ◽  
Vol 2021 ◽  
pp. 1-11
Author(s):  
Shoujun Tang ◽  
Mohammad Shabaz
Keyword(s):  
Face Recognition ◽  
Basal Ganglia ◽  
Recognition Rate ◽  
Great Accuracy ◽  
Recognition Algorithm ◽  
Image Features ◽  
Face Image ◽  
Geometric Feature ◽  
Face Images ◽  
High Recognition Accuracy

Face recognition is one of the popular areas of research in the field of computer vision. It is mainly used for identification and security system. One of the major challenges in face recognition is identification under numerous illumination environments by changing the direction of light or modifying the lighting magnitude. Exacting illumination invariant features is an effective approach to solve this problem. Conventional face recognition algorithms based on nonsubsampled contourlet transform (NSCT) and bionic mode are not capable enough to recognize the similar faces with great accuracy. Hence, in this paper, an attempt is made to propose an enhanced cerebellum-basal ganglia mechanism (CBGM) for face recognition. The integral projection and geometric feature assortment method are used to acquire the facial image features. The cognition model is deployed which is based on the cerebellum-basal ganglia mechanism and is applied for extraction of features from the face image to achieve greater accuracy for recognition of face images. The experimental results reveal that the enhanced CBGM algorithm can effectively recognize face images with greater accuracy. The recognition rate of 100 AR face images has been found to be 96.9%. The high recognition accuracy rate has been achieved by the proposed CBGM technique.

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.

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 3D Face Image Inpainting with Generative Adversarial Nets

2020 ◽  
Vol 2020 ◽  
pp. 1-11
Author(s):  
Tongxin Wei ◽  
Qingbao Li ◽  
Jinjin Liu ◽  
Ping Zhang ◽  
Zhifeng Chen
Keyword(s):  
Face Recognition ◽  
Recognition Performance ◽  
Image Inpainting ◽  
Face Image ◽  
Edge Information ◽  
3D Face ◽  
Face Images ◽  
The Face ◽  
Match Effect ◽  
Traditional Image

In the process of face recognition, face acquisition data is seriously distorted. Many face images collected are blurred or even missing. Faced with so many problems, the traditional image inpainting was based on structure, while the current popular image inpainting method is based on deep convolutional neural network and generative adversarial nets. In this paper, we propose a 3D face image inpainting method based on generative adversarial nets. We identify two parallels of the vector to locate the planer positions. Compared with the previous, the edge information of the missing image is detected, and the edge fuzzy inpainting can achieve better visual match effect. We make the face recognition performance dramatically boost.

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.

The Safety Research for Face Recognition System Based on Image Feature and Digital Watermarking

2012 ◽  
Vol 224 ◽  
pp. 485-488
Author(s):  
Fei Li ◽  
Yuan Yuan Wang
Keyword(s):  
Face Recognition ◽  
Recognition Rate ◽  
Recognition System ◽  
Face Image ◽  
Image Feature ◽  
Safety Research ◽  
The Face ◽  
Information Image ◽  
Image Integrity ◽  
Recognition Software

Abstract: In order to solve the easily copied problem of images in face recognition software, an algorithm combining the image feature with digital watermark is presented in this paper. As watermark information, image feature of the adjacent blocks are embedded to the face image. And primitive face images are not needed when recovering the watermark. So face image integrity can be well confirmed, and the algorithm can detect whether the face image is the original one and identify whether the face image is attacked by malicious aim-such as tampering, replacing or illegally adding. Experimental results show that the algorithm with good invisibility and excellent robustness has no interference on face recognition rate, and it can position the specific tampered location of human face image.

Face Recognition by PCA and Improved LBP Fusion Algorithm

2015 ◽  
Vol 734 ◽  
pp. 562-567 ◽  
Author(s):  
En Zeng Dong ◽  
Yan Hong Fu ◽  
Ji Gang Tong
Keyword(s):  
Face Recognition ◽  
Recognition Rate ◽  
Texture Feature ◽  
Principal Component ◽  
Texture Features ◽  
Rotation Invariant ◽  
Fusion Algorithm ◽  
Face Images ◽  
The Face ◽  
Pca Method

This paper proposed a theoretically efficient approach for face recognition based on principal component analysis (PCA) and rotation invariant uniform local binary pattern texture features in order to weaken the effects of varying illumination conditions and facial expressions. Firstly, the rotation invariant uniform LBP operator was adopted to extract the local texture feature of the face images. Then PCA method was used to reduce the dimensionality of the extracted feature and get the eigenfaces. Finally, the nearest distance classification was used to distinguish each face. The method has been accessed on Yale and ATR-Jaffe face databases. Results demonstrate that the proposed method is superior to standard PCA and its recognition rate is higher than the traditional PCA. And the proposed algorithm has strong robustness against the illumination changes, pose, rotation and expressions.

Sign in / Sign up

Export Citation Format

Share Document