Robust Barycenters of Persistence Diagrams

This short paper presents a general approach for computing robust Wasserstein barycenters of persistence diagrams. The classical method consists in computing assignment arithmetic means after finding the optimal transport plans between the barycenter and the persistence diagrams. However, this procedure only works for the transportation cost related to the q-Wasserstein distance Wq when q=2. We adapt an alternative fixed-point method to compute a barycenter diagram for generic transportation costs (q > 1), in particular those robust to outliers, q ∈ (1,2). We show the utility of our work in two applications: (i) the clustering of persistence diagrams on their metric space and (ii) the dictionary encoding of persistence diagrams. In both scenarios, we demonstrate the added robustness to outliers provided by our generalized framework. Our Python implementation is available at this address: https://github.com/Keanu-Sisouk/RobustBarycenter .