The Estimation Algorithm of Laplacian Eigenvalues for the Tangent Bundle

In Recent years, manifold learning has become an important research direction in the field of machine learning and pattern recognition. As an effective way of representation embedded in low-dimensional space of high-dimensional data, the manifold learning algorithm, which is based on the spectral theory, has been widely used. This paper presents an estimation algorithm of Laplacian Eigenvalues and expands the LE algorithm's advantage of maintaining the local geometry to remaining globally through the global coordinates of the tangent bundle. The estimation algorithm of Laplacian Eigenvalues for the tangent bundle is effectively applied to nonlinear manifold dimensionality reduction and maintains the geometry of manifolds. Experimental results show that the algorithm proposed is very effective.

[1]  Michael I. Jordan,et al.  On Spectral Clustering: Analysis and an algorithm , 2001, NIPS.

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

[3]  N. L. Johnson,et al.  Multivariate Analysis , 1958, Nature.

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

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

[6]  H. Sebastian Seung,et al.  The Manifold Ways of Perception , 2000, Science.

[7]  Dewen Hu,et al.  Incremental Laplacian eigenmaps by preserving adjacent information between data points , 2009, Pattern Recognit. Lett..

[8]  Mikhail Belkin,et al.  Laplacian Eigenmaps for Dimensionality Reduction and Data Representation , 2003, Neural Computation.

[9]  Geoffrey E. Hinton,et al.  Improving dimensionality reduction with spectral gradient descent , 2005, Neural Networks.

[10]  Aziz Umit Batur,et al.  Linear subspaces for illumination robust face recognition , 2001, Proceedings of the 2001 IEEE Computer Society Conference on Computer Vision and Pattern Recognition. CVPR 2001.

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

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

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

[14]  Anil K. Jain,et al.  Incremental nonlinear dimensionality reduction by manifold learning , 2006, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[15]  Jean-Christophe Nebel,et al.  Automatic configuration of spectral dimensionality reduction methods , 2010, Pattern Recognit. Lett..

[16]  Matti Pietikäinen,et al.  Incremental locally linear embedding , 2005, Pattern Recognit..

[17]  Jianwei Yin,et al.  Incremental Manifold Learning Via Tangent Space Alignment , 2006, ANNPR.