+**********************************************************************
*
*
*                          Einladung
*
*
*
*                     Informatik-Oberseminar
*
*
*
+**********************************************************************

Zeit:  Freitag, 19. Februar 2021, 11.00 Uhr
Zoom:   https://rwth.zoom.us/j/2452218628

Referent: Andrea Schnorr, M.Sc.
          LuFG i12

Thema: Feature Tracking for Space-Filling Structures

Abstract:

Feature-based visualization is a proven strategy to deal with the massive amounts of data emerging from time-dependent simulations: the analysis focuses on meaningful structures, i.e., said features.
Feature tracking algorithms aim at automatically finding corresponding objects in successive time steps of these time-dependent data sets in order to assemble the individual objects into spatio-temporal features.
Classically, feature-based visualization has focused on sparse structures, i.e. structures which cover only a small portion of the data domain.
Given a sufficiently high temporal resolution, existing tracking approaches are able to reliably resolve the correspondence between feature objects of successive time steps.

Our research is motivated by our collaborators' work on the statistical analysis of structures that are space-filling by definition: dissipation elements.
Space-filling structures partition the entire domain.
Our collaborators aim at extending their statistical analysis to a time-dependent setting.
Hence, we introduce an efficient approach for general feature tracking which handles both sparse and space-filling data.
To this end, we develop a framework for automatic evaluation of tracking approaches, an algorithmic framework for feature tracking, and an efficient implementation of this framework.

First, we propose a novel evaluation framework based on algorithmic data generators, which provide synthetic data sets and the corresponding ground truth data.
This framework facilitates the structured quantitative analysis of an approach's feature tracking performance and the comparison of different approaches based on the resulting measurements.
Second, we introduce a novel approach for tracking both sparse and space-filling features.
The correspondence between neighboring time-steps is determined by successively solving two graph optimization problems.
In the first phase, one-to-one assignments are resolved by computing a maximum-weight, maximum-cardinality matching on a bi-partite graph.
In its second phase, the algorithm detects events by finding a maximum weight independent set in a graph of all possible, potentially conflicting event explanations.
Third, we show an optimized version of the second stage of the tracking framework which exploits the model-specific graph structure arising for the tracking problem.
The method's effectiveness is demonstrated by a set of case studies including the use of the evaluation framework as well as the analysis of miscellaneous real-world simulation data sets.


Es laden ein: die Dozentinnen und Dozenten der Informatik