Fast Manifold Learning Based on Riemannian Normal Coordinates
We present a novel method for manifold learning, i.e. identification of the low-dimensional manifold-like structure present in a set of data points in a possibly high-dimensional space. The main idea is derived from the concept of Riemannian normal coordinates. This coordinate system is in a way a generalization of Cartesian coordinates in Euclidean space. We translate this idea to a cloud of data points in order to perform dimension reduction. Our implementation currently uses Dijkstra’s algorithm for shortest paths in graphs and some basic concepts from differential geometry. We expect this approach to open up new possibilities for analysis of e.g. shape in medical imaging and signal processing of manifold-valued signals, where the coordinate system is “learned” from experimental high-dimensional data rather than defined analytically using e.g. models based on Lie-groups.
KeywordsImage Patch Geodesic Distance Klein Bottle Nonlinear Dimensionality Reduction Swiss Roll
- 1.Belkin, M., Niyogi, P.: Laplacian eigenmaps and spectral techniques for embedding and clustering. In: Diettrich, T.G., Becker, S., Ghahramani, Z. (eds.) Advances in Neural Information Processing Systems 14. MIT Press, Cambridge (2002)Google Scholar
- 4.Fletcher, P.T., Joshi, S., Lu, C., Pizer, S.: Gaussian Distributions on Lie Groups and Their Application to Statistical Shape Analysis. In: Proc. of Information Processing in Medical Imaging (IPMI), pp. 450–462 (2003)Google Scholar
- 12.Weisstein, E.W.: ”Klein Bottle.” From MathWorld–A Wolfram Web Resource, http://mathworld.wolfram.com/KleinBottle.html