Face Recognition Using Nearest Feature Space Embedding

Authors:
Yin-Nong Chen;Chin-Chuan Han;Cheng-Tzu Wang;Kuo-Chin Fan
Affiliations:
National Central University, Jhongli;National United University, Miaoli;National Taipei University of Education, Taipei;National Central University, Jhongli
Venue:
IEEE Transactions on Pattern Analysis and Machine Intelligence
Year:
2011

Citing 0
Cited 3

Maximal Similarity Embedding

Neurocomputing
Face recognition by searching most similar sample with immune learning

ICARIS'12 Proceedings of the 11th international conference on Artificial Immune Systems
Graph-preserving shortest feature line segment for dimensionality reduction

Neurocomputing

Quantified Score

Hi-index	0.15

Visualization

Abstract

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.