TL;DR
This paper introduces a Riemannian geometric framework for analyzing persistence diagrams in topological data analysis, offering a computationally efficient, correspondence-free method that enables advanced statistical operations.
Contribution
It proposes modeling persistence diagrams as probability density functions on a Hilbert Sphere, simplifying computations and enabling statistical analysis without point matching.
Findings
Lower computational complexity compared to Wasserstein metric
Correspondence-free distance computation
Competitive results in analysis tasks
Abstract
Topological data analysis is becoming a popular way to study high dimensional feature spaces without any contextual clues or assumptions. This paper concerns itself with one popular topological feature, which is the number of dimensional holes in the dataset, also known as the Betti number. The persistence of the Betti numbers over various scales is encoded into a persistence diagram (PD), which indicates the birth and death times of these holes as scale varies. A common way to compare PDs is by a point-to-point matching, which is given by the -Wasserstein metric. However, a big drawback of this approach is the need to solve correspondence between points before computing the distance; for points, the complexity grows according to n. Instead, we propose to use an entirely new framework built on Riemannian geometry, that models PDs as 2D probability…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
