Lifted Wasserstein Matcher for Fast and Robust Topology Tracking

08/17/2018
by   Maxime Soler, et al.
0

This paper presents a robust and efficient method for tracking topological features in time-varying scalar data. Structures are tracked based on the optimal matching between persistence diagrams with respect to the Wasserstein metric. This fundamentally relies on solving the assignment problem, a special case of optimal transport, for all consecutive timesteps. Our approach relies on two main contributions. First, we revisit the seminal assignment algorithm by Kuhn and Munkres which we specifically adapt to the problem of matching persistence diagrams in an efficient way. Second, we propose an extension of the Wasserstein metric that significantly improves the geometrical stability of the matching of domain-embedded persistence pairs. We show that this geometrical lifting has the additional positive side-effect of improving the assignment matrix sparsity and therefore computing time. The global framework implements a coarse-grained parallelism by computing persistence diagrams and finding optimal matchings in parallel for every couple of consecutive timesteps. Critical trajectories are constructed by associating successively matched persistence pairs over time. Merging and splitting events are detected with a geometrical threshold in a post-processing stage. Extensive experiments on real-life datasets show that our matching approach is an order of magnitude faster than the seminal Munkres algorithm. Moreover, compared to a modern approximation method, our method provides competitive runtimes while yielding exact results. We demonstrate the utility of our global framework by extracting critical point trajectories from various simulated time-varying datasets and compare it to the existing methods based on associated overlaps of volumes. Robustness to noise and temporal resolution downsampling is empirically demonstrated.

READ FULL TEXT

page 3

page 5

page 6

page 7

page 8

research
10/30/2019

Nonembeddability of Persistence Diagrams with p>2 Wasserstein Metric

Persistence diagrams do not admit an inner product structure compatible ...
research
08/20/2019

Ranking Viscous Finger Simulations to an Acquired Ground Truth with Topology-aware Matchings

This application paper presents a novel framework based on topological d...
research
07/10/2019

Progressive Wasserstein Barycenters of Persistence Diagrams

This paper presents an efficient algorithm for the progressive approxima...
research
04/28/2023

Wasserstein Dictionaries of Persistence Diagrams

This paper presents a computational framework for the concise encoding o...
research
03/06/2023

A Topological Distance Measure between Multi-Fields for Classification and Analysis of Shapes and Data

Distance measures play an important role in shape classification and dat...
research
02/08/2018

Topologically Controlled Lossy Compression

This paper presents a new algorithm for the lossy compression of scalar ...
research
07/30/2018

Persistence Atlas for Critical Point Variability in Ensembles

This paper presents a new approach for the visualization and analysis of...

Please sign up or login with your details

Forgot password? Click here to reset