Geodesic Distance Estimation with Spherelets

06/29/2019
by   Didong Li, et al.
3

Many statistical and machine learning approaches rely on pairwise distances between data points. The choice of distance metric has a fundamental impact on performance of these procedures, raising questions about how to appropriately calculate distances. When data points are real-valued vectors, by far the most common choice is the Euclidean distance. This article is focused on the problem of how to better calculate distances taking into account the intrinsic geometry of the data, assuming data are concentrated near an unknown subspace or manifold. The appropriate geometric distance corresponds to the length of the shortest path along the manifold, which is the geodesic distance. When the manifold is unknown, it is challenging to accurately approximate the geodesic distance. Current algorithms are either highly complex, and hence often impractical to implement, or based on simple local linear approximations and shortest path algorithms that may have inadequate accuracy. We propose a simple and general alternative, which uses pieces of spheres, or spherelets, to locally approximate the unknown subspace and thereby estimate the geodesic distance through paths over spheres. Theory is developed showing lower error for many manifolds. This conclusion is supported through multiple simulation examples and applications to real data sets.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/07/2012

Developments in the theory of randomized shortest paths with a comparison of graph node distances

There have lately been several suggestions for parametrized distances on...
research
06/26/2017

Efficient Manifold and Subspace Approximations with Spherelets

Data lying in a high-dimensional ambient space are commonly thought to h...
research
04/06/2019

Local Regularization of Noisy Point Clouds: Improved Global Geometric Estimates and Data Analysis

Several data analysis techniques employ similarity relationships between...
research
07/05/2019

Geodesic Learning via Unsupervised Decision Forests

Geodesic distance is the shortest path between two points in a Riemannia...
research
06/28/2017

Unconstrained and Curvature-Constrained Shortest-Path Distances and their Approximation

We study shortest paths and their distances on a subset of a Euclidean s...
research
06/24/2020

The flag manifold as a tool for analyzing and comparing data sets

The shape and orientation of data clouds reflect variability in observat...
research
07/20/2020

A Survey of Algorithms for Geodesic Paths and Distances

Numerical computation of shortest paths or geodesics on curved domains, ...

Please sign up or login with your details

Forgot password? Click here to reset