arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2108.03066cs.GR
收藏

Marching Square和Marching Cubes拓扑实例的不确定性可视化

Uncertainty Visualization of the Marching Squares and Marching Cubes Topology Cases

Tushar M. Athawale, Sudhanshu Sane, Chris R. Johnson

摘要:

移动正方形(MS)和移动立方体(MC)是科学数据水平集可视化中广泛使用的算法。在本文中,我们解决的挑战不确定性可视化的MS和MC算法的拓扑结构的情况下,不确定标量场数据采样在一个统一的网格。不确定数据的MS和MC拓扑情况下的可视化是具有挑战性的,由于其指数性质和多个拓扑情况下,每个网格单元的可能性。我们提出了拓扑的情况下计数和熵为基础的技术量化的MS和MC算法的拓扑情况下的不确定性时,在数据中的噪声与概率分布建模。我们证明了我们的技术独立和相关的不确定性假设的适用性。我们可视化量化的拓扑不确定性,通过颜色映射成比例的不确定性,以及在MS的情况下,在MC的情况下与交互式概率查询和熵等值面。我们证明了我们的不确定性量化框架的效用,在确定的等值表现出相对较高的拓扑不确定性。我们通过合成,模拟和hixel数据集上的结果说明了我们的技术的有效性。

英文摘要:

Marching squares (MS) and marching cubes (MC) are widely used algorithms for level-set visualization of scientific data. In this paper, we address the challenge of uncertainty visualization of the topology cases of the MS and MC algorithms for uncertain scalar field data sampled on a uniform grid. The visualization of the MS and MC topology cases for uncertain data is challenging due to their exponential nature and the possibility of multiple topology cases per cell of a grid. We propose the topology case count and entropy-based techniques for quantifying uncertainty in the topology cases of the MS and MC algorithms when noise in data is modeled with probability distributions. We demonstrate the applicability of our techniques for independent and correlated uncertainty assumptions. We visualize the quantified topological uncertainty via color mapping proportional to uncertainty, as well as with interactive probability queries in the MS case and entropy isosurfaces in the MC case. We demonstrate the utility of our uncertainty quantification framework in identifying the isovalues exhibiting relatively high topological uncertainty. We illustrate the effectiveness of our techniques via results on synthetic, simulation, and hixel datasets.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑