arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2312.15073cs.DC
收藏

面向函数逼近建模的大规模科学数据的可扩展体可视化

Scalable Volume Visualization for Big Scientific Data Modeled by Functional Approximation

Jianxin Sun, David Lenz, Hongfeng Yu, Tom Peterka

AI总结:

针对大规模科学数据可视化中MFA模型查询慢的问题,提出分布式可扩展体可视化流水线MFA-DVV,通过分布式架构和压缩模型降低输入延迟,实现高质量交互式渲染。

摘要:

考虑到处理大规模科学体数据时在空间和时间复杂度方面面临的挑战,人们已经开发了多种数据表示方法用于大规模科学数据的分析。多元函数逼近(MFA)是一种创新的数据模型,旨在应对科学数据分析中的重大挑战。它在整个空间域内以高阶精度计算值和导数,减轻了与零阶或一阶插值相关的伪影。然而,通过MFA进行查询的速度较慢,使其不太适合交互式可视化大型MFA模型。在本工作中,我们开发了第一个可扩展的交互式体可视化流水线MFA-DVV,用于处理从大规模数据集编码得到的MFA模型。我们的方法通过分布式架构实现了低输入延迟,并且通过利用压缩的MFA模型可以进一步提升其性能,同时仍能为科学数据集保持高质量的渲染结果。我们进行了全面的实验,表明与现有方法相比,MFA-DVV能够降低输入延迟,并为大规模科学数据实现更优的可视化结果。

英文摘要:

Considering the challenges posed by the space and time complexities in handling extensive scientific volumetric data, various data representations have been developed for the analysis of large-scale scientific data. Multivariate functional approximation (MFA) is an innovative data model designed to tackle substantial challenges in scientific data analysis. It computes values and derivatives with high-order accuracy throughout the spatial domain, mitigating artifacts associated with zero- or first-order interpolation. However, the slow query time through MFA makes it less suitable for interactively visualizing a large MFA model. In this work, we develop the first scalable interactive volume visualization pipeline, MFA-DVV, for the MFA model encoded from large-scale datasets. Our method achieves low input latency through distributed architecture, and its performance can be further enhanced by utilizing a compressed MFA model while still maintaining a high-quality rendering result for scientific datasets. We conduct comprehensive experiments to show that MFA-DVV can decrease the input latency and achieve superior visualization results for big scientific data compared with existing approaches.

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

↑