Efficient Computation of Combinatorial Feature Flow Fields
2012 (English)In: IEEE Transactions on Visualization and Computer Graphics, ISSN 1077-2626, Vol. 18, no 9, 1563-1573 p.Article in journal (Refereed) PublishedText
We propose a combinatorial algorithm to track critical points of 2D time-dependent scalar fields. Existing tracking algorithms such as Feature Flow Fields apply numerical schemes utilizing derivatives of the data, which makes them prone to noise and involve a large number of computational parameters. In contrast, our method is robust against noise since it does not require derivatives, interpolation, and numerical integration. Furthermore, we propose an importance measure that combines the spatial persistence of a critical point with its temporal evolution. This leads to a time-aware feature hierarchy, which allows us to discriminate important from spurious features. Our method requires only a single, easy-to-tune computational parameter and is naturally formulated in an out-of-core fashion, which enables the analysis of large data sets. We apply our method to synthetic data and data sets from computational fluid dynamics and compare it to the stabilized continuous Feature Flow Field tracking algorithm.
Place, publisher, year, edition, pages
IEEE , 2012. Vol. 18, no 9, 1563-1573 p.
Research subject Computer Science; SRA - E-Science (SeRC)
IdentifiersURN: urn:nbn:se:kth:diva-184842DOI: 10.1109/TVCG.2011.269ISI: 000306367400016ScopusID: 2-s2.0-84864151049OAI: oai:DiVA.org:kth-184842DiVA: diva2:916896
QC 201604182016-04-052016-04-052016-04-18Bibliographically approved