Feature Extraction Based on Nearest Feature Line and Compressive Sensing

In this paper, a novel feature extraction algorithm based on nearest feature line and compressive sensing is proposed. The prototype samples are transformed to compressive sensing domain and then are performed Neighborhood discriminant nearest feature line analysis (NDNFLA) in the proposed algorithm. This method can reduce the computational complexity for feature extraction using nearest feature line. At the same time.its average recognition rate is very close to that of NDNFLA. The proposed algorithm is applied to image classification on AR face Database. The experimental results demonstrate the effectiveness of the proposed algorithm.

[1]  M. Turk,et al.  Eigenfaces for Recognition , 1991, Journal of Cognitive Neuroscience.

[2]  Jeng-Shyang Pan,et al.  Adaptively weighted sub-directional two-dimensional linear discriminant analysis for face recognition , 2012, Future Gener. Comput. Syst..

[3]  Huijun Gao,et al.  Sparse data-dependent kernel principal component analysis based on least squares support vector machine for feature extraction and recognition , 2011, Neural Computing and Applications.

[4]  Emmanuel J. Candès,et al.  Decoding by linear programming , 2005, IEEE Transactions on Information Theory.

[5]  Jian Yang,et al.  Two-dimensional discriminant transform for face recognition , 2005, Pattern Recognit..

[6]  Jiwen Lu,et al.  Nearest Feature Space Analysis for Classification , 2011, IEEE Signal Processing Letters.

[7]  Stan Z. Li,et al.  Face recognition using the nearest feature line method , 1999, IEEE Trans. Neural Networks.

[8]  Yujie Zheng,et al.  Nearest neighbour line nonparametric discriminant analysis for feature extraction , 2006 .

[9]  Yuxiao Hu,et al.  Face recognition using Laplacianfaces , 2005, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[10]  Stephen Lin,et al.  Graph Embedding and Extensions: A General Framework for Dimensionality Reduction , 2007, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[11]  Wu-Chih Hu,et al.  Feature-based Face Detection Against Skin-color Like Backgrounds with Varying Illumination , 2011, J. Inf. Hiding Multim. Signal Process..

[12]  Jeng-Shyang Pan,et al.  Discriminant Analysis Based on Nearest Feature Line , 2012, IScIDE.

[13]  Alejandro F. Frangi,et al.  Two-dimensional PCA: a new approach to appearance-based face representation and recognition , 2004 .

[14]  Aleix M. Martinez,et al.  The AR face database , 1998 .

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

[16]  Jeng-Shyang Pan,et al.  Neighborhood Discriminant Nearest Feature Line Analysis for Face Recognition , 2011, 2011 Second International Conference on Innovations in Bio-inspired Computing and Applications.

[17]  E.J. Candes,et al.  An Introduction To Compressive Sampling , 2008, IEEE Signal Processing Magazine.

[18]  Emmanuel J. Candès,et al.  Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information , 2004, IEEE Transactions on Information Theory.

[19]  David L Donoho,et al.  Compressed sensing , 2006, IEEE Transactions on Information Theory.

[20]  Jian Yang,et al.  KPCA plus LDA: a complete kernel Fisher discriminant framework for feature extraction and recognition , 2005, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[21]  David J. Kriegman,et al.  Eigenfaces vs. Fisherfaces: Recognition Using Class Specific Linear Projection , 1996, ECCV.

[22]  Jiwen Lu,et al.  Uncorrelated Discriminant Nearest Feature Line Analysis for Face Recognition , 2010, IEEE Signal Processing Letters.