Tracking Features in Embedded Surfaces: Understanding Extinction in Turbulent Combustion Wathsala Widanagamaachchi in collaboration with Pavol Klacansky,

Slides:



Advertisements
Similar presentations
O(N 1.5 ) divide-and-conquer technique for Minimum Spanning Tree problem Step 1: Divide the graph into  N sub-graph by clustering. Step 2: Solve each.
Advertisements

Yang Yang, Miao Jin, Hongyi Wu Presenter: Buri Ban The Center for Advanced Computer Studies (CACS) University of Louisiana at Lafayette 3D Surface Localization.
Fast Algorithms For Hierarchical Range Histogram Constructions
Memory-Efficient Sliding Window Progressive Meshes Pavlo Turchyn University of Jyvaskyla.
Topology-Based Analysis of Time-Varying Data Scalar data is often used in scientific data to represent the distribution of a particular value of interest,
Developer’s Survey of Polygonal Simplification Algorithms Based on David Luebke’s IEEE CG&A survey paper.
BOAT - Optimistic Decision Tree Construction Gehrke, J. Ganti V., Ramakrishnan R., Loh, W.
Electron denisty, isosurfaces and contour trees Jack Snoeyink GCMB’07.
Contour Tree and Small Seed Sets for Isosurface Traversal Marc van Kreveld Rene van Oostrum Chandrajit Bajaj Valerio Pascucci Daniel R. Schikore.
On the use of Graph Search Techniques for the Analysis of Extreme-scale Combustion Simulation Data Janine Bennett 1 William McLendon III 1 Guarav Bansal.
Nice, 17/18 December 2001 Adaptive Grids For Bathymetry Mapping And Navigation Michel Chedid and Maria-João Rendas I3S - MAUVE.
Haptic Rendering using Simplification Comp259 Sung-Eui Yoon.
Shape from Contours and Multiple Stereo A Hierarchical, Mesh-Based Approach Hendrik Kück, Wolfgang Heidrich, Christian Vogelgsang.
January 5, Feature Tracking in VR for Cumulus Cloud Life-Cycle Studies E. J. Griffith, F. H. Post, M. Koutek, T. Heus and H. J. J. Jonker 11 th.
Approximating Sensor Network Queries Using In-Network Summaries Alexandra Meliou Carlos Guestrin Joseph Hellerstein.
lecture 4 : Isosurface Extraction
Iso-charts: Stretch-driven Mesh Parameterization using Spectral Analysis Kun Zhou, John Snyder*, Baining Guo, Heung-Yeung Shum Microsoft Research Asia.
1 Introduction to Topological Shape Modeling Part I Overview: What is topology?
Data Analysis and Visualization Using the Morse-Smale complex
Tetra-Cubes: An algorithm to generate 3D isosurfaces based upon tetrahedra BERNARDO PIQUET CARNEIRO CLAUDIO T. SILVA ARIE E. KAUFMAN Department of Computer.
Exploiting Correlated Attributes in Acquisitional Query Processing Amol Deshpande University of Maryland Joint work with Carlos Sam
Towards Topology-Rich Visualization Attila Gyulassy SCI Institute, University of Utah.
Fast Isocontouring For Improved Interactivity Chandrajit L. Bajaj Valerio Pascucci Daniel R. Schikore.
Scientific Visualization Data and Geometry Processing for Scientific Visualization CS 5630 / 6630 August 28, 2007.
A Novel 2D To 3D Image Technique Based On Object- Oriented Conversion.
Visualization and graphics research group CIPIC January 21, 2003Multiresolution (ECS 289L) - Winter Surface Simplification Using Quadric Error Metrics.
Clustering Vertices of 3D Animated Meshes
In-situ Visualization and Analysis of Plasma Surface Interaction Simulations Wathsala Widanagamaachchi SCI Institute, University of Utah Mentors : Li-Ta.
Isosurface Extractions 2D Isocontour 3D Isosurface.
Morphological Analysis of 3D Scalar Fields based on Morse Theory and Discrete Distortion Mohammed Mostefa Mesmoudi Leila De Floriani Paola Magillo Dept.
Tracking Surfaces with Evolving Topology Morten Bojsen-Hansen IST Austria Hao Li Columbia University Chris Wojtan IST Austria.
Presented By Greg Gire Advised By Zoë Wood California Polytechnic State University.
Introduction Surgical training environments as well as pre- and intra-operative planning environments require physics-based simulation systems to achieve.
Constructing Optimal Wavelet Synopses Dimitris Sacharidis Timos Sellis
FREERIDE: System Support for High Performance Data Mining Ruoming Jin Leo Glimcher Xuan Zhang Ge Yang Gagan Agrawal Department of Computer and Information.
Mingyang Zhu, Huaijiang Sun, Zhigang Deng Quaternion Space Sparse Decomposition for Motion Compression and Retrieval SCA 2012.
Human pose recognition from depth image MS Research Cambridge.
An Efficient Linear Time Triple Patterning Solver Haitong Tian Hongbo Zhang Zigang Xiao Martin D.F. Wong ASP-DAC’15.
Polygonal Simplification Techniques
112/5/ :54 Graphics II Image Based Rendering Session 11.
Edge Maps: Representation of Consistent Flow, Error and Uncertainty Publications: H. Bhatia, S. Jadhav, P.-T. Bremer, G. Chen, J.A. Levine, L.G. Nonato,
Photo-realistic Rendering and Global Illumination in Computer Graphics Spring 2012 Hybrid Algorithms K. H. Ko School of Mechatronics Gwangju Institute.
Large Scale Time-Varying Data Visualization Han-Wei Shen Department of Computer and Information Science The Ohio State University.
Tracking Turbulent 3D Features Lu Zhang Nov. 10, 2005.
CHAPTER 5 CONTOURING. 5.3 CONTOURING Fig 5.7. Relationship between color banding and contouring Contour line (isoline): the same scalar value, or isovalue.
Discontinuous Displacement Mapping for Volume Graphics, Volume Graphics 2006, July 30, Boston, MA Discontinuous Displacement Mapping for Volume Graphics.
Advanced Visualization Overview. Course Structure Syllabus Reading / Discussions Tests Minor Projects Major Projects For.
Riccardo Fellegara University of Genova Genova, Italy
Application: Multiresolution Curves Jyun-Ming Chen Spring 2001.
CSE554Contouring IISlide 1 CSE 554 Lecture 3: Contouring II Fall 2011.
CSE554Contouring IISlide 1 CSE 554 Lecture 5: Contouring (faster) Fall 2013.
A comparative approach for gene network inference using time-series gene expression data Guillaume Bourque* and David Sankoff *Centre de Recherches Mathématiques,
Image-Based Rendering Geometry and light interaction may be difficult and expensive to model –Think of how hard radiosity is –Imagine the complexity of.
CDS 301 Fall, 2008 Domain-Modeling Techniques Chap. 8 November 04, 2008 Jie Zhang Copyright ©
Slide 1Lecture Fall ‘00 Surface Modeling Types: Polygon surfaces Curved surfaces Volumes Generating models: Interactive Procedural.
1 Chapter 5 Branch-and-bound Framework and Its Applications.
UNC Chapel Hill David A. O’Brien Automatic Simplification of Particle System Dynamics David O’Brien Susan Fisher Ming C. Lin Department of Computer Science.
Application of Probability Density Function - Optimal Interpolation in Hourly Gauge-Satellite Merged Precipitation Analysis over China Yan Shen, Yang Pan,
Simplified Representation of Vector Fields
3.1 Clustering Finding a good clustering of the points is a fundamental issue in computing a representative simplicial complex. Mapper does not place any.
STBVH: A Spatial-Temporal BVH for Efficient Multi-Segment Motion Blur
Graphics and Visualizations in Dimensions Greater than Three
On the Death of SciVis Han-Wei Shen
Mean Shift Segmentation
Main Project total points: 500
Using Flow Textures to Visualize Unsteady Vector Fields
3.1 Clustering Finding a good clustering of the points is a fundamental issue in computing a representative simplicial complex. Mapper does not place any.
Homogeneity Guided Probabilistic Data Summaries for Analysis and Visualization of Large-Scale Data Sets Ohio State University (Shen) Problem: Existing.
for Vision-Based Navigation
In Situ Fusion Simulation Particle Data Reduction Through Binning
Presentation transcript:

Tracking Features in Embedded Surfaces: Understanding Extinction in Turbulent Combustion Wathsala Widanagamaachchi in collaboration with Pavol Klacansky, Hemanth Kolla, Ankit Bhagatwala, Jackie Chen, Valerio Pascucci and Peer-Timo Bremer

Tracking features over time is challenging Scientific simulations produce large datasets Understanding evolution of features is of interest Involves three steps: –D–Define feature-of-interest within each time step –C–Correlating features between successive time steps –A–Analyzing resulting feature tracks

Use case: DNS of a turbulent jet flame Di-methyl ether fuel stream in an oxidizer co-flow undergoing extinction and re-ignition stages

Use case: DNS of a turbulent jet flame Flame is an iso-surface of mixture fraction – the ratio of unburnt fuel versus combustion products OH concentration, classifies the flame into burning regions (red) and extinction holes (blue) Tracking extinction holes over time

Use case: DNS of a turbulent jet flame Challenges: – Flame evolves discontinuously due to low temporal resolution A repeated analysis is not feasible Complex fast moving geometry No common domain for tracking Temporal interpolation artifacts – Extinction threshold is uncertain and unstable Exploring how evolution differs for different thresholds Parameter instabilities in the tracking Complex and convoluted tracking graphs

Contributions Parameter-independent approach for tracking features embedded in time-dependent surfaces Approach to remove artifacts caused by temporal undersampling in tracking graphs A progressive, three-pass algorithm to produce temporally cohesive graphs A system to explore temporal evolution of features with applications to several large-scale combustion simulations

Related work Feature extraction – Iso-surfaces, interval volumes – Topology-based techniques: Morse-Smale complex, contour trees, merge trees – Our work uses: Merge trees with localized thresholds Feature correlation – Spatial overlap, predictor-based approaches – “Feature tracking using reeb graphs” - Weber et al. – Our work uses: Simpler, flexible approach using merge trees and space-time iso-volumes Data visualization – Animation, morphing, story telling, time series plots, tracking graphs – Our work uses: Tracking graphs with flexibility to simplify the graph

Background: Space-time iso-volumes Region of space (and time) swept by a moving iso-surface Linear interpolation in time and marching hypercubes algorithm of Bhaniramka et al. P. Bhaniramka, R. Wenger, and R. Crawfis. Isosurface construction in any dimension using convex hulls. IEEE Trans. Vis. Comp. Graph., 10(2):130–141, Mar Tetrahedral mesh with three spatial and one time coordinate

Background: Merge trees Encodes the hierarchical clustering of features for a wide range of parameters Function Value x y z Terrain Merge tree

Background: Merge trees Encodes the hierarchical clustering of features for a wide range of parameters Function Value x y z Terrain Merge tree

Background: Merge trees Encodes the hierarchical clustering of features for a wide range of parameters Function Value x y z Terrain Merge tree

Background: Merge trees Encodes the hierarchical clustering of features for a wide range of parameters Function Value x y z Terrain Merge tree

Extract features for a particular value by cutting the tree – Cut at a fixed threshold Background: Merge trees Function Value x y z Terrain Merge tree f1f1

Extract features for a particular value by cutting the tree – Cut at a fixed threshold – Arbitrary cut with localized thresholds Background: Merge trees Function Value x y z Terrain Merge tree f1f1

Correlating embedded features Spatial overlap tracking does not apply directly Compute explicit space-time iso-volume of mixture fraction between two consecutive time steps Interpolate the corresponding OH values at all its vertices Mesh defines the evolution of the extinction regions

Correlating embedded features Use overlap tracking on the three time steps Function Value Iso-surface Merge tree

Generating tracking graphs Features and their correlation details for each time step Function Value t=0 t=0+1 t=1 t=1+2 … … … f2f2

Resulting graphs large & highly complex Turbulent jet flame data set - First 26 of 101 time steps - Total of 51 time steps with the intermediate time steps - Only 1802 nodes Artifacts caused by… - Temporal undersampling - Parameter instabilities

Temporal artifact reduction Due to low temporal resolution of source data Solutions: – Repeat the Simulation – In-situ tracking – Alleviate artifacts using localized thresholds (too costly to consider in practice) (too costly, keeping two time steps in memory )

Temporal artifact reduction Temporal artifacts

Temporal artifact reduction Identify the nodes causing the temporal artifacts… high valence, merge-split nodes in intermediate time steps Lower their threshold value Separate the extinction holes across time and result in the correct tracking information f1f1 OH concentration

Temporal artifact reduction Results: Turbulent jet flame dataset – smaller graph Before After

Temporal artifact reduction Results: Turbulent jet flame dataset – longer graph Before After

Tracking graph simplification Due to parameter instabilities Features hover right at the threshold, causing repeated merges and splits in the tracking graph Function Value

Tracking graph simplification Use localized thresholds within a given error bound Reduce the total number of non-valence two nodes Produce temporally cohesive graphs Computing the optimal graph with the least number of non- valence two nodes within a threshold range is NP-hard.

Tracking graph simplification Progressive three-pass algorithm with a greedy heuristic: left-to-right, right-to-left, and a final left-to-right pass First two passes: greedily adjust each non-valence two node Third pass: move unresolved events back to original location

Original graph

First pass: left-to-right

Second pass: right-to-left

Third pass: left-to-right

Result

Tracking graph simplification Results : Turbulent premixed counter flow dataset Before After

Datasets Turbulent jet flame dataset – 101 time steps (1.5TB of data) – Resolution 920 X 1400 X 720 Turbulent premixed counter flow dataset – 1048 time steps (2.7TB of data) – Resolution 432 X 640 X 640 Idealized premixed hydrogen flame dataset – 100 time steps (400GB of data) – Resolution 256 X 256 X 768 Synthetic data (verification purposes)

Insights gained Temporal undersampling within simulation data Better extinction threshold values Use of tracking graphs in analyzing the growth of features over various conditions

Limitations Results from using localized threshold remains limited by the feature definition of the merge tree Only remove temporal artifacts where the artificial features in the in-between time are weaker Greedy nature of the three-pass layout algorithm does not guarantee optimal graphs

Results from using localized thresholds remains limited by the feature definition of the merge tree Only remove temporal artifacts where the artificial features in the in-between time are weaker Greedy nature of the three-pass layout algorithm does not guarantee optimal graphs Limitations

Summery Novel algorithm for tracking embedded features Tracking graphs to contain localized thresholds to enable removal of artifacts – Artifacts due to temporal undersampling – Artifacts due to parameter instabilities Applications to several large-scale combustion simulations

Tracking Features in Embedded Surfaces: Understanding Extinction in Turbulent Combustion Wathsala Widanagamaachchi, Pavol Klacansky, Hemanth Kolla, Ankit Bhagatwala, Jackie Chen, Valerio Pascucci and Peer-Timo Bremer.

Extra

Tracking graph simplification Selection of flexible feature definition parameters in tracking graphs Intuitive rendering of the range of outcomes Turbulent premixed counter flow dataset Extra

Tracking graph simplification Results : Idealized premixed hydrogen flame dataset Before After Extra