High performance and fast face recognition technique based on components of phases of face images

2009 ◽  
Author(s):  
Naser Zaeri ◽  
Abdallah Cherri
2013 ◽  
Vol 4 (1) ◽  
pp. 81-102 ◽  
Author(s):  
Arindam Kar ◽  
Debotosh Bhattacharjee ◽  
Mita Nasipuri ◽  
Dipak Kumar Basu ◽  
Mahantapas Kundu

This paper introduces a novel methodology that combines the multi-resolution feature of the Gabor wavelet transformation (GWT) with the local interactions of the facial structures expressed through the Pseudo Hidden Markov Model (PHMM). Unlike the traditional zigzag scanning method for feature extraction a continuous scanning method from top-left corner to right then top-down and right to left and so on until right-bottom of the image i.e., a spiral scanning technique has been proposed for better feature selection. Unlike traditional HMMs, the proposed PHMM does not perform the state conditional independence of the visible observation sequence assumption. This is achieved via the concept of local structures introduced by the PHMM used to extract facial bands and automatically select the most informative features of a face image. Thus, the long-range dependency problem inherent to traditional HMMs has been drastically reduced. Again with the use of most informative pixels rather than the whole image makes the proposed method reasonably faster for face recognition. This method has been successfully tested on frontal face images from the ORL, FRAV2D, and FERET face databases where the images vary in pose, illumination, expression, and scale. The FERET data set contains 2200 frontal face images of 200 subjects, while the FRAV2D data set consists of 1100 images of 100 subjects and the full ORL database is considered. The results reported in this application are far better than the recent and most referred systems.


Author(s):  
Edy Winarno ◽  
Agus Harjoko ◽  
Aniati Murni Arymurthy ◽  
Edi Winarko

<p>The main problem in face recognition system based on half-face pattern is how to anticipate poses and illuminance variations to improve recognition rate. To solve this problem, we can use two lenses on stereo vision camera in face recognition system. Stereo vision camera has left and right lenses that can be used to produce a 2D image of each lens. Stereo vision camera in face recognition has capability to produce two of 2D face images with a different angle. Both angle of the face image will produce a detailed image of the face and better lighting levels on each of the left and right lenses. In this study, we proposed a face recognition technique, using 2 lens on a stereo vision camera namely symmetrical half-join. Symmetrical half-join is a method of normalizing the image of the face detection on each of the left and right lenses in stereo vision camera, then cropping and merging at each image. Tests on face recognition rate based on the variety of poses and variations in illumination shows that the symmetrical half-join method is able to provide a high accuracy of face recognition and can anticipate variations in given pose and illumination variations. The proposed model is able to produce 86% -97% recognition rate on a variety of poses and variations in angles between 0 °- 22.5 °. The variation of illuminance measured using a lux meter can result in 90% -100% recognition rate for the category of at least dim lighting levels (above 10 lux).</p>


Author(s):  
Edy Winarno ◽  
Agus Harjoko ◽  
Aniati Murni Arymurthy ◽  
Edi Winarko

<p>The main problem in face recognition system based on half-face pattern is how to anticipate poses and illuminance variations to improve recognition rate. To solve this problem, we can use two lenses on stereo vision camera in face recognition system. Stereo vision camera has left and right lenses that can be used to produce a 2D image of each lens. Stereo vision camera in face recognition has capability to produce two of 2D face images with a different angle. Both angle of the face image will produce a detailed image of the face and better lighting levels on each of the left and right lenses. In this study, we proposed a face recognition technique, using 2 lens on a stereo vision camera namely symmetrical half-join. Symmetrical half-join is a method of normalizing the image of the face detection on each of the left and right lenses in stereo vision camera, then cropping and merging at each image. Tests on face recognition rate based on the variety of poses and variations in illumination shows that the symmetrical half-join method is able to provide a high accuracy of face recognition and can anticipate variations in given pose and illumination variations. The proposed model is able to produce 86% -97% recognition rate on a variety of poses and variations in angles between 0 °- 22.5 °. The variation of illuminance measured using a lux meter can result in 90% -100% recognition rate for the category of at least dim lighting levels (above 10 lux).</p>


2015 ◽  
Vol 713-715 ◽  
pp. 2160-2164
Author(s):  
Zhao Nan Yang ◽  
Shu Zhang

A new similarity measurement standard is proposed, namely background similarity matching. Learning algorithm based on kernel function is utilized in the method for feature extraction and classification of face image. Meanwhile, a real-time video face recognition method is proposed, image binary algorithm in similarity calculation is introduced, and a video face recognition system is designed and implemented [1-2]. The system is provided with a camera to obtain face images, and face recognition is realized through image preprocessing, face detection and positioning, feature extraction, feature learning and matching. Design, image preprocessing, feature positioning and extraction, face recognition and other major technologies of face recognition systems are introduced in details. Lookup mode from top down is improved, thereby improving lookup accuracy and speed [3-4]. The experimental results showed that the method has high recognition rate. Higher recognition rate still can be obtained even for limited change images of face images and face gesture with slightly uneven illumination. Meanwhile, training speed and recognition speed of the method are very fast, thereby fully meeting real-time requirements of face recognition system [5]. The system has certain face recognition function and can well recognize front faces.


Entropy ◽  
2021 ◽  
Vol 23 (7) ◽  
pp. 878
Author(s):  
C. T. J. Dodson ◽  
John Soldera ◽  
Jacob Scharcanski

Secure user access to devices and datasets is widely enabled by fingerprint or face recognition. Organization of the necessarily large secure digital object datasets, with objects having content that may consist of images, text, video or audio, involves efficient classification and feature retrieval processing. This usually will require multidimensional methods applicable to data that is represented through a family of probability distributions. Then information geometry is an appropriate context in which to provide for such analytic work, whether with maximum likelihood fitted distributions or empirical frequency distributions. The important provision is of a natural geometric measure structure on families of probability distributions by representing them as Riemannian manifolds. Then the distributions are points lying in this geometrical manifold, different features can be identified and dissimilarities computed, so that neighbourhoods of objects nearby a given example object can be constructed. This can reveal clustering and projections onto smaller eigen-subspaces which can make comparisons easier to interpret. Geodesic distances can be used as a natural dissimilarity metric applied over data described by probability distributions. Exploring this property, we propose a new face recognition method which scores dissimilarities between face images by multiplying geodesic distance approximations between 3-variate RGB Gaussians representative of colour face images, and also obtaining joint probabilities. The experimental results show that this new method is more successful in recognition rates than published comparative state-of-the-art methods.


2021 ◽  
pp. 1-11
Author(s):  
Suphawimon Phawinee ◽  
Jing-Fang Cai ◽  
Zhe-Yu Guo ◽  
Hao-Ze Zheng ◽  
Guan-Chen Chen

Internet of Things is considerably increasing the levels of convenience at homes. The smart door lock is an entry product for smart homes. This work used Raspberry Pi, because of its low cost, as the main control board to apply face recognition technology to a door lock. The installation of the control sensing module with the GPIO expansion function of Raspberry Pi also improved the antitheft mechanism of the door lock. For ease of use, a mobile application (hereafter, app) was developed for users to upload their face images for processing. The app sends the images to Firebase and then the program downloads the images and captures the face as a training set. The face detection system was designed on the basis of machine learning and equipped with a Haar built-in OpenCV graphics recognition program. The system used four training methods: convolutional neural network, VGG-16, VGG-19, and ResNet50. After the training process, the program could recognize the user’s face to open the door lock. A prototype was constructed that could control the door lock and the antitheft system and stream real-time images from the camera to the app.


Electronics ◽  
2021 ◽  
Vol 10 (9) ◽  
pp. 1013
Author(s):  
Sayan Maity ◽  
Mohamed Abdel-Mottaleb ◽  
Shihab S. Asfour

Biometric identification using surveillance video has attracted the attention of many researchers as it can be applicable not only for robust identification but also personalized activity monitoring. In this paper, we present a novel multimodal recognition system that extracts frontal gait and low-resolution face images from frontal walking surveillance video clips to perform efficient biometric recognition. The proposed study addresses two important issues in surveillance video that did not receive appropriate attention in the past. First, it consolidates the model-free and model-based gait feature extraction approaches to perform robust gait recognition only using the frontal view. Second, it uses a low-resolution face recognition approach which can be trained and tested using low-resolution face information. This eliminates the need for obtaining high-resolution face images to create the gallery, which is required in the majority of low-resolution face recognition techniques. Moreover, the classification accuracy on high-resolution face images is considerably higher. Previous studies on frontal gait recognition incorporate assumptions to approximate the average gait cycle. However, we quantify the gait cycle precisely for each subject using only the frontal gait information. The approaches available in the literature use the high resolution images obtained in a controlled environment to train the recognition system. However, in our proposed system we train the recognition algorithm using the low-resolution face images captured in the unconstrained environment. The proposed system has two components, one is responsible for performing frontal gait recognition and one is responsible for low-resolution face recognition. Later, score level fusion is performed to fuse the results of the frontal gait recognition and the low-resolution face recognition. Experiments conducted on the Face and Ocular Challenge Series (FOCS) dataset resulted in a 93.5% Rank-1 for frontal gait recognition and 82.92% Rank-1 for low-resolution face recognition, respectively. The score level multimodal fusion resulted in 95.9% Rank-1 recognition, which demonstrates the superiority and robustness of the proposed approach.


2014 ◽  
Vol 889-890 ◽  
pp. 1065-1068
Author(s):  
Yu’e Lin ◽  
Xing Zhu Liang ◽  
Hua Ping Zhou

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.


Sign in / Sign up

Export Citation Format

Share Document