首页> 外文学位 >Procedural encoding and visualization of large volumetric scattered data.
【24h】

Procedural encoding and visualization of large volumetric scattered data.

机译:大体积分散数据的过程编码和可视化。

获取原文
获取原文并翻译 | 示例

摘要

Recent improvements in computational capability have given scientists increased ability to simulate large-scale, complex, real world phenomena. The data sets generated from these simulations vary in structure and organization, and rendering these complex topological connectivities is still a challenging problem. In this thesis, however, we move away from the traditional methods of visualizing simulation data, and present a novel approach that procedurally encodes the simulation data and discards the underlying grid and connectivity information. This encoding enables interactive manipulation and rendering of these large-scale simulations and requires significantly less storage than that needed for the original data representation. This thesis presents the complete process required to procedurally encode volumetric data using radial basis functions (RBFs). Several solution techniques for obtaining parameters needed in the RBF representations are described. These techniques range from low-cost clustering algorithms to computationally expensive nonlinear optimizations. A comparison of these techniques and the different basis functions targeting both low encoding errors and interactive renderings is presented. This functional approximation system is also extended to using more general basis functions, such as ellipsoidal basis functions (EBFs) that provide greater compression and visually more accurate encodings of volumetric scattered datasets. From the procedural encoding, compression ratios between 19:1 and 8075:1 can be obtained. Moreover, with the compact and accurate RBF and EBF functional representations of large-scale complex data, interactive rendering of data can be performed with desktop PCs utilizing commodity graphics hardware. In addition to static data approximation, temporal data is encoded using results from encoding previous timestep to speed the encoding time.
机译:计算能力的最新改进使科学家具有增强的能力,可以模拟大规模,复杂,真实的现象。这些模拟生成的数据集的结构和组织各不相同,而呈现这些复杂的拓扑连接性仍然是一个具有挑战性的问题。然而,在本文中,我们摆脱了传统的可视化模拟数据的方法,提出了一种新颖的方法,该方法对模拟数据进行程序编码,并丢弃底层的网格和连通性信息。这种编码实现了这些大规模仿真的交互操作和渲染,并且与原始数据表示所需的存储相比,所需的存储量要少得多。本文提出了使用径向基函数(RBF)对体积数据进行程序编码所需的完整过程。描述了几种用于获得RBF表示形式中所需参数的解决方案技术。这些技术的范围从低成本的聚类算法到计算上昂贵的非线性优化。给出了这些技术与针对低编码错误和交互式渲染的不同基础函数的比较。此功能逼近系统也已扩展为使用更通用的基函数,例如椭圆基函数(EBF),可提供更大的压缩率和体积上分散的数据集的直观更准确的编码。从过程编码中,可以获得19:1到8075:1之间的压缩率。此外,利用大型复杂数据的紧凑,准确的RBF和EBF功能表示,可以使用商用图形硬件在台式PC上执行数据的交互式呈现。除了静态数据近似外,还使用来自先前时间步编码的结果对时间数据进行编码,以加快编码时间。

著录项

  • 作者

    Jang, Yun.;

  • 作者单位

    Purdue University.;

  • 授予单位 Purdue University.;
  • 学科 Computer Science.
  • 学位 Ph.D.
  • 年度 2007
  • 页码 137 p.
  • 总页数 137
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号