MPI-INF Logo
Campus Event Calendar

Event Entry

What and Who

Extended Branch Decomposition Graphs: Structural Comparison of Scalar Data

Tino Weinkauf
Max-Planck-Institut für Informatik - D4
AG1 Mittagsseminar (own work)
AG 1, AG 2, AG 3, AG 4, AG 5, RG1, SWS, MMCI  
AG Audience
English

Date, Time and Location

Tuesday, 26 August 2014
13:00
30 Minutes
E1 4
024
Saarbrücken

Abstract

We present a method to find repeating topological structures in scalar data sets. More precisely, we compare all subtrees of two merge trees against each other - in an efficient manner exploiting redundancy. This provides pair-wise distances between the topological structures defined by sub/superlevel sets, which can be exploited in several applications such as finding similar structures in the same data set, assessing periodic behavior in time-dependent data, and comparing the topology of two different data sets. To do so, we introduce a novel data structure called the extended branch decomposition graph, which is composed of the branch decompositions of all subtrees of the merge tree. Based on dynamic programming, we provide two highly efficient algorithms for computing and comparing extended branch decomposition graphs. Several applications attest to the utility of our method and its robustness against noise.

Contact

Michael Kerber
--email hidden
passcode not visible
logged in users only

Michael Kerber, 07/28/2014 17:09 -- Created document.