Reference face graph for face recognition

Face recognition has been studied extensively; however, real-world face recognition still remains a challenging task. The demand for unconstrained practical face recognition is rising with the explosion of online multimedia such as social networks, and video surveillance footage where face analysis is of significant importance. In this paper, we approach face recognition in the context of graph theory. We recognize an unknown face using an external reference face graph (RFG). An RFG is generated and recognition of a given face is achieved by comparing it to the faces in the constructed RFG. Centrality measures are utilized to identify distinctive faces in the reference face graph. The proposed RFG-based face recognition algorithm is robust to the changes in pose and it is also alignment free. The RFG recognition is used in conjunction with DCT locality sensitive hashing for efficient retrieval to ensure scalability. Experiments are conducted on several publicly available databases and the results show that the proposed approach outperforms the state-of-the-art methods without any preprocessing necessities such as face alignment. Due to the richness in the reference set construction, the proposed method can also handle illumination and expression variation

Illumination tolerance in facial recognition

In this research work, five different preprocessing techniques were experimented with two different classifiers to find the best match for preprocessor + classifier combination to built an illumination tolerant face recognition system. Hence, a face recognition system is proposed based on illumination normalization techniques and linear subspace model using two distance metrics on three challenging, yet interesting databases. The databases are CAS PEAL database, the Extended Yale B database, and the AT&T database. The research takes the form of experimentation and analysis in which five illumination normalization techniques were compared and analyzed using two different distance metrics. The performances and execution times of the various techniques were recorded and measured for accuracy and efficiency. The illumination normalization techniques were Gamma Intensity Correction (GIC), discrete Cosine Transform (DCT), Histogram Remapping using Normal distribution (HRN), Histogram Remapping using Log-normal distribution (HRL), and Anisotropic Smoothing technique (AS). The linear subspace models utilized were principal component analysis (PCA) and Linear Discriminant Analysis (LDA). The two distance metrics were Euclidean and Cosine distance. The result showed that for databases with both illumination (shadows), and lighting (over-exposure) variations like the CAS PEAL database the Histogram remapping technique with normal distribution produced excellent result when the cosine distance is used as the classifier. The result indicated 65% recognition rate in 15.8 ms/img. Alternatively for databases consisting of pure illumination variation, like the extended Yale B database, the Gamma Intensity Correction (GIC) merged with the Euclidean distance metric gave the most accurate result with 95.4% recognition accuracy in 1ms/img. It was further gathered from the set of experiments that the cosine distance produces more accurate result compared to the Euclidean distance metric. However the Euclidean distance is faster than the cosine distance in all the experiments conducted

2D Face Recognition System Based on Selected Gabor Filters and Linear Discriminant Analysis LDA

We present a new approach for face recognition system. The method is based on 2D face image features using subset of non-correlated and Orthogonal Gabor Filters instead of using the whole Gabor Filter Bank, then compressing the output feature vector using Linear Discriminant Analysis (LDA). The face image has been enhanced using multi stage image processing technique to normalize it and compensate for illumination variation. Experimental results show that the proposed system is effective for both dimension reduction and good recognition performance when compared to the complete Gabor filter bank. The system has been tested using CASIA, ORL and Cropped YaleB 2D face images Databases and achieved average recognition rate of 98.9 %

Background suppressing Gabor energy filtering

In the field of facial emotion recognition, early research advanced with the use of Gabor filters. However, these filters lack generalization and result in undesirably large feature vector size. In recent work, more attention has been given to other local appearance features. Two desired characteristics in a facial appearance feature are generalization capability, and the compactness of representation. In this paper, we propose a novel texture feature inspired by Gabor energy filters, called background suppressing Gabor energy filtering. The feature has a generalization component that removes background texture. It has a reduced feature vector size due to maximal representation and soft orientation histograms, and it is awhite box representation. We demonstrate improved performance on the non-trivial Audio/Visual Emotion Challenge 2012 grand-challenge dataset by a factor of 7.17 over the Gabor filter on the development set. We also demonstrate applicability of our approach beyond facial emotion recognition which yields improved classification rate over the Gabor filter for four bioimaging datasets by an average of 8.22%

The Effect of Using Histogram Equalization and Discrete Cosine Transform on Facial Keypoint Detection

This study aims to figure out the effect of using Histogram Equalization and Discrete Cosine Transform (DCT) in detecting facial keypoints, which can be applied for 3D facial reconstruction in face recognition. Four combinations of methods comprising of Histogram Equalization, removing low-frequency coefficients using Discrete Cosine Transform (DCT) and using five feature detectors, namely: SURF, Minimum Eigenvalue, Harris-Stephens, FAST, and BRISK were used for test. Data that were used for test were obtained from Head Pose Image and ORL Databases. The result from the test were evaluated using F-score. The highest F-score for Head Pose Image Dataset is 0.140 and achieved through the combination of DCT & Histogram Equalization with feature detector SURF. The highest F-score for ORL Database is 0.33 and achieved through the combination of DCT & Histogram Equalization with feature detector BRISK

Race classification using gaussian-based weight K-nn algorithm for face recognition

One of the greatest challenges in facial recognition systems is to recognize faces around different race and illuminations. Chromaticity is an essential factor in facial recognition and shows the intensity of the color in a pixel, it can greatly vary depending on the lighting conditions. The race classification scheme proposed which is Gaussian based-weighted K-Nearest Neighbor classifier in this paper, has very sensitive to illumination intensity. The main idea is first to identify the minority class instances in the training data and then generalize them to Gaussian function as concept for the minority class. By using combination of K-NN algorithm with Gaussian formula for race classification. In this paper, image processing is divided into two phases. The first is preprocessing phase. There are three preprocessing comprises of auto contrast balance, noise reduction and auto-color balancing. The second phase is face processing which contains six steps; face detection, illumination normalization, feature extraction, skin segmentation, race classification and face recognition. There are two type of dataset are being used; first FERET dataset where images inside this dataset involve of illumination variations. The second is Caltech dataset which images side this dataset contains noises