Human Detection and Face Recognition Using 3D Structure of Head and Face Surfaces Detected by RGB-D Sensor

2015 ◽  
Vol 27 (6) ◽  
pp. 691-697 ◽  
Author(s):  
Michio Tanaka ◽  
◽  
Hiroki Matsubara ◽  
Takashi Morie
Keyword(s):  
Face Recognition ◽  
Graph Matching ◽  
Recognition Rate ◽  
3D Structure ◽  
Facial Feature ◽  
Human Detection ◽  
Service Robots ◽  
Depth Information ◽  
Home Service ◽  
Postural Changes

<div class=""abs_img""><img src=""[disp_template_path]/JRM/abst-image/00270006/11.jpg"" width=""300"" /> Summary of proposed method</div>Home service robots must possess the ability to communicate with humans, for which human detection and recognition methods are particularly important. This paper proposes methods for human detection and face recognition that are based on image processing, and are suitable for home service robots. For the human detection method, we combine the method proposed by Xia et al. based on the use of head shape with the results of region segmentation based on depth information, and use the positional relations of the detected points. We obtained a detection rate of 98.1% when the method was evaluated for various postures and facing directions. We demonstrate the robustness of the proposed method against postural changes such as stretching the arms, resting the chin on one’s hands, and drinking beverages. For the human recognition method, we combine the elastic bunch graph matching method proposed by Wiskott et al. with Face Tracking SDK to extract facial feature points, and use the 3D information in the deformation computation; we obtained a recognition rate of 93.6% during evaluation.

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.

Face Recognition Based on Template Matching and Skin-Color Segmentation

2011 ◽  
Vol 271-273 ◽  
pp. 165-170 ◽  
Author(s):  
Zhi Wen Wang ◽  
Shao Zi Li
Keyword(s):  
Face Recognition ◽  
Skin Color ◽  
Template Matching ◽  
Recognition Rate ◽  
Color Space ◽  
Facial Feature ◽  
Gaussian Mixture ◽  
Color Segmentation ◽  
Human Faces ◽  
The Impact

In order to overcome these deficiencies that computation of recognition algorithm based on template matching is very high and the recognition rate of recognition algorithms based on skin-color segmentation is low, and is vulnerable to the impact of background which is similar with skin-color, face recognition algrithom based on skin color segmentation and template matching is presented in this paper. According to the clustering properties that the skin-color of human faces have emerged in the YCbCr color space, the regions closing to facial skin color are separated from the image by using Gaussian mixture model in order to achieve the purpose of rapidly detecting the external face of human face. Adaptive template matching is used to overcome the affect of the backgrounds which are similar with skin color on face recognition. Computation in the matching process is reduced by using the second matching algorithm. Extraction of face images by using singular value features is used to identify faces and to reduce the dimensions of the eigenvalue matrix in the course of facial feature extraction. Experimental results show that proposed method can rapidly recongnise human faces, and improve the accuracy of face recognition.

PERFORMANCE ANALYSIS OF FACE RECOGNITION ALGORITHMS ON KOREAN FACE DATABASE

2007 ◽  
Vol 21 (06) ◽  
pp. 1017-1033 ◽  
Author(s):  
MYUNG-CHEOL ROH ◽  
SEONG-WHAN LEE
Keyword(s):  
Face Recognition ◽  
Recognition Rate ◽  
Principal Component ◽  
Ground Truth ◽  
Facial Feature ◽  
Recognition Algorithm ◽  
Video Data ◽  
Face Database ◽  
Recognition Algorithms ◽  
Different Characteristics

Human face is one of the most common and useful keys to a person's identity. Although, a number of face recognition algorithms have been proposed, many researchers believe that the technology should be improved further in order to overcome the instability caused by variable illuminations, expressions, poses and accessories. To analyze these face recognition algorithm, it is indispensable to collect various data as much as possible. Face databases such as CMU PIE (USA), FERET (USA), AR Face DB (USA) and XM2VTS (UK) are the representative ones commonly used. However, many databases do not provide adequately annotated information of the pose angle, illumination angle, illumination color and ground-truth. Mostly, they do not include large enough number of images and video data taken under various environments. Furthermore, the faces on these databases have different characteristics from those of Asian. Thus, we have designed and constructed a Korean Face Database (KFDB) which includes not only images but also video clips, ground-truth information of facial feature points and descriptions of subjects and environment conditions so that it can be used for general purposes. In this paper, we present the KFDB which contains image and video data for 1920 subjects and has been constructed in 3 years (sessions). We also present recognition results by CM (Correlation Matching) and PCA (Principal Component Analysis) which are used as baseline algorithms upon CMU PIE and KFDB, so as to understand how recognition rate is changed by altering image taking conditions.

Kernel Null Space Marginal Fisher Analysis for Face Recognition

2014 ◽  
Vol 889-890 ◽  
pp. 1065-1068
Author(s):  
Yu’e Lin ◽  
Xing Zhu Liang ◽  
Hua Ping Zhou
Keyword(s):  
Feature Extraction ◽  
Face Recognition ◽  
Sample Size ◽  
High Performance ◽  
Null Space ◽  
Small Sample Size ◽  
Recognition Rate ◽  
Original Data ◽  
Small Sample ◽  
Neighborhood Structure

In the recent years, the feature extraction algorithms based on manifold learning, which attempt to project the original data into a lower dimensional feature space by preserving the local neighborhood structure, have drawn much attention. Among them, the Marginal Fisher Analysis (MFA) achieved high performance for face recognition. However, MFA suffers from the small sample size problems and is still a linear technique. This paper develops a new nonlinear feature extraction algorithm, called Kernel Null Space Marginal Fisher Analysis (KNSMFA). KNSMFA based on a new optimization criterion is presented, which means that all the discriminant vectors can be calculated in the null space of the within-class scatter. KNSMFA not only exploits the nonlinear features but also overcomes the small sample size problems. Experimental results on ORL database indicate that the proposed method achieves higher recognition rate than the MFA method and some existing kernel feature extraction algorithms.

HUMAN FACE RECOGNITION FROM A SINGLE FRONT VIEW

1992 ◽  
Vol 06 (04) ◽  
pp. 571-593 ◽  
Author(s):  
CHING-WEN CHEN ◽  
CHUNG-LIN HUANG
Keyword(s):  
Face Recognition ◽  
Active Contour Model ◽  
Facial Feature ◽  
Recognition System ◽  
Facial Features ◽  
Human Face Recognition ◽  
Front View ◽  
Deformable Template ◽  
Face Recognition System ◽  
Feature Values

This paper presents a face recognition system which can identify the unknown identity effectively using the front-view facial features. In front-view facial feature extractions, we can capture the contours of eyes and mouth by the deformable template model because of their analytically describable shapes. However, the shapes of eyebrows, nostrils and face are difficult to model using a deformable template. We extract them by using the active contour model (snake). After the contours of all facial features have been captured, we calculate effective feature values from these extracted contours and construct databases for unknown identities classification. In the database generation phase, 12 models are photographed, and feature vectors are calculated for each portrait. In the identification phase if any one of these 12 persons has his picture taken again, the system can recognize his identity.

scholarly journals A Novel Approach of Low-Light Image Denoising for Face Recognition

2014 ◽  
Vol 6 ◽  
pp. 256790
Author(s):  
Yimei Kang ◽  
Wang Pan
Keyword(s):  
Face Recognition ◽  
Image Denoising ◽  
Recognition Rate ◽  
Low Frequency ◽  
Frequency Noise ◽  
Low Frequency Noise ◽  
Face Database ◽  
Low Light ◽  
Very Low Frequency ◽  
Light Image

Illumination variation makes automatic face recognition a challenging task, especially in low light environments. A very simple and efficient novel low-light image denoising of low frequency noise (DeLFN) is proposed. The noise frequency distribution of low-light images is presented based on massive experimental results. The low and very low frequency noise are dominant in low light conditions. DeLFN is a three-level image denoising method. The first level denoises mixed noises by histogram equalization (HE) to improve overall contrast. The second level denoises low frequency noise by logarithmic transformation (LOG) to enhance the image detail. The third level denoises residual very low frequency noise by high-pass filtering to recover more features of the true images. The PCA (Principal Component Analysis) recognition method is applied to test recognition rate of the preprocessed face images with DeLFN. DeLFN are compared with several representative illumination preprocessing methods on the Yale Face Database B, the Extended Yale face database B, and the CMU PIE face database, respectively. DeLFN not only outperformed other algorithms in improving visual quality and face recognition rate, but also is simpler and computationally efficient for real time applications.

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 Invariant Face Recognition

2020 ◽  
Vol 10 (3) ◽  
pp. 129
Author(s):  
Regina Lionnie ◽  
Mochamad Miftakhul Huda ◽  
Mudrik Alaydrus
Keyword(s):  
Face Recognition ◽  
Local Binary Pattern ◽  
Cross Validation ◽  
Graph Matching ◽  
Illumination Invariant ◽  
Fold Cross Validation

Face recognition adalah bidang penelitian yang selalu menjadi topik penelitian dengan peminatan yang sangat besar. Berbagai potensial pengembangan aplikasi, dari sistem keamanan individu hingga untuk sistem control dan sistem surveillance. Algoritma pengenalan wajah telah diusulkan oleh banyak peneliti. Metode pengenalan wajah dengan performa yang baik seperti eigenfaces, fisherfaces, jaringan saraf tiruan, elastic bunch graph matching, laplacian faces, dan lainnya. Performa dari algoritma ini awalnya diuji pada gambar wajah yang dikumpulkan di bawah lingkungan kontrol yang baik pada kondisi studio dan pencahayaan yang diatur, dan karenanya, sebagian besar mengalami kesulitan dalam mengatasi gambar alami, yang dapat ditangkap di bawah kondisi pencahayaan, pose, dan ekspresi wajah yang sangat bervariasi. Situasi menjadi lebih menantang ketika kombinasi variasi ini harus ditangani secara bersamaan. Kondisi pencahayaan berbeda menimbulkan hambatan vital dalam sistem pengenalan karena mereka sangat mempengaruhi penampilan gambar wajah dan meningkatkan variasi antar kelas. Pada penelitian ini, telah dibangun sistem pengenalan wajah menggunakan Local Binary Pattern (LBP) dengan total gambar pada basis data sebanyak 400 gambar yang diambil dari 25 kelas/responden. Menggunakan 2-fold cross validation dan jarak Euclidean, presisi tertinggi yang diraih system adalah sebesar 87,98% dengan variasi ekualisasi histogram tanpa menggunakan LBP.

Sign in / Sign up

Export Citation Format

Share Document