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

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.

2020 ◽  
Vol 2020 ◽  
pp. 1-11
Author(s):  
Tongxin Wei ◽  
Qingbao Li ◽  
Jinjin Liu ◽  
Ping Zhang ◽  
Zhifeng Chen

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.


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.


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.


Author(s):  
Stefano Berretti ◽  
Alberto Del Bimbo ◽  
Pietro Pala

In this paper, an original hybrid 2D-3D face recognition approach is proposed using two orthogonal face images, frontal and side views of the face, to reconstruct the complete 3D geometry of the face. This is obtained using a model based solution, in which a 3D template face model is morphed according to the correspondence of a limited set of control points identified on the frontal and side images in addition to the model. Control points identification is driven by an Active Shape Model applied to the frontal image, whereas subsequent manual assistance is required for control points localization on the side view. The reconstructed 3D model is finally matched, using the iso-geodesic regions approach against a gallery of 3D face scans for the purpose of face recognition. Preliminary experimental results are provided on a small database showing the viability of the approach.


2011 ◽  
Vol 121-126 ◽  
pp. 609-616
Author(s):  
Dao Qing Sheng ◽  
Guo Yue Chen ◽  
Kazuki Saruta ◽  
Yuki Terata

In this paper, an approach based on local curvature feature matching for 3D face recognition is proposed. K-L transformation is employed to adjust coordinate system and coarsely align 3D point cloud. Based on B-splines approximation, 3D facial surface reconstruction is implemented. Through analyzing curvature features of the fitted surface, local rigid facial patches are extracted. According to the extracted local patches, feature vectors are constructed to execute final recognition. Experimental results demonstrate high performance of the presented method and also show that the method is fairly effective for 3D face recognition.


2021 ◽  
Vol 2021 ◽  
pp. 1-8
Author(s):  
Louis Asiedu ◽  
Bernard O. Essah ◽  
Samuel Iddi ◽  
K. Doku-Amponsah ◽  
Felix O. Mettle

The face is the second most important biometric part of the human body, next to the finger print. Recognition of face image with partial occlusion (half image) is an intractable exercise as occlusions affect the performance of the recognition module. To this end, occluded images are sometimes reconstructed or completed with some imputation mechanism before recognition. This study assessed the performance of the principal component analysis and singular value decomposition algorithm using discrete wavelet transform (DWT-PCA/SVD) as preprocessing mechanism on the reconstructed face image database. The reconstruction of the half face images was done leveraging on the property of bilateral symmetry of frontal faces. Numerical assessment of the performance of the adopted recognition algorithm gave average recognition rates of 95% and 75% when left and right reconstructed face images were used for recognition, respectively. It was evident from the statistical assessment that the DWT-PCA/SVD algorithm gives relatively lower average recognition distance for the left reconstructed face images. DWT-PCA/SVD is therefore recommended as a suitable algorithm for recognizing face images under partial occlusion (half face images). The algorithm performs relatively better on left reconstructed face images.


2019 ◽  
Vol 16 (3) ◽  
pp. 172988141985171 ◽  
Author(s):  
Naeem Iqbal Ratyal ◽  
Imtiaz Ahmad Taj ◽  
Muhammad Sajid ◽  
Nouman Ali ◽  
Anzar Mahmood ◽  
...  

Face recognition underpins numerous applications; however, the task is still challenging mainly due to the variability of facial pose appearance. The existing methods show competitive performance but they are still short of what is needed. This article presents an effective three-dimensional pose invariant face recognition approach based on subject-specific descriptors. This results in state-of-the-art performance and delivers competitive accuracies. In our method, the face images are registered by transforming their acquisition pose into frontal view using three-dimensional variance of the facial data. The face recognition algorithm is initialized by detecting iso-depth curves in a coordinate plane perpendicular to the subject gaze direction. In this plane, discriminating keypoints are detected on the iso-depth curves of the facial manifold to define subject-specific descriptors using subject-specific regions. Importantly, the proposed descriptors employ Kernel Fisher Analysis-based features leading to the face recognition process. The proposed approach classifies unseen faces by pooling performance figures obtained from underlying classification algorithms. On the challenging data sets, FRGC v2.0 and GavabDB, our method obtains face recognition accuracies of 99.8% and 100% yielding superior performance compared to the existing methods.


2014 ◽  
Vol 2014 ◽  
pp. 1-12 ◽  
Author(s):  
Jun Huang ◽  
Kehua Su ◽  
Jamal El-Den ◽  
Tao Hu ◽  
Junlong Li

We proposed a face recognition algorithm based on both the multilinear principal component analysis (MPCA) and linear discriminant analysis (LDA). Compared with current traditional existing face recognition methods, our approach treats face images as multidimensional tensor in order to find the optimal tensor subspace for accomplishing dimension reduction. The LDA is used to project samples to a new discriminant feature space, while theKnearest neighbor (KNN) is adopted for sample set classification. The results of our study and the developed algorithm are validated with face databases ORL, FERET, and YALE and compared with PCA, MPCA, and PCA + LDA methods, which demonstrates an improvement in face recognition accuracy.


2021 ◽  
Vol 19 (2) ◽  
pp. 1373-1387
Author(s):  
Zilong Liu ◽  
◽  
Jingbing Li ◽  
Jing Liu ◽  
◽  
...  

<abstract> <p>With the popularization and application of face recognition technology, a large number of face image data are spread and used on the Internet. It has brought great potential safety hazard for personal privacy. Combined with the characteristics of tent chaos and Henon chaos, a THM (tent-Henon map) chaotic encrypted face algorithm based on Ridgelet-DCT transform is proposed in this paper. Different from conventional face recognition methods, this new approach encryptes the face images by means of using the homomorphic encryption method to extract their visual robust features in the first place, and then uses the proposed neural network model to design the encrypted face recognition algorithm. This paper selects the ORL face database of Cambridge University to verify the algorithm. Experimental results show that the algorithm has a good performance in encryption effect, security and robustness, and has a broad application prospect.</p> </abstract>


2018 ◽  
Vol 2018 ◽  
pp. 1-9 ◽  
Author(s):  
Kun Sun ◽  
Xin Yin ◽  
Mingxin Yang ◽  
Yang Wang ◽  
Jianying Fan

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.


Sign in / Sign up

Export Citation Format

Share Document