Search Results for author:
Found 5 papers, 2 papers with code
Principal Geodesic Analysis of Merge Trees (and Persistence Diagrams)
We show the utility of our contributions by extending to merge trees two typical PCA applications.
Discrete Morse Sandwich: Fast Computation of Persistence Diagrams for Scalar Data -- An Algorithm and A Benchmark
This fast pre-computation for the dimensions $0$ and $(d - 1)$ enables an aggressive specialization of [4] to the 3D case, which results in a drastic reduction of the number of input simplices for the computation of $D_1(f)$, the intermediate layer of the sandwich.
Wasserstein Distances, Geodesics and Barycenters of Merge Trees
We extend recent work on the edit distance [106] and introduce a new metric, called the Wasserstein distance between merge trees, which is purposely designed to enable efficient computations of geodesics and barycenters.
Statistical Parameter Selection for Clustering Persistence Diagrams
In urgent decision making applications, ensemble simulations are an important way to determine different outcome scenarios based on currently available data.
Progressive Wasserstein Barycenters of Persistence Diagrams
This paper presents an efficient algorithm for the progressive approximation of Wasserstein barycenters of persistence diagrams, with applications to the visual analysis of ensemble data.
