Comparing Morse Complexes Using Optimal Transport: An Experimental Study
Mingzhe Li, Carson Storm, Austin Yang Li, Tom Needham, Bei Wang

TL;DR
This paper explores the use of optimal transport distances to compare Morse complexes efficiently, providing structural matching and practical guidelines for their application in visualization tasks.
Contribution
It introduces a novel application of optimal transport distances for comparing Morse complexes, emphasizing efficiency and structural matching capabilities.
Findings
Optimal transport distances are effective for Morse complex comparison.
The proposed method is computationally efficient.
Guidelines are provided for selecting distances based on data assumptions.
Abstract
Morse complexes and Morse-Smale complexes are topological descriptors popular in topology-based visualization. Comparing these complexes plays an important role in their applications in feature correspondences, feature tracking, symmetry detection, and uncertainty visualization. Leveraging recent advances in optimal transport, we apply a class of optimal transport distances to the comparative analysis of Morse complexes. Contrasting with existing comparative measures, such distances are easy and efficient to compute, and naturally provide structural matching between Morse complexes. We perform an experimental study involving scientific simulation datasets and discuss the effectiveness of these distances as comparative measures for Morse complexes. We also provide an initial guideline for choosing the optimal transport distances under various data assumptions.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTopological and Geometric Data Analysis · Image Retrieval and Classification Techniques · Data Management and Algorithms
