Fast and Robust Shortest Paths on Manifolds Learned from Data

Georgios Arvanitidis
Georgios Arvanitidis
Søren Hauberg
Søren Hauberg

international conference on artificial intelligence and statistics, 2019.

Cited by: 6|Views21
EI

Abstract:

We propose a fast, simple and robust algorithm for computing shortest paths and distances on Riemannian manifolds learned from data. This amounts to solving a system of ordinary differential equations (ODEs) subject to boundary conditions. Here standard solvers perform poorly because they require well-behaved Jacobians of the ODE, and usu...More

Code:

Data:

Your rating :
0

 

Tags
Comments