Edit Distance between Merge Trees

Topological structures such as the merge tree provide an abstract and succinct representation of scalar fields. They facilitate effective visualization and interactive exploration of feature-rich data. A merge tree captures the topology of sub-level and super-level sets in a scalar field. Estimating the similarity between merge trees is an important problem with applications to feature-directed visualization of time-varying data. We present an approach based on tree edit distance to compare merge trees. The comparison measure satisfies metric properties, it can be computed efficiently, and the cost model for the edit operations is both intuitive and captures well-known properties of merge trees. Experimental results on time-varying scalar fields, 3D cryo electron microscopy data, shape data, and various synthetic datasets show the utility of the edit distance towards a feature-driven analysis of scalar fields.

[1]  Tino Weinkauf,et al.  Global Feature Tracking and Similarity Estimation in Time‐Dependent Scalar Fields , 2017, Comput. Graph. Forum.

[2]  Kaizhong Zhang,et al.  Algorithms for the constrained editing distance between ordered labeled trees and related problems , 1995, Pattern Recognit..

[3]  Hans-Peter Seidel,et al.  Extended Branch Decomposition Graphs: Structural Comparison of Scalar Data , 2014, Comput. Graph. Forum.

[4]  Vijay Natarajan,et al.  Detecting Symmetry in Scalar Fields Using Augmented Extremum Graphs , 2013, IEEE Transactions on Visualization and Computer Graphics.

[5]  Kaizhong Zhang,et al.  On the Editing Distance Between Unordered Labeled Trees , 1992, Inf. Process. Lett..

[6]  Herbert Edelsbrunner,et al.  Topological Persistence and Simplification , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[7]  Philip N. Klein,et al.  A tree-edit-distance algorithm for comparing simple, closed shapes , 2000, SODA '00.

[8]  Gunther H. Weber,et al.  Interleaving Distance between Merge Trees , 2013 .

[9]  Vijay Natarajan,et al.  A parallel and memory efficient algorithm for constructing the contour tree , 2015, 2015 IEEE Pacific Visualization Symposium (PacificVis).

[10]  Hans-Peter Seidel,et al.  Smoke Surfaces: An Interactive Flow Visualization Technique Inspired by Real-World Flow Experiments , 2008, IEEE Transactions on Visualization and Computer Graphics.

[11]  Harold W. Kuhn,et al.  The Hungarian method for the assignment problem , 1955, 50 Years of Integer Programming.

[12]  Hélène Touzet,et al.  Tree edit distance with gaps , 2003, Inf. Process. Lett..

[13]  Vijay Natarajan,et al.  A Gradient‐Based Comparison Measure for Visual analysis of Multifield Data , 2011, Comput. Graph. Forum.

[14]  Hans-Peter Seidel,et al.  Multifield-Graphs: An Approach to Visualizing Correlations in Multifield Scalar Data , 2006, IEEE Transactions on Visualization and Computer Graphics.

[15]  Rüdiger Westermann,et al.  Multi-Charts for Comparative 3D Ensemble Visualization , 2014, IEEE Transactions on Visualization and Computer Graphics.

[16]  Christophe Godin,et al.  A distance measure between plant architectures , 2000 .

[17]  Ulrich Bauer,et al.  Measuring Distance between Reeb Graphs , 2013, SoCG.

[18]  Vijay Natarajan,et al.  Computing Reeb Graphs as a Union of Contour Trees , 2013, IEEE Transactions on Visualization and Computer Graphics.

[19]  Taku Komura,et al.  Topology matching for fully automatic similarity estimation of 3D shapes , 2001, SIGGRAPH.

[20]  Kyle Fox,et al.  Computing the Gromov-Hausdorff Distance for Metric Trees , 2015, ISAAC.

[21]  Kaizhong Zhang,et al.  Simple Fast Algorithms for the Editing Distance Between Trees and Related Problems , 1989, SIAM J. Comput..

[22]  James P. Ahrens,et al.  Homogeneity guided probabilistic data summaries for analysis and visualization of large-scale data sets , 2017, 2017 IEEE Pacific Visualization Symposium (PacificVis).

[23]  F. Sadlo,et al.  Hierarchies and Ranks for Persistence Pairs , 2019, 1907.13495.

[24]  Joshua A. Levine,et al.  The Topology ToolKit , 2018, IEEE Transactions on Visualization and Computer Graphics.

[25]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[26]  Giorgio A. Ascoli,et al.  Topological characterization of neuronal arbor morphology via sequence representation: II - global alignment , 2015, BMC Bioinformatics.

[27]  Talha Bin Masood,et al.  Scalar field visualization via extraction of symmetric structures , 2013, The Visual Computer.

[28]  Gunther H. Weber,et al.  Computing and Visualizing Time-Varying Merge Trees for High-Dimensional Data , 2015 .

[29]  Holger Theisel,et al.  Streak Lines as Tangent Curves of a Derived Vector Field , 2010, IEEE Transactions on Visualization and Computer Graphics.

[30]  C. Villani.  Optimal Transport: Old and New , 2008 .

[31]  Hangjun Xu,et al.  An Algorithm for Comparing Similarity Between Two Trees , 2015, ArXiv.

[32]  Bernd Hamann,et al.  Measuring the Distance Between Merge Trees , 2014, Topological Methods in Data Analysis and Visualization.

[33]  M. Levandowsky,et al.  Distance between Sets , 1971, Nature.

[34]  Kaizhong Zhang,et al.  A constrained edit distance between unordered labeled trees , 1996, Algorithmica.

[35]  Atsuhiro Takasu,et al.  A clique-based method for the edit distance between unordered trees and its application to analysis of glycan structures , 2011, BMC Bioinformatics.

[36]  Robert Giegerich,et al.  Forest alignment with affine gaps and anchors, applied in RNA structure comparison , 2013, Theor. Comput. Sci..

[37]  Claudia Landi,et al.  The Edit Distance for Reeb Graphs of Surfaces , 2014, Discret. Comput. Geom..

[38]  Gunther H. Weber,et al.  Distributed merge trees , 2013, PPoPP '13.

[39]  Hans-Peter Seidel,et al.  Fast Similarity Search in Scalar Fields using Merging Histograms , 2015 .

[40]  C. C. Law,et al.  ParaView: An End-User Tool for Large-Data Visualization , 2005, The Visualization Handbook.

[41]  Vijay Natarajan,et al.  Symmetry in Scalar Field Topology , 2011, IEEE Transactions on Visualization and Computer Graphics.

[42]  Vijay Natarajan,et al.  Multiscale Symmetry Detection in Scalar Fields by Clustering Contours , 2014, IEEE Transactions on Visualization and Computer Graphics.

[43]  Vijay Natarajan,et al.  Distance between extremum graphs , 2015, 2015 IEEE Pacific Visualization Symposium (PacificVis).

[44]  Philip Bille,et al.  A survey on tree edit distance and related problems , 2005, Theor. Comput. Sci..

[45]  Tamal K. Dey,et al.  Comparing Graphs via Persistence Distortion , 2015, SoCG.

[46]  David Cohen-Steiner,et al.  Stability of Persistence Diagrams , 2005, Discret. Comput. Geom..

[47]  Tijl De Bie,et al.  SuMoTED: An intuitive edit distance between rooted unordered uniquely-labelled trees , 2016, Pattern Recognit. Lett..

[48]  Jack Snoeyink,et al.  Computing contour trees in all dimensions , 2000, SODA '00.