DeepAI AI Chat
Log In Sign Up

Understanding the Topology and the Geometry of the Persistence Diagram Space via Optimal Partial Transport

by   Vincent Divol, et al.

We consider a generalization of persistence diagrams, namely Radon measures supported on the upper half plane for which we define natural extensions of Wasserstein and bottleneck distances between persistence diagrams. Such measures naturally appear in topological data analysis when considering continuous representations of persistence diagrams (e.g. persistence surfaces) but also as limits for laws of large numbers on persistence diagrams or as expectations of probability distributions on the persistence diagrams space. Introducing a formalism originating from the theory of optimal partial transport, we build a convenient framework to prove topological properties of this new space, which will also hold for the closed subspace of persistence diagrams. New results include a characterization of convergence with respect to Wasserstein metrics, and the existence of barycenters (Fréchet means) for any distribution of diagrams. We also showcase the strength of this framework by providing several statistical results made meaningful thanks to this new formalism.


page 1

page 2

page 3

page 4


k-Means Clustering for Persistent Homology

Persistent homology is a fundamental methodology from topological data a...

Learning on Persistence Diagrams as Radon Measures

Persistence diagrams are common descriptors of the topological structure...

Large Scale computation of Means and Clusters for Persistence Diagrams using Optimal Transport

Persistence diagrams (PDs) are now routinely used to summarize the under...

On the choice of weight functions for linear representations of persistence diagrams

Persistence diagrams are efficient descriptors of the topology of a poin...

Topology-Aware Focal Loss for 3D Image Segmentation

The efficacy of segmentation algorithms is frequently compromised by top...

Statistical learning on measures: an application to persistence diagrams

We consider a binary supervised learning classification problem where in...

Estimation and Quantization of Expected Persistence Diagrams

Persistence diagrams (PDs) are the most common descriptors used to encod...