Face recognition using message passing based clustering method

Face recognition is very important in many applications including surveillance, biometrics, and other domains. Fast face recognition is required if she wants to train or test more images or to increase the resolution of an input image for better accuracy in the recognition. Meanwhile, Graphics Processing Units (GPUs) have become widely available, offering the opportunity for real-time face recognition even for larger set of images with a high resolution. In this paper, we explore the design space of parallelizing a PCA (Principal Component Analysis) based face recognition algorithm and propose a fast face recognizer on GPUs by exploiting the fine-grained data-parallelism found in the face recognition algorithm. We successfully accelerated the major three tasks by 120-folds, 70-folds, and 110-folds, compared to a sequential C implementation. For the end-to-end comparison, our CUDA face recognizer achieved a 30-fold speedup.

In this paper, an automatic face recognition system is proposed based on appearance-based features that focus on the entire face image rather than local facial features. The first step in face recognition system is face detection. Viola-Jones face detection method that capable of processing images extremely while achieving high detection rates is used. This method has the most impact in the 2000’s and known as the first object detection framework to provide relevant object detection that can run in real time. Feature extraction and dimension reduction method will be applied after face detection. Principal Component Analysis (PCA) method is widely used in pattern recognition. Linear Discriminant Analysis (LDA) method that used to overcome drawback the PCA has been successfully applied to face recognition. It is achieved by projecting the image onto the Eigenface space by PCA after that implementing pure LDA over it. Square Euclidean Distance (SED) is used. The distance between two images is a major concern in pattern recognition. The distance between the vectors of two images leads to image similarity. The proposed method is tested on three databases (MUCT, Face94, and Grimace). Different number of training and testing images are used to evaluate the system performance and it show that increasing the number of training images will increase the recognition rate.

Linear Discriminant Analysis (LDA) has been successfully applied to face recognition which is based on a linear projection from the image space to a low dimensional space by maximizing the between class scatter and minimizing the within-class scatter. LDA allows objective evaluation of the significance of visual information in different features of the face for identifying the human face. The LDA also provides us with a small set of features that carry the most relevant information for classification purposes. LDA method overcomes the limitation of Principle Component Analysis method by applying the linear discriminant criterion. This criterion tries to maximize the ratio of determinant of the between-class scatter matrix of the projected samples to the determinant of the within-class scatter matrix of the projected samples. Linear discriminant groups the images of the same class and separate images of different classes. Here to identify an input test image, the projected test image is compared to each projected training, and the test image is identified as the closest training image. The experiments in this paper we present to use LDA for face recognition. The experiments in this paper are performed with the ORL face database. The experimental results show that the correct recognition rate of this method is higher than that of previous techniques.

Face recognition on mobile phones is gaining increasing attention due to the great variety of applications it can offer. In this paper, a fast recognition system on mobile phone is presented. First, Haar-like features with AdaBoost is used to detect face in pictures taken from phone camera. Second, in order to detect the eyes of face, we use a fast and effective method - eyes template matching in specific regions of the face, and then the local binary pattern (LBP) is adopted for fast face recognition. The experimental results demonstrate that the system introduced has a good performance in terms of recognition time and rate. Besides, various optimization techniques to speed up the face detection and recognition process are discussed.

The high dimensionality of hyperspectral images brings a heavy burden for image processing. Band selection is a common technique for dimensionality reduction. Since the labels of hyperspectral images are difficult to collect, a new semisupervised band selection method based on affinity propagation (AP) is proposed. AP, an exemplar-based clustering method, is famous due to fast execution time and low reconstruction error. For band selection, AP involves two key issues: band correlation and band preference. In this paper, a new normalized trivariable mutual information (normalized TMI, NTMI) is devised to measure band correlation for classification. NTMI considers not only band redundancy but also band synergy, and overcomes the sensitivity of TMI to the discriminative abilities of bands. Band preference is defined by the discriminative ability and informative amount of each band. Since the clustering methods are easily disturbed by noisy bands, a new statistical-based method for band correlation and band preference is devised. It can automatically remove noisy bands beforehand by exploiting the continuity property of bands. Finally, the proposed method can select highly discriminative and informative bands, and remove highly redundant bands. Experimental results on hyperspectral images demonstrate the effectiveness of the proposed semisupervised band selection method.

Face recognition using direct, weighted linear discriminant analysis and modular subspaces

We present an iterative and unsupervised learning approach for the speaker verification task. In conventional speaker verification, Probabilistic Linear Discriminant Analysis (PLDA) has been widely used as a supervised backend. However, PLDA requires fully labeled training data, which is often difficult to obtain in reality. To automatically retrieve the speaker labels of unlabeled training data, we propose to use the Affinity Propagation (AP) - a clustering method that takes pairwise data similarity as input - to generate the labels for the PLDA modeling. We further propose an iterative refinement strategy that incrementally updates the similarity input of the AP clustering with the previous iteration's PLDA scoring outputs. Moreover, we evaluate the performance of different PLDA scoring methods for the multiple enrollment task and show that the generalized hypothesis testing achieves the best results. Experiments were conducted on the NIST SRE 2010 and the 2014 i-vector challenge database. The results show that our proposed iterative and unsupervised PLDA model learning approach outperformed the cosine similarity baseline by 35% relatively.

To solve the problem that it is difficult to combine performance and speed of face recognition in embedded environment, we design and implement a fast face recognition method based on deep learning. Firstly, face detection and quality selection are performed based on MTCNN algorithm to reduce the amount of feature extraction data needed for recognition. Secondly, the RKNN model is used to quantify the acceleration of feature extraction. Finally, fast face recognition is realized by feature matching. The experiment shows that the method is beneficial for face recognition processing on the RK3399Pro platform, and the average time is shortened by 80% compared with that before acceleration. In the case of ensuring the feature extraction accuracy and recognition accuracy, it basically meets the real-time requirements.

In this paper, a new face recognition method based on PCA (principal Component Analysis), LDA (Linear Discriminant Analysis) and neural networks is proposed. This method consists of four steps: i) Preprocessing, ii) Dimension reduction using PCA, iii) feature extraction using LDA and iv) classification using neural network. Combination of PCA and LDA is used for improving the capability of LDA when a few samples of images are available and neural network classifier is used to reduce number misclassification caused by not-linearly separable classes. The proposed method was tested on Yale face database. Experimental results on this database demonstrated the effectiveness of the proposed method for face recognition with less misclassification in comparison with previous methods.

In this paper, a new face recognition method based on PCA (principal Component Analysis), LDA (Linear Discriminant Analysis) and neural networks is proposed. Combination of PCA and LDA is used for improving the capability of LDA when a few samples of images are available. The proposed method was tested on ORL face database. Experimental results on this database demonstrated the effectiveness of the proposed method for face recognition with less misclassification in comparison with previous methods.

Face recognition has become a fascinating field for researchers. The motivation behind the enormous interest in the topic is the need to improve the accuracy of many real-time applications. The complexity of the human face and the changes due to different effects make it more challenging to design as well as implement a powerful computational system for human face recognition. In this paper, we presented an enhanced approach to improve human face recognition using a back-propagation neural network (BPNN) and features extraction based on the correlation between the training images. A key contribution of this paper is the generation of a new set called the T-Dataset from the original training data set, which is used to train the BPNN. We generated the T-Dataset using the correlation between the training images without using a common technique of image density. The correlated T-Dataset provides a high distinction layer between the training images, which helps the BPNN to converge faster and achieve better accuracy. Data and features reduction are essential in the face recognition process, and researchers have recently focused on the modern neural network. Therefore, we used a local binary pattern histogram descriptor to prove that there is potential improvement even using traditional methods. We applied five distance measurement algorithms and then combined them to obtain the T-Dataset, which we fed into the BPNN. We achieved higher face recognition accuracy with less computational cost compared with the current approach by using reduced image features. We test the proposed framework on two small data sets, the YALE and AT&T data sets, as the ground truth. We achieved tremendous accuracy. Furthermore, we evaluate our method on one of the state-of-the-art benchmark data sets, Labeled Faces in the Wild (LFW), where we produce a competitive face recognition performance.

Face recognition has become a fascinating field for researchers. The motivation behind the enormous interest in the topic is the need to improve the accuracy of many real-time applications. The complexity of the human face and the changes due to different effects make it more challenging to design as well as implement a powerful computational system for human face recognition. In this work, we presented an enhanced approach to improve human face recognition using a Back-Propagation Neural Network (BPNN) and features extraction based on the correlation between the training images. A key contribution of this work is the generation of a new set called the T-Dataset from the original training dataset, which is used to train the BPNN. We generated the T-Dataset utilizing the correlation between the training images without using a conventional technique of image density. The correlated T-Dataset provides a high distinction layer between the training images, which helps the BPNN to converge faster and achieve better accuracy. Data and features reduction is essential in the face recognition process, and researchers have recently focused on the modern Neural Network (NN). Therefore, we used a Principal Component Analysis (PCA) descriptor to prove that there is a potential improvement even using traditional methods. We applied five distance measurement algorithms and then combined them to obtain the T-Dataset, which we fed into the BPNN. We achieved higher face recognition accuracy with less computational cost compared to the current approach by using reduced image features. We test the proposed framework on two small datasets, the YALE and AT&T datasets, as the ground truth. We achieved tremendous accuracy. Furthermore, we evaluate our method on one of the state-of-the-art benchmark datasets, Labeled Faces in the Wild (LFW), where we produce a competitive face recognition performance. Also, we proposed an enhanced framework to improve the face registration using deep transfer learning. We used pre-trained models such as ResNet50 and SeNet50 which trained on the VGGFace2 dataset. We used the LFW dataset to evaluate our method, and we achieve high accuracy.

A novel Bayesian logistic discriminant model: An application to face recognition

In the current scenario face identification and recognition is an important technique in surveillance. The face is a necessary biometric in humans. Therefore face detection plays a major job in computer vision applications. Several face recognition and emotions classification approaches have been presented throughout the last few decades of research to improve the rate of face recognition for thermal pictures. However, in real-time, lighting conditions might change due to several factors, such as the different times of capture, weather, etc. Due to variations in lighting intensity, the performance of the facial expression recognition system is not good. This paper proposed a model for human thermal face detection and expression classification. Four main steps were involved in this research. Initially, the Difference of the Gaussian (DOG) filter is utilized to crop the input thermal images and then normalize the images using the median filter in pre-processing step. Then, Efficient Net is used for extracting features such as shape, location, and occurrences from thermal face images. After that, detect human faces utilized by the YOLOv4 technique to better emotions classification. Finally, classify the emotions on faces by using the DenseNet technique into seven emotions such as happy, sad, disgust, surprise, anger, fear, and neutral. The proposed method outperforms state-of-art techniques for face recognition on thermal pictures, and classifies the expressions, according to experimentations on the RGB-D-T database. The accuracy, precision, recall, and f1-score metrics will be utilized with the database to assess the efficacy of the proposed methodology. The proposed models achieve a high classification accuracy of 95.97% on the RGB-D-T database. Furthermore, the outcomes show good precision for various face recognition tasks.

Face recognition is an area of computer vision that has attracted a lot of interest from the research community. A growing demand for robust face recognition software in security applications has driven the development of interesting approaches in this field. A large quantity of research in face recognition deals with visible face images. In the visible spectrum the illumination and face expressions changes represent a significant challenge for the recognition system. To avoid these problems, researchers proposed recently the use of 3D and infrared imaging for face recognition. In this work, we introduce a new framework for infrared face recognition using texture descriptors. This framework exploits linear and non linear dimensionality reduction techniques for face learning and recognition in the texture space. Active and passive infrared imaging modalities are used and comparison with visible face recognition is performed. Two multispectral face recognition databases were used in our experiments: Equinox Database (Visible, SWIR, MWIR, LWIR) and Laval University Multispectral Database (Visible, NIR, MWIR, LWIR). The obtained results show high increase in recognition performance when texture descriptors like LBP (Local Binary Pattern) and LTP (Local Ternary Pattern) are used. The best result was obtained in the short wave infrared spectrum (SWIR) using non linear dimensionality reduction techniques.