Improving the discriminant ability of local margin based learning method by incorporating the global between-class separability criterion

Many applications in machine learning and computer vision come down to feature representation and reduction. Manifold learning seeks the intrinsic low-dimensional manifold structure hidden in the high-dimensional data. In the past few years, many local discriminant analysis methods have been proposed to exploit the discriminative submanifold structure by extending the manifold learning idea to supervised ones. Particularly, marginal Fisher analysis (MFA) finds the local interclass margin for feature extraction and classification. However, since the limited data pairs are employed to determine the discriminative margin, such method usually suffers from the maladjusted learning as we introduced in this paper. To improve the discriminant ability of MFA, we incorporate the marginal Fisher idea with the global between-class separability criterion (BCSC), and propose a novel supervised learning method, called local and global margin projections (LGMP), where the maladjusted learning problem can be alleviated. Experimental evaluation shows that the proposed LGMP outperforms the original MFA.

[1]  J. Tenenbaum,et al.  A global geometric framework for nonlinear dimensionality reduction. , 2000, Science.

[2]  Shuicheng Yan,et al.  Graph Embedding and Extensions: A General Framework for Dimensionality Reduction , 2007 .

[3]  S T Roweis,et al.  Nonlinear dimensionality reduction by locally linear embedding. , 2000, Science.

[4]  Hwann-Tzong Chen,et al.  Local discriminant embedding and its variants , 2005, 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05).

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

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

[7]  Xuelong Li,et al.  Geometric Mean for Subspace Selection , 2009, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[8]  Gene H. Golub,et al.  Matrix computations , 1983 .

[9]  Xuelong Li,et al.  Supervised Tensor Learning , 2005, ICDM.

[10]  Xuelong Li,et al.  General Tensor Discriminant Analysis and Gabor Features for Gait Recognition , 2007, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[11]  Kun Zhou,et al.  Locality Sensitive Discriminant Analysis , 2007, IJCAI.

[12]  Arnold W. M. Smeulders,et al.  The Amsterdam Library of Object Images , 2004, International Journal of Computer Vision.

[13]  Shuicheng Yan,et al.  Graph embedding: a general framework for dimensionality reduction , 2005, 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05).

[14]  Xuelong Li,et al.  A unifying framework for spectral analysis based dimensionality reduction , 2008, 2008 IEEE International Joint Conference on Neural Networks (IEEE World Congress on Computational Intelligence).

[15]  Xiaofei He,et al.  Locality Preserving Projections , 2003, NIPS.

[16]  David G. Stork,et al.  Pattern Classification , 1973 .

[17]  Xuelong Li,et al.  Effective Feature Extraction in High-Dimensional Space , 2008, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[18]  Shigeo Abe DrEng Pattern Classification , 2001, Springer London.

[19]  Xuelong Li,et al.  Patch Alignment for Dimensionality Reduction , 2009, IEEE Transactions on Knowledge and Data Engineering.

[20]  Tao Jiang,et al.  Efficient and robust feature extraction by maximum margin criterion , 2003, IEEE Transactions on Neural Networks.

[21]  Mikhail Belkin,et al.  Laplacian Eigenmaps and Spectral Techniques for Embedding and Clustering , 2001, NIPS.