Face recognition using nearest feature space embedding

Face recognition algorithms often have to solve problems such as facial pose, illumination, and expression (PIE). To reduce the impacts, many researchers have been trying to find the best discriminant transformation in eigenspaces, either linear or nonlinear, to obtain better recognition results. Various researchers have also designed novel matching algorithms to reduce the PIE effects. In this study, a nearest feature space embedding (called NFS embedding) algorithm is proposed for face recognition. The distance between a point and the nearest feature line (NFL) or the NFS is embedded in the transformation through the discriminant analysis. Three factors, including class separability, neighborhood structure preservation, and NFS measurement, were considered to find the most effective and discriminating transformation in eigenspaces. The proposed method was evaluated by several benchmark databases and compared with several state-of-the-art algorithms. According to the compared results, the proposed method outperformed the other algorithms.     

Face recognition using a new compressive sensing-based feature extraction method

Multimedia Tools and Applications - This paper proposes a novel face recognition algorithm that utilizes a sparse Fast Fourier Transform (FFT)-based feature extraction method. In our algorithm, we...     

基于局部线性嵌入和最近特征线的人耳识别

针对人耳生物特征,通过分析早期人耳识别方法的不足,提出了一种局部线性嵌入（LLE）和最近特征线（NFL）相结合的人耳识别方法。首先依据流形学习思想,采用局部线性嵌入算法提取人耳图像特征,然后采用最近特征线分类器进行人耳识别。实验结果表明,该方法在人耳姿态变化时能够取得非常理想的识别率,提高了人耳识别的鲁棒性,增强了人耳识别技术的实用性。     

Face recognition using line edge map

The automatic recognition of human faces presents a significant challenge to the pattern recognition research community. Typically, human faces are very similar in structure with minor differences from person to person. They are actually within one class of "human face". Furthermore, lighting conditions change, while facial expressions and pose variations further complicate the face recognition task as one of the difficult problems in pattern analysis. This paper proposes a novel concept: namely, that faces can be recognized using a line edge map (LEM). The LEM, a compact face feature, is generated for face coding and recognition. A thorough investigation of the proposed concept is conducted which covers all aspects of human face recognition, i.e. face recognition under (1) controlled/ideal conditions and size variations, (2) varying lighting conditions, (3) varying facial expressions, and (4) varying pose. The system performance is also compared with the eigenface method, one of the best face recognition techniques, and with reported experimental results of other methods. A face pre-filtering technique is proposed to speed up the search process. It is a very encouraging to find that the proposed face recognition technique has performed better than the eigenface method in most of the comparison experiments. This research demonstrates that the LEM, together with the proposed generic line-segment Hausdorff distance measure, provides a new method for face coding and recognition     

基于小波和最近邻凸包分类器的人脸识别

本文提出一种新型的人脸识别方法.该方法首先通过二维小波变换提取人脸图像的低频特征,然后采用最近邻凸包分类器对该特征进行分类.二维小波变换是提取图像特征的有效方法之一,在保留原始图像的主要特征的同时,还能够有效降低图像维数;最近邻凸包分类器是一种以测试样本点到各类别训练样本凸包的距离作为相似性度量的分类算法.本文将这两项技术相结合在ORL人脸识别数据库上取得了良好的实验效果.     

Face recognition using transform domain feature extraction and PSO-based feature selection

This paper presents two new techniques, viz., DWT Dual-subband Frequency-domain Feature Extraction (DDFFE) and Threshold-Based Binary Particle Swarm Optimization (ThBPSO) feature selection, to improve the performance of a face recognition system. DDFFE uses a unique combination of DWT, DFT, and DCT, and is used for efficient extraction of pose, translation and illumination invariant features. The DWT stage selectively utilizes the approximation coefficients along with the horizontal detail coefficients of the 2-dimensional DWT of a face image, whilst retaining the spatial correlation of pixels. The translation variance problem of the DWT is compensated in the following DFT stage, which also exploits the frequency characteristics of the image. Then, all the low frequency components present at the center of the DFT spectrum are extracted by drawing a quadruple ellipse mask around the spectrum center. Finally, DCT is used to lay the ground for BPSO based feature selection. The second proposed technique, ThBPSO, is a novel feature selection algorithm, based on the recurrence of selected features, and is used to search the feature space to obtain a feature subset for recognition. Experimental results obtained by applying the proposed algorithm on seven benchmark databases, namely, Cambridge ORL, UMIST, Extended Yale B, CMUPIE, Color FERET, FEI, and HP, show that the proposed system outperforms other FR systems. A significant increase in the recognition rate and a substantial reduction in the number of features required for recognition are observed. The experimental results indicate that the minimum feature reduction obtained is 98.2% for all seven databases.     

Performance evaluation of the nearest feature line method in image classification and retrieval

A method, the nearest feature line (NFL) method, is used in image classification and retrieval and its performance is evaluated and compared with other methods by extensive experiments. The NFL method is demonstrated to make efficient use of knowledge about multiple prototypes of a class to represent that class.     

Face recognition using the second-order mixture-of-eigenfaces method

The well-known eigenface method uses an eigenface set obtained from principal component analysis. However, the single eigenface set is not enough to represent the complicated face images with large variations of poses and/or illuminations. To overcome this weakness, we propose a second-order mixture-of-eigenfaces method that combines the second-order eigenface method (ISO MPG m5750, Noordwijkerhout, March 2000) and the mixture-of-eigenfaces method (a.k.a. Gaussian mixture model (Proceedings IJCNN2001, 2001). In this method, we use a couple of mixtures of multiple eigenface sets: one is a mixture of multiple approximate eigenface sets for face images and another is a mixture of multiple residual eigenface sets for residual face images. Each mixture of multiple eigenface sets has been obtained from expectation maximization learning consecutively. Based on two mixture of multiple eigenface sets, each face image is represented by a couple of feature vectors obtained by projecting the face image onto a selected approximate eigenface set and then by projecting the residual face image onto a selected residual eigenface set. Recognition is performed by the distance in the feature space between the input image and the template image stored in the face database. Simulation results show that the proposed second-order mixture-of-eigenfaces method is best for face images with illumination variations and the mixture-of-eigenfaces method is best for the face images with pose variations in terms of average of the normalized modified retrieval rank and false identification rate.     

Comparison of the nearest feature classifiers for face recognition

This paper presents an experimental comparison of the nearest feature classifiers, using an approach based on binomial tests in order to evaluate their strengths and weaknesses. In addition, classification accuracies and the accuracy-dimensionality tradeoff have been considered as comparison criteria. We extend two of the nearest feature classifiers to label the query point by a majority vote of the samples. Comparisons were carried out for face recognition using ORL database. We apply the eigenface representation for feature extraction. Experimental results showed that even though the classification accuracy of k-NFP outperforms k-NFL in some dimensions, these rate differences do not have statistical significance.     

Face recognition using common faces method

In this paper, we propose a face recognition method called the commonface by using the common vector approach. A face image is regarded as a summation of a common vector which represents the invariant properties of the corresponding face class, and a difference vector which presents the specific properties of the corresponding face image such as face appearance, pose and expression. Thus, by deriving the common vector of each face class, the common feature of each person is obtained which removes the differences of face images belonging to the same person. For test face image, the remaining vector with each face class is derived with the similar procedure to the common vector, which is then compared with the common vector of each face class to predict the class label of query face by finding the minimum distance between the remaining vector and the common vector. Furthermore, we extend the common vector approach (CVP) to kernel CVP to improve the performance of CVP. The experimental results suggest that the proposed commonface approach provides a better representation of individual common feature and achieves lower error rates in face recognition.