A simple and fast representation-based face recognition method

In this paper, we propose a very simple and fast face recognition method and present its potential rationale. This method first selects only the nearest training sample, of the test sample, from every class and then expresses the test sample as a linear combination of all the selected training samples. Using the expression result, the proposed method can classify the testing sample with a high accuracy. The proposed method can classify more accurately than the nearest neighbor classification method (NNCM). The face recognition experiments show that the classification accuracy obtained using our method is usually 2–10% greater than that obtained using NNCM. Moreover, though the proposed method exploits only one training sample per class to perform classification, it might obtain a better performance than the nearest feature space method proposed in Chien and Wu (IEEE Trans Pattern Anal Machine Intell 24:1644–1649, 2002), which depends on all the training samples to classify the test sample. Our analysis shows that the proposed method achieves this by modifying the neighbor relationships between the test sample and training samples, determined by the Euclidean metric.

[1]  Rama Chellappa,et al.  Discriminant Analysis for Recognition of Human Face Images (Invited Paper) , 1997, AVBPA.

[2]  Aapo Hyvärinen,et al.  Survey on Independent Component Analysis , 1999 .

[3]  Department of Electrical,et al.  Computational and Performance Aspects of PCA-Based Face-Recognition Algorithms , 2001, Perception.

[4]  Chengjun Liu,et al.  Gabor feature based classification using the enhanced fisher linear discriminant model for face recognition , 2002, IEEE Trans. Image Process..

[5]  Jen-Tzung Chien,et al.  Discriminant Waveletfaces and Nearest Feature Classifiers for Face Recognition , 2002, IEEE Trans. Pattern Anal. Mach. Intell..

[6]  Jian Yang,et al.  Why can LDA be performed in PCA transformed space? , 2003, Pattern Recognit..

[7]  Jing-Yu Yang,et al.  A novel method for Fisher discriminant analysis , 2004, Pattern Recognit..

[8]  Jian Yang,et al.  Two-dimensional PCA: a new approach to appearance-based face representation and recognition , 2004, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[9]  Jing-Yu Yang,et al.  An efficient renovation on kernel Fisher discriminant analysis and face recognition experiments , 2004, Pattern Recognit..

[10]  Tyng-Luh Liu,et al.  Sparse Representations for Image Decompositions , 1999, International Journal of Computer Vision.

[11]  E. Candes,et al.  11-magic : Recovery of sparse signals via convex programming , 2005 .

[12]  Jian Yang,et al.  Locally principal component learning for face representation and recognition , 2006, Neurocomputing.

[13]  Loris Nanni,et al.  Particle swarm optimization for ensembling generation for evidential k-nearest-neighbour classifier , 2009, Neural Computing and Applications.

[14]  David Zhang,et al.  A Multiple Maximum Scatter Difference Discriminant Criterion for Facial Feature Extraction , 2007, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[15]  Josef Kittler,et al.  A note on an extreme case of the generalized optimal discriminant transformation , 2008, Neurocomputing.

[16]  David Zhang,et al.  Directional independent component analysis with tensor representation , 2008, 2008 IEEE Conference on Computer Vision and Pattern Recognition.

[17]  Zhong Jin,et al.  Down-Sampling Face Images and Low-Resolution Face Recognition , 2008, 2008 3rd International Conference on Innovative Computing Information and Control.

[18]  Chengjun Liu,et al.  ICA Color Space for Pattern Recognition , 2009, IEEE Transactions on Neural Networks.

[19]  Yu Shi,et al.  Sparse discriminant analysis for breast cancer biomarker identification and classification , 2009 .

[20]  Allen Y. Yang,et al.  Robust Face Recognition via Sparse Representation , 2009, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[21]  Kirk L. Kroeker,et al.  Face recognition breakthrough , 2009, Commun. ACM.

[22]  Wenhua Wang,et al.  Classification by semi-supervised discriminative regularization , 2010, Neurocomputing.

[23]  Guillermo Sapiro,et al.  Sparse Representation for Computer Vision and Pattern Recognition , 2010, Proceedings of the IEEE.

[24]  Guillermo Sapiro,et al.  Sparse Representation forComputerVision and Pattern Recognition A relatively small sample of computer vision and pattern recognition information in applications such as face recognition is often sufficient to reveal the meaning the user desires. , 2010 .

[25]  David Zhang,et al.  A feature extraction method for use with bimodal biometrics , 2010, Pattern Recognit..

[26]  Changyin Sun,et al.  Sequential Row–Column 2DPCA for face recognition , 2012, Neural Computing and Applications.

[27]  Jian Yang,et al.  A Two-Phase Test Sample Sparse Representation Method for Use With Face Recognition , 2011, IEEE Transactions on Circuits and Systems for Video Technology.

[28]  David Zhang,et al.  Accelerating the kernel-method-based feature extraction procedure from the viewpoint of numerical approximation , 2011, Neural Computing and Applications.