arXiv · 1904.11860
Approximation of Riemannian Distances and Applications to Distance-Based Learning on Manifolds
Abstract
Several important algorithms for machine learning and data analysis use pairwise distances as input. On Riemannian manifolds these distances may be prohibitively costly to compute, in particular for large datasets. To tackle this problem, we propose a distance approximation which requires only a linear number of geodesic boundary value problems to be solved. The approximation is constructed by fitting a two-dimensional model space with constant curvature to each pair of samples. We demonstrate the usefulness of our approach in the context of shape analysis on landmarks spaces.
Explore related subjects
Keep this discovery
Philipp Harms, Elodie Maignant, Stefan Schlager. 2019-04-26. Approximation of Riemannian Distances and Applications to Distance-Based Learning on Manifolds. https://arxiv.org/abs/1904.11860
Cite the original work for its findings. Save a collection to share your selection of sources.