Efficient Computation of Combinatorial Feature Flow Fields

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...

Ausführliche Beschreibung

Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on visualization and computer graphics. - 1996. - 18(2012), 9 vom: 01. Sept., Seite 1563-73
1. Verfasser: Reininghaus, Jan (VerfasserIn)
Weitere Verfasser: Kasten, Jens, Weinkauf, Tino, Hotz, Ingrid
Format: Online-Aufsatz
Sprache:English
Veröffentlicht: 2012
Zugriff auf das übergeordnete Werk:IEEE transactions on visualization and computer graphics
Schlagworte:Journal Article Research Support, Non-U.S. Gov't
LEADER 01000naa a22002652 4500
001 NLM212485679
003 DE-627
005 20231224015628.0
007 cr uuu---uuuuu
008 231224s2012 xx |||||o 00| ||eng c
024 7 |a 10.1109/TVCG.2011.269  |2 doi 
028 5 2 |a pubmed24n0708.xml 
035 |a (DE-627)NLM212485679 
035 |a (NLM)22025749 
040 |a DE-627  |b ger  |c DE-627  |e rakwb 
041 |a eng 
100 1 |a Reininghaus, Jan  |e verfasserin  |4 aut 
245 1 0 |a Efficient Computation of Combinatorial Feature Flow Fields 
264 1 |c 2012 
336 |a Text  |b txt  |2 rdacontent 
337 |a ƒaComputermedien  |b c  |2 rdamedia 
338 |a ƒa Online-Ressource  |b cr  |2 rdacarrier 
500 |a Date Completed 01.12.2015 
500 |a Date Revised 11.09.2015 
500 |a published: Print-Electronic 
500 |a Citation Status PubMed-not-MEDLINE 
520 |a 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 
650 4 |a Journal Article 
650 4 |a Research Support, Non-U.S. Gov't 
700 1 |a Kasten, Jens  |e verfasserin  |4 aut 
700 1 |a Weinkauf, Tino  |e verfasserin  |4 aut 
700 1 |a Hotz, Ingrid  |e verfasserin  |4 aut 
773 0 8 |i Enthalten in  |t IEEE transactions on visualization and computer graphics  |d 1996  |g 18(2012), 9 vom: 01. Sept., Seite 1563-73  |w (DE-627)NLM098269445  |x 1941-0506  |7 nnns 
773 1 8 |g volume:18  |g year:2012  |g number:9  |g day:01  |g month:09  |g pages:1563-73 
856 4 0 |u http://dx.doi.org/10.1109/TVCG.2011.269  |3 Volltext 
912 |a GBV_USEFLAG_A 
912 |a SYSFLAG_A 
912 |a GBV_NLM 
912 |a GBV_ILN_350 
951 |a AR 
952 |d 18  |j 2012  |e 9  |b 01  |c 09  |h 1563-73