Scalar Field Comparison with Topological Descriptors: Properties and Applications for Scientific Visualization

Abstract

In topological data analysis and visualization, topological descriptors such as persistence diagrams, merge trees, contour trees, Reeb graphs, and Morse-Smale complexes play an essential role in capturing the shape of scalar field data. We present a state-of-the-art report on scalar field comparison using topological descriptors. We provide a taxonomy of existing approaches based on visualization tasks associated with three categories of data: single fields, time-varying fields, and ensembles. These tasks include symmetry detection, periodicity detection, key event/feature detection, feature tracking, clustering, and structure statistics. Our main contributions include the formulation of a set of desirable mathematical and computational properties of comparative measures, and the classification of visualization tasks and applications that are enabled by these measures.

References in corpus (21)

• A roadmap for the computation of persistent homology
• Statistical topological data analysis using persistence landscapes
• The Topology ToolKit
• Metrics for Graph Comparison: A Practitioner's Guide
• A persistence landscapes toolbox for topological statistics
• Persistence Images: A Stable Vector Representation of Persistent Homology
• Sliced Wasserstein Kernel for Persistence Diagrams
• PersLay: A Neural Network Layer for Persistence Diagrams and New Graph Topological Signatures
• Edit Distance between Merge Trees
• Categorified Reeb Graphs
• A Structural Average of Labeled Merge Trees for Uncertainty Visualization
• Learning metrics for persistence-based summaries and applications for graph classification
• Persistence Fisher Kernel: A Riemannian Manifold Kernel for Persistence Diagrams
• Structure and Stability of the 1-Dimensional Mapper
• Progressive Wasserstein Barycenters of Persistence Diagrams
• Topological Machine Learning with Persistence Indicator Functions
• Probabilistic Convergence and Stability of Random Mapper Graphs
• The ${\ell }^{\infty }$-Cophenetic Metric for Phylogenetic Trees as an Interleaving Distance
• Strong Equivalence of the Interleaving and Functional Distortion Metrics for Reeb Graphs
• Kernel method for persistence diagrams via kernel embedding and weight factor
• Moduli Spaces of Morse Functions for Persistence

Cited by in corpus (15)

• Branch Decomposition-Independent Edit Distances for Merge Trees
• A Deformation-based Edit Distance for Merge Trees
• Computing a Stable Distance on Merge Trees
• Intrinsic Interleaving Distance for Merge Trees
• A Task-Parallel Approach for Localized Topological Data Structures
• Fast Comparative Analysis of Merge Trees Using Locality Sensitive Hashing
• Jacobi Set Driven Search for Flexible Fiber Surface Extraction
• A General Framework for Augmenting Lossy Compressors with Topological Guarantees
• Taming Horizontal Instability in Merge Trees: On the Computation of a Comprehensive Deformation-based Edit Distance
• Flexible and Probabilistic Topology Tracking with Partial Optimal Transport
• Merge Tree Geodesics and Barycenters with Path Mappings
• Time-varying Extremum Graphs
• Jacobi Set Simplification for Tracking Topological Features in Time-Varying Scalar Fields
• A Domain-Oblivious Approach for Learning Concise Representations of Filtered Topological Spaces for Clustering
• Bounding the Interleaving Distance for Mapper Graphs with a Loss Function