Atlas compatibility transformation: A normal manifold learning algorithm

Over the past few years, nonlinear manifold learning has been widely exploited in data analysis and machine learning. This paper presents a novel manifold learning algorithm, named atlas compatibility transformation (ACT). It solves two problems which correspond to two key points in the manifold definition: how to chart a given manifold and how to align the patches to a global coordinate space based on compatibility. For the first problem, we divide the manifold into maximal linear patch (MLP) based on normal vector field of the manifold. For the second problem, we align patches into an optimal global system by solving a generalized eigenvalue problem. Compared with the traditional method, the ACT could deal with noise datasets and fragment datasets. Moreover, the mappings between high dimensional space and low dimensional space are given. Experiments on both synthetic data and real-world data indicate the effection of the proposed algorithm.

[1]  G. Strang Introduction to Linear Algebra , 1993 .

[2]  Bernhard Schölkopf,et al.  A kernel view of the dimensionality reduction of manifolds , 2004, ICML.

[3]  Baozong Yuan,et al.  Curvature and density based feature point detection for point cloud data , 2010 .

[4]  Jie-Sheng Wang,et al.  GLCM Based Extraction of Flame Image Texture Features and KPCA-GLVQ Recognition Method for Rotary Kiln Combustion Working Conditions , 2014, Int. J. Autom. Comput..

[5]  Hongyuan Zha,et al.  Adaptive Manifold Learning , 2004, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[6]  Fatih Murat Porikli,et al.  Pedestrian Detection via Classification on Riemannian Manifolds , 2008, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[7]  R. Coifman,et al.  Geometric harmonics: A novel tool for multiscale out-of-sample extension of empirical functions , 2006 .

[8]  Hujun Yin,et al.  Nonlinear dimensionality reduction and data visualization: A review , 2007, Int. J. Autom. Comput..

[9]  Hongbin Zha,et al.  Riemannian Manifold Learning , 2008, IEEE Transactions on Pattern Analysis and Machine Intelligence.

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

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

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

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

[14]  H. Zha,et al.  Principal manifolds and nonlinear dimensionality reduction via tangent space alignment , 2004, SIAM J. Sci. Comput..

[15]  Wen Gao,et al.  Maximal Linear Embedding for Dimensionality Reduction , 2011, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[16]  D. Donoho,et al.  Hessian eigenmaps: Locally linear embedding techniques for high-dimensional data , 2003, Proceedings of the National Academy of Sciences of the United States of America.

[17]  Ahmed M. Elgammal,et al.  Tracking People on a Torus , 2009, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[18]  Matthew Brand,et al.  Charting a Manifold , 2002, NIPS.

[19]  Teuvo Kohonen,et al.  Self-Organizing Maps , 2010 .

[20]  Mukund Balasubramanian,et al.  The Isomap Algorithm and Topological Stability , 2002, Science.