Face recognition using phase-based correspondence matching

In this paper a novel coded multi-dimensional spreading technique using the Discrete Fourier Transform (DFT) is introduced. It exploits the DFT characteristic of spreading one symbol in one domain to all the symbols in the corresponding transform domain. Frequency domain channel estimation is performed at the receiver. The performance of a coded twodimensional (2D) DFT spreading communication system is investigated and simulation results are presented, using first a 2D DFT time-frequency system and then a 2D DFT space-frequency system. The proposed 2D DFT system shows good immunity to narrowband interference and impulse noise and exhibits a significant performance improvement when compared with a coded conventional OFDM system of equivalent size.

This paper develops a novel face recognition technique called Complete Gabor Fisher Classifier (CGFC). Different from existing techniques that use Gabor filters for deriving the Gabor face representation, the proposed approach does not rely solely on Gabor magnitude information but effectively uses features computed based on Gabor phase information as well. It represents one of the few successful attempts found in the literature of combining Gabor magnitude and phase information for robust face recognition. The novelty of the proposed CGFC technique comes from (1) the introduction of a Gabor phase-based face representation and (2) the combination of the recognition technique using the proposed representation with classical Gabor magnitude-based methods into a unified framework. The proposed face recognition framework is assessed in a series of face verification and identification experiments performed on the XM2VTS, Extended YaleB, FERET, and AR databases. The results of the assessment suggest that the proposed technique clearly outperforms state-of-the-art face recognition techniques from the literature and that its performance is almost unaffected by the presence of partial occlusions of the facial area, changes in facial expression, or severe illumination changes. 1.

Face Recognition is an efficient technique and one of the most liked biometric software application for the identification and verification of specific individual in a digital image by analysing and comparing patterns. This paper presents a survey on well-known techniques of face recognition. The primary goal of this review is to observe the performance of different face recognition algorithms such as SVM (Support Vector Machine), CNN (Convolutional Neural Network), Eigenface based algorithm, Gabor Wavelet, PCA (Principle Component Analysis) and HMM (Hidden Markov Model). It presents comparative analysis about the efficiency of each algorithm. This paper also figure out about various face recognition applications used in real world and face recognition challenges like Illumination Variation, Pose Variation, Occlusion, Expressions Variation, Low Resolution and Ageing in brief. Another interesting component covered in this paper is review of datasets available for face recognition. So, must needed survey of many recently introduced face recognition aspects and algorithms are presented.

Facial recognition is a feature that uses facial detection algorithms to detect a face and then invokes facial recognition algorithms to try to match the person’s face. First, a person’s face needs to be enrolled; during enrollment, the person’s facial details are saved in a database—in this case, a mobile phone. The facial recognition algorithm uses this database to match the currently presented face with the faces saved in the database. The efficiency of a facial recognition algorithm depends upon the speed at which it can detect and recognize faces. The problem we address in this paper is that a reliable, automated method for testing facial recognition features in mobile phones. Because the multimedia capabilities of smartphones have expanded phenomenally, the need for thoroughly testing facial recognition algorithms has become crucial. The uses of facial recognition can range from facial authentication for unlocking phones to security for a number of other applications. To meet these needs, a reliable, automated test for validating the facial recognition algorithms must be developed. The challenge for the software test team was to automate the test cases, which involve tilting the phone at specific angles from the test subject. The permissible angular movements of the phone are determined by the algorithmic specifications of the facial recognition algorithm. We tested scenarios involving multiple faces, motion blur, panning the phone in front of the test subject faces at various speeds, and so on. We adopted a robotic arm to perform the facial recognition test cases and developed software to program the robotic arm to test the phone’s facial recognition software for functionality, performance, and stability as well as adversarial tests. This paper discusses the computer vision use case for facial recognition and describes how we developed an automated facial recognition test suite using a robotic arm.

Attendance marking in a classroom during a lecture is not only a onerous task but also a time consuming one at that. Due to an unusually high number of students present during the lecture there will always be a probability of proxy attendance(s).Attendance marking with conventional methods has been an area of challenge. The growing need of efficient and automatic techniques of marking attendance is a growing challenge in the area of face recognition. In recent years, the problem of automatic attendance marking has been widely addressed through the use of standard biometrics like fingerprint and Radio frequency Identification tags etc., However,these techniques lack the element of reliability. In this proposed project an automated attendance marking and management system is proposed by making use of face detection and recognition algorithms. Instead of using the conventional methods, this proposed system aims to develop an automated system that records the student’s attendance by using facial recognition technology. The main objective of this work is to make the attendance marking and management system efficient, time saving, simple and easy. Here faces will be recognized using face recognition algorithms. The processed image will then be compared against the existing stored record and then attendance is marked in the database accordingly. Compared to existing system traditional attendance marking system, this system reduces the workload of people. This proposed system will be implemented with 4 phases such as Image Capturing, Segmentation of group image and Face Detection, Face comparison and Recognition, Updating of Attendance in database.

In this paper, face recognition algorithms under three low-quality conditions, namely, complex illumination, low resolution and partial occlusion, are summarized, and relatively new face recognition algorithms under low-quality conditions are introduced and explained. Such as the algorithm of face recognition with occlusion based on partition, face recognition algorithm based on Iteratively Reweighted Robust Principal Component and face recognition with occlusion based on MEBML, illumination face recognition based on RPCA and Convolutional Neural Network, face recognition based on Illumination Normalization and Block-based Adaptive Local Ternary Pattern, low-resolution face recognition based on blocking CS-LBP and weighted PCA algorithm, pose Robust low-resolution face recognition via CKEDA and other face recognition algorithm under low-quality conditions. The existing problems and development trend of face recognition under low quality conditions are analyzed.

We propose a novel method to improve the performance of existing three dimensional (3D) human face recognition algorithms that employ Euclidean distances between facial fiducial points as features. We further investigate a novel 3D face recognition algorithm that employs geodesic and Euclidean distances between facial fiducial points. We demonstrate that this algorithm is robust to changes in facial expression. Geodesic and Euclidean distances were calculated between pairs of 25 facial fiducial points. For the proposed algorithm, geodesic distances and 'global curvature' characteristics, defined as the ratio of geodesic to Euclidean distance between a pairs of points, were employed as features. The most discriminatory features were selected using stepwise linear discriminant analysis (LDA). These were projected onto 11 LDA directions, and face models were matched using the Euclidean distance metric. With a gallery set containing one image each of 105 subjects and a probe set containing 663 images of the same subjects, the algorithm produced EER=1.4% and a rank 1 RR=98.64%. It performed significantly better than existing algorithms based on principal component analysis and LDA applied to face range images. Its verification performance for expressive faces was also significantly better than an algorithm that employed Euclidean distances between facial fiducial points as features.

— Modern advances in reconfigurable analog technologies are allowing field-programmable analog arrays (FPAAs) to dramatically grow in size, flexibility, and usefulness. This paper presents rapid prototyping results of a bandpass filter as a sample analog circuit using our floating-gate based large-scale FPAA. A major source of parasitics introduced during the circuit mapping process is interconnect switches used for routing. Our goal is to obtain models of the mapped circuits that can be simulated using SPICE in order to observe the impact of interconnect parasitics on the relevant analog metrics. Our results indicate that the mapped analog circuits obtain desired responses even with interconnect parasitics, clearly demonstrating the practicality of our FPAA. I.

Current automatic facial recognition systems are not robust against changes in illumination, pose, facial expression and occlusion. In this paper, we propose an algorithm based on a probabilistic approach for face recognition to address the problem of pose change by a probabilistic approach that takes into account the pose difference between probe and gallery images. By using a large facial image database called CMU PIE database, which contains images of the same set of people taken from many different angles, we have developed a probabilistic model of how facial features change as the pose changes. This model enables us to make our face recognition system more robust to the change of poses in the probe image. The experimental results show that this approach achieves a better recognition rate than conventional face recognition methods over a much larger range of pose. For example, when the gallery contains only images of a frontal face and the probe image varies its pose orientation, the recognition rate remains within a less than 10% difference until the probe pose begins to differ more than 45 degrees, whereas the recognition rate of a PCA-based method begins to drop at a difference as small as 10 degrees, and a representative commercial system at 30 degrees.

A bi-modal face recognition framework integrating facial expression with facial appearance

The last decade has seen automatic face recognition evolve from small-scale research systems to a wide range of commercial products. Driven by the FERET face database and evaluation protocol, the currently best commercial systems achieve verification accuracies comparable to those of fingerprint recognizers. In these experiments, only frontal face images taken under controlled lighting conditions were used. As the use of face recognition systems expands toward less restricted environments, the development of algorithms for view and illumination invariant face recognition becomes important. However, the performance of current algorithms degrades significantly when tested across pose and illumination, as documented in a number of evaluations. In this chapter, we review previously proposed algorithms for pose and illumination invariant face recognition. We then describe in detail two successful appearance-based algorithms for face recognition across pose, eigen light-fields, and Bayesian face subregions. We furthermore show how both of these algorithms can be extended toward face recognition across pose and illumination.

Over the course of the last decade, infrared (IR) and particularly thermal IR imaging based face recognition has emerged as a promising complement to conventional, visible spectrum based approaches which continue to struggle when applied in the real world. While inherently insensitive to visible spectrum illumination changes, IR images introduce specific challenges of their own, most notably sensitivity to factors which affect facial heat emission patterns, e.g. emotional state, ambient temperature, and alcohol intake. In addition, facial expression and pose changes are more difficult to correct in IR images because they are less rich in high frequency detail which is an important cue for fitting any deformable model. In this paper we describe a novel method which addresses these major challenges. Specifically, to normalize for pose and facial expression changes we generate a synthetic frontal image of a face in a canonical, neutral facial expression from an image of the face in an arbitrary pose and facial expression. This is achieved by piecewise affine warping which follows active appearance model (AAM) fitting. This is the first publication which explores the use of an AAM on thermal IR images; we propose a pre-processing step which enhances detail in thermal images, making AAM convergence faster and more accurate. To overcome the problem of thermal IR image sensitivity to the exact pattern of facial temperature emissions we describe a representation based on reliable anatomical features. In contrast to previous approaches, our representation is not binary; rather, our method accounts for the reliability of the extracted features. This makes the proposed representation much more robust both to pose and scale changes. The effectiveness of the proposed approach is demonstrated on the largest public database of thermal IR images of faces on which it achieved 100% identification rate, significantly outperforming previously described methods.

Facial images are of critical importance in many real-world applications from gaming to surveillance. The current literature on facial image analysis, from face detection to face and facial expression recognition, are mainly performed in either RGB, Depth (D), or both of these modalities. But, such analyzes have rarely included Thermal (T) modality. This paper paves the way for performing such facial analyzes using synchronized RGB-D-T facial images by introducing a database of 51 persons including facial images of different rotations, illuminations, and expressions. Furthermore, a face recognition algorithm has been developed to use these images. The experimental results show that face recognition using such three modalities provides better results compared to face recognition in any of such modalities in most of the cases.

The sparse representation based classification (SRC) can effectively improve the face recognition rate. Smoothed l 0 algorithm has much faster calculation speed and requires fewer measured values than the other sparse representation method. In this paper, the sparse representation and smoothed l 0 algorithm for face recognition are presented to improve the face recognition under various conditions such as face disguise, illumination and pose changes, etc. The experiments on the AR, Extended Yale B and FERET face database verify the effectiveness of the presented method. The experimental results show that the face recognition algorithm increases to a certain extent in terms of recognition robustness and time than the original SRC.

After decades of extensive research, the field of 2D face recognition is fruitful. However, 2D face recognition is sensitive to changes in pose, facial expression and illumination. 3D face recognition has great potential due to the inherent invariance of pose and illumination changes, but these 3D face images are still difficult to acquire due to several issues such as cost and accessibility. In contrast, RGB-D images captured by low-cost depth sensors such as Kinect are relatively easy to acquire, and research on such low-quality inputs is still limited. In this thesis, an end-to-end multimodal fusion method based on spatial and channel attention is proposed to effectively fuse two image modalities, RGB and depth, to enhance RGB-D face recognition. Our work is specified as follows: firstly, three branches combined with the spatial and channel attention modules are established on the basis of ResNet18, so that the features of three modalities (RGB, depth map, and their fusion modalities, respectively) are obtained. The features under these three modalities are then fused, fed into a shared layer, and the fused features are further learned for deeper discriminative features and passed through a spatial attention vectorization module at the end. The method achieves good results on the Intellifusion RGBD dataset, while we perform ablation trials, which well reveal the contribution of each component of our method to the final performance.