Research on the optimal placement of light for face recognition

Brain inspired face recognition: A computational framework

Critical to any automated surveillance system is the recognition component. Since the inception of Pattern Recognition & Image processing, researchers across the globe continue to propose newer facial recognition algorithms. Each of these facial algorithms has its own pros and cons. A typical facial recognition algorithm consists of three steps namely: facial detection, feature extraction and recognition. In this paper we discuss serial and parallel implementation of four standard facial recognition algorithms namely, Principal Component Analysis (PCA), Linear Discriminant Analysis (LDA), Independent Component Analysis (ICA) and FISHER Face. Work presented in this paper consists of two sections. In section 1, we discuss serial and parallel implementation of the algorithms. Section 2, presents a comparative performance analysis of the above 4 algorithms. A major challenge in this effort is the ability to explore and exploit concurrency in existing facial recognition algorithms to improve performance. Based on the algorithms performance, we have made few suggestions regarding the suitability of each of these algorithms for different domains/applications. All algorithms are implemented using open source OPENCV and OPENMP libraries.

This paper introduces a pioneering Hybrid Parallel Multi-linear Face Recognition algorithm that capitalizes on multi-linear methodologies, such as Multi-linear Principal Component Analysis (MPCA), Linear Discriminant Analysis (LDA), and Histogram of Oriented Gradients (HOG), to attain exceptional recognition performance. The Hybrid Feature Selection (HFS) algorithm is meticulously crafted to augment the classification performance on the CK+ and FERET datasets by amalgamating the strengths of feature extraction techniques and feature selection methods. HFS seamlessly incorporates Principal Component Analysis (PCA), Local Discriminant Analysis (LDA), and HOG. The primary aim of this algorithm is to autonomously identify a subset of the most distinctive features from the extracted feature pool, thus elevating classification accuracy, precision, recall, and F1-Score. By amalgamating these methodologies, the algorithm adeptly diminishes dimensionality while conserving pivotal features. Experimental trials on facial image datasets, CK+ and FERET, underscore the algorithm's supremacy in terms of accuracy and computational efficiency when contrasted with conventional linear techniques and even certain deep learning approaches. The proposed algorithm proffers an encouraging solution for real-world face recognition applications where precision and operational efficiency are of paramount significance.

There are many techniques for face recognition which compare the desired face image with a set of faces images stored in a database. Most of these techniques fail if faces images are exposed to high-density noise. Therefore, it is necessary to find a robust method to recognize the corrupted face image with a high density noise. In this work, face recognition algorithm was suggested by using the combination of de-noising filter and PCA. Many studies have shown that PCA has ability to solve the problem of noisy images and dimensionality reduction. However, in cases where faces images are exposed to high noise, the work of PCA in removing noise is useless, therefore adding a strong filter will help to improve the performance of recognizing faces in the case of existing high-density noise in faces images. In this paper, Median filter, Hybrid Median Filter, Adaptive Median filter, and Adaptive Weighted Mean Filter were used to remove the noise from the faces images, and they were compared in order to use the best of these filters as a pre-processing step before the face recognition process. Experimental results showed that the Adaptive Weighted Mean Filter gave better results compared with the other filters. Thus, the performance of face recognition process was improved under high-density noise using the Adaptive Weighted Mean Filter and Principal Component Analysis. For the corrupted images by 90 % noise density, Recognition rate by using Median Filter reached 0% and 33% by using Hybrid Median Filter. While Recognition rate by using the Adaptive Median Filter and Adaptive Weighted Mean Filter reached 100%.

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.

In recent days, there has been increasing need for recognition of unconstrained face images, such as those collected from the web or captured by mobile devices and video surveillance cameras. In such real world scenarios, human faces could be easily occluded by other objects that make the face recognition task as a complex one. Satisfactory performance has been achieved earlier but often only in the controlled environments. But it is very tedious to obtain holistic face images for unconstrained face recognition. Thus, in order to avoid the degradation of face images and the huge variations due to illumination, pose, occlusion and expression, a new Robust Face Recognition approach is proposed. In this approach, the partial face recognition using Scale Invariant Feature Transform (SIFT) technique is combined with Multi-directional Multi-level Dual Cross Patterns (DCP) technique that makes the recognition task as a robust one when compared to other face recognition approaches. Then, the Robust Point Set Matching (RPSM) is used to match the corresponding stable keypoints from both the gallery image and probe face image. Finally, PNN and K-NN classification are used to classify the face images even with the presence of occlusion, random partial crop, illumination, pose and exaggerated facial expression. The proposed robust face recognition system is evaluated based on the performance parameters such as sensitivity, specificity, accuracy, precision and recall.

Face recognition is a process of verifying an individual using facial images and it is widely employed in identifying people on social media platforms, validating identity at ATMs, finding missing persons, controlling access to sensitive areas, finding lost pets, etc. Face recognition is still a trending research area because of various challenges like illumination variations, different poses, and expressions of the person. Here, a novel methodology is introduced for face recognition using Histogram of Oriented Gradients (HOG), histogram of Local Binary Patterns (LBP), and Convolutional Neural Network (CNN). The features from HOG, histogram of LBP, and deep features from the proposed CNN are linearly concatenated to produce the feature space and then classified by Support Vector Machine. The face databases ORL, Extended Yale B, and CMUPIE are used for experimental work and attained a recognition rate of 98.48%, 97.33%, and 97.28% respectively.

Face recognition at a distance is one grand challenge for security surveillance. In this paper, the face images at different distances are simulated by varying image scales (resolutions). The performances of three face recognition algorithms (matchers) are tested with variant image scales (simulating different distances) and with two spectral images (modalities). The three selected matchers are face pattern byte, elastic bunch graph matching, and linear discriminant analysis; while the two modalities are visible and thermal images. The performance of a face recognition system can be measured by accuracy (AC) rate and false accept rate (FAR). To enhance the performance of face recognition especially at a distance, score fusion techniques are applied, which combine several scores from multiple matchers and multiple modalities. Our experiments are conducted with the ASUMS face dataset consisting of two spectral images (visible and thermal) from 135 subjects. The experimental results show that the face recognition with small image scales (simulating long distances) have low performance (e.g., AC=91.36%, FAR=8.64% for 20×20-pixel images); and score fusion can greatly improve accuracy (99.34%) meanwhile reduce FAR (0.31%).

In the era of smart digital transformation, automatic face recognition is the way of identification and verification of a person in many applications of security and authentication. If the person's 2D still image or 3D video frame is taken under controlled lighting and frontal face poses, then today automatic face recognition is a solved problem with more than 98 % accuracy. Under ideal condition of images, automatic face recognition outperforms manual face recognition rate. But the problem of uncontrolled illumination, occlusion, tilting of faces, different expressions of faces, use of accessories and hair color, growth of facial hair, aging effect of a person and low-resolution images makes automatic face recognition underperform; it gets defeated by human. Unless this problem is solved on real time, automatic face recognition system cannot be trusted for crucial security applications like e-passport, fraud detection, counter terrorism and mug-shot verification etc. Extensive research is underway to improve this technology. Traditionally Harr cascade classifier methods, histogram of oriented gradients (HoG), principal component analysis (PCA), Eigen-faces, and support vector machine (SVM) classifier are used in face recognition. Now modern deep learning innovation has superseded those traditional machine learning techniques with more computing power in GPUs and TPUs to tackle all variations in input image quality and ever-growing face database. The goal of this paper is to report the journey of face recognition system from traditional to modern techniques to increase precision and recall of the system.

The first step in an automatic face recognition system is to localize the face region in a cluttered background and carefully segment the face from each frame of a video sequence. In this paper, we propose a fast and efficient algorithm for segmenting a face suitable for recognition from a video sequence. The cluttered background is first subtracted from each frame, in the foreground regions a coarse face region is found using skin colour. Then using a dynamic template matching approach the face is efficiently segmented. The proposed algorithm is invariant to large scale and pose variations. The segmented face is then handed over to a recognition algorithm based on principal component analysis and linear discriminant analysis. The on-line face detection, segmentation and recognition algorithm takes an average of 0.06 sec on a 3.2 GHz P4 machine.

Many feature space methods have been investigated for appearance-based face recognition. In this paper we compare a new feature space face recognition method - the class-dependence feature analysis (CFA) with three other popular methods, namely, the principal component analysis (PCA), the linear discriminant analysis (LDA) and the independent component analysis (ICA), for appearance-based 2-D face recognition. The numerical results on the face recognition grand challenge (FRGC) show that the CFA outperforms the other three method

Facial expression recognition has been an emerging research area in last two decades. This paper proposes a new hybrid system for automatic facial expression recognition. The proposed method utilizes histograms of oriented gradients (HOG) descriptor to extract features from expressive facial images. Feature reduction techniques namely principal component analysis (PCA) and linear discriminant analysis (LDA) are applied to obtain the most important discriminant features. Finally, the discriminant features are fed to the back-propagation neural network (BPNN) classifier to determine the underlying emotions from expressive facial images. The Extended Cohn-Kanade dataset (CK\(+\)) is used to validate the proposed method. Experimental results indicate that the proposed system provides the better result as compared to state-of-the-art methods in terms of accuracy with the substantially lesser number of features.

Face recognition technology has evolved as a popular identification technique to perform verification of human identity. By using the feature extraction methods and dimensionality reduction techniques in the pattern recognition applications, a number of facial recognition systems has been produced with distinct measure of success. Various face recognition algorithms and their extensions, have been proposed in the past three decades. However, face recognition faces challenging problems in real life applications because of the variation in the illumination of the face images. In the recent years, the research is focused towards Illumination-invariant face recognition system and many approaches have been proposed. But, there are several issues in face recognition across illumination variation which still remains unsolved. This paper provides a research on an efficient illumination-invariant face recognition system using Discrete Cosine Transform (DCT) and Principal Component Analysis (PCA). For processing the illumination invariant image, low frequency components of DCT are used to normalize the illuminated image, odd and even components of DCT is used for compensation in illumination variation and PCA is used for recognition of face images. The existing approaches in illumination Invariant face recognition are comprehensively reviewed and discussed. The proposed approach is validated with Yale Face Database B. Experimental results demonstrate the effectiveness of this approach in the performance of face recognition.

This paper describes the iCare Interaction Assistant, an assistive device for helping the individuals who are visually impaired during social interactions. The research presented here addresses the problems encountered in implementing real-time face recognition algorithms on a wearable device. Face recognition is the initial step towards building a comprehensive social interaction assistant that will identify and interpret facial expressions, emotions and gestures. Experiments conducted for selecting a face recognition algorithm that works despite changes in facial pose and illumination angle are reported. Performance details of the face recognition algorithms tested on the device are presented along with the overall performance of the system. The specifics of the hardware components used in the wearable device are mentioned and the block diagram of the wearable system is explained in detail.

Face recognition is a very old and popular biometric problem. In the last two decades, several challenges occur in face recognition such as expression, occlusion, illumination, pose variation, and low-quality image. Also, several techniques exist, such as Principle Component Analysis (PCA), Linear Discriminate Analysis (LDA), Local Non-Negative Matrix Factorization (LNME), Independent Component Analysis (ICA), and other variants, which finds good results under constrained scenarios. But, they give poor accuracy in an unconstrained scenarios such as illumination, pose variation, and occlusion. As Face recognition biometrics has gained great importance in occlusion condition, for example, a terrorists cover his face using facial accessories like sunglasses, scarves, or masks. This occlusion face recognition is categorized into two parts. 1) Feature extraction without occlusion detection face recognition. 2) Feature extraction with occlusion detection face recognition 3) occlusion recovery face recognition. Feature-based and fractal-based methods consider features around the eyes, nose, or mouth region to be used in the recognition face of the algorithm. This paper describes the different techniques and databases to handle the partial occlusion problem.