How to project 'circular' manifolds using geodesic distances?
نویسندگان
چکیده
Recent papers have clearly shown the advantage of using the geodesic distance instead of the Euclidean one in methods performing non-linear dimensionality reduction by means of distance preservation. This new metric greatly improves the performances of existing algorithms, especially when strongly crumpled manifolds have to be unfolded. Nevertheless, neither the Euclidean nor the geodesic distance address the issue of ‘circular’ manifolds like a cylinder or a torus. Such manifolds should ideally be torn before to be unfolded. This paper describes how this can be done in practice when using the geodesic distance.
منابع مشابه
A Geometry Preserving Kernel over Riemannian Manifolds
Abstract- Kernel trick and projection to tangent spaces are two choices for linearizing the data points lying on Riemannian manifolds. These approaches are used to provide the prerequisites for applying standard machine learning methods on Riemannian manifolds. Classical kernels implicitly project data to high dimensional feature space without considering the intrinsic geometry of data points. ...
متن کاملNonlinear Projection Using Geodesic Distances and the Neural Gas Network
A nonlinear projection method that uses geodesic distances and the neural gas network is proposed. First, the neural gas algorithm is used to obtain codebook vectors, and a connectivity graph is concurrently created by using competitive Hebbian rule. A procedure is added to tear or break non-contractible cycles in the connectivity graph, in order to project efficiently ‘circular’ manifolds such...
متن کاملNonlinear dimensionality reduction of data manifolds with essential loops
Numerous methods or algorithms have been designed to solve the problem of nonlinear dimensionality reduction (NLDR). However, very few among them are able to embed efficiently ‘circular’ manifolds like cylinders or tori, which have one or more essential loops. This paper presents a simple and fast procedure that can tear or cut those manifolds, i.e. break their essential loops, in order to make...
متن کاملApproximating Geodesic Distances on 2-Manifolds in R3
We present an algorithm for approximating geodesic distances on 2-manifolds in R. Our algorithm works on an ε-sample of the underlying manifold and computes approximate geodesic distances between all pairs of points in this sample. The approximation error is multiplicative and depends on the density of the sample. For an ε-sample S, the algorithm has a near-optimal running time of O ( |S| log |...
متن کاملComputing with Point Cloud Data
Point clouds are one of the most primitive and fundamental manifold representations. A popular source of point clouds are three-dimensional shape acquisition devices such as laser range scanners. Another important field where point clouds are found is the representation of high-dimensional manifolds by samples. With the increasing popularity and very broad applications of this source of data, i...
متن کامل