mlsanityData to 7 Oct 2026

Continuous Edit Distance, Geodesics and Barycenters of Time-varying Persistence Diagrams

arXiv 2512.12939 ↗First posted 15 Dec 2025cs.CG cs.CV cs.GRcited by 0

Not on the map. Why?

Abstract (arXiv)

We introduce the Continuous Edit Distance (CED), a geodesic and elastic distance for time-varying persistence diagrams (TVPDs). The CED extends edit-distance ideas to TVPDs by combining local substitution costs with penalized deletions/insertions, controlled by two parameters: (α) (trade-off between temporal misalignment and diagram discrepancy) and (β) (gap penalty). We also provide an explicit construction of CED-geodesics. Building on these ingredients, we present two practical barycenter solvers, one stochastic and one greedy, that monotonically decrease the CED Frechet energy. Empirically, the CED is robust to additive perturbations (both temporal and spatial), recovers temporal shifts, and supports temporal pattern search. On real-life datasets, the CED achieves clustering performance comparable or better than standard elastic dissimilarities, while our clustering based on CED-barycenters yields superior classification results. Overall, the CED equips TVPD analysis with a principled distance, interpretable geodesics, and practical barycenters, enabling alignment, comparison, averaging, and clustering directly in the space of TVPDs. A C++ implementation is provided for reproducibility at the following address https://github.com/sebastien-tchitchek/ContinuousEditDistance.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 19 of its 75 references that are in the map. First posted on arXiv 15 Dec 2025.

Builds on

19 of 75 references.

References · 19

  1. 2017Soft-DTW: a Differentiable Loss Function for Time-Seriescited by 265
  2. 2018The Topology ToolKitcited by 39
  3. 2018Large Scale computation of Means and Clusters for Persistence Diagrams using Optimal Transportcited by 32
  4. 2021Wasserstein Distances, Geodesics and Barycenters of Merge Treescited by 16
  5. 2019Task-based Augmented Contour Trees with Fibonacci Heapscited by 15
  6. 2019Progressive Wasserstein Barycenters of Persistence Diagramscited by 15
  7. 2019Ranking Viscous Finger Simulations to an Acquired Ground Truth with Topology-aware Matchingscited by 13
  8. 2020TopoMap: A 0-dimensional Homology Preserving Projection of High-Dimensional Datacited by 13
  9. 2014An Empirical Evaluation of Similarity Measures for Time Series Classificationcited by 12
  10. 2018Persistence Atlas for Critical Point Variability in Ensemblescited by 11
  11. 2022Discrete Morse Sandwich: Fast Computation of Persistence Diagrams for Scalar Data -- An Algorithm and A Benchmarkcited by 11
  12. 2022Topological Analysis of Ensembles of Hydrodynamic Turbulent Flows -- An Experimental Studycited by 11
7 more
  1. 2017Nonsmooth Analysis and Subgradient Methods for Averaging in Dynamic Time Warping Spacescited by 10
  2. 2022Topological data analysis of vortices in the magnetically-induced current density in LiH moleculecited by 9
  3. 2022Principal Geodesic Analysis of Merge Trees (and Persistence Diagrams)cited by 8
  4. 2013Probabilistic Fr'echet Means for Time Varying Persistence Diagramscited by 3
  5. 2023TTK is Getting MPI-Readycited by 3
  6. 2025BondMatcher: H-Bond Stability Analysis in Molecular Systemscited by 2
  7. 2025Distributed Discrete Morse Sandwich: Efficient Computation of Persistence Diagrams for Massive Scalar Datacited by 1

Built on by

Not cited yet.