A Graph-based Approach To Derive The Geodesic Distance On Statistical Manifolds: Application To Multimedia Information Retrieval

Abstract

In this paper, we leverage the properties of non-Euclidean Geometry to define the Geodesic distance (GD) on the space of statistical manifolds. The Geodesic distance is a real and intuitive similarity measure that is a good alternative to the purely statistical and extensively used Kullback-Leibler divergence (KLD). Despite the effectiveness of the GD, a closed-form does not exist for many manifolds, since the geodesic equations are hard to solve. This explains that the major studies have been content to use numerical approximations. Nevertheless, most of those do not take account of the manifold properties, which leads to a loss of information and thus to low performances. We propose an approximation of the Geodesic distance through a graph-based method. This latter permits to well represent the structure of the statistical manifold, and respects its geometrical properties. Our main aim is to compare the graph-based approximation to the state of the art approximations. Thus, the propo

Stats

• citations1
• S2 citations—
• github stars0
• HF likes0
• heat score2.26
• arxiv keyabbad2021a

Related papers

• Metric Learning On Manifolds (2019)0.00
• Computationally Efficient Learning Of Statistical Manifolds (2021)0.00
• MCGI: Manifold-consistent Graph Indexing For Billion-scale Disk-resident Vector Search (2026)0.00
• An Application Of Manifold Learning In Global Shape Descriptors (2019)5.84
• Exact Computation Of A Manifold Metric, Via Lipschitz Embeddings And Shortest Paths On A Graph (2017)5.24
• Hybrid Diffusion: Spectral-temporal Graph Filtering For Manifold Ranking (2018)2.26
• Differential Geometric Retrieval Of Deep Features (2017)2.26
• Neural Bregman Divergences For Distance Learning (2022)0.00