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

用于科学可视化的快速压缩分割体数据

Fast Compressed Segmentation Volumes for Scientific Visualization

Max Piochowiak, Carsten Dachsbacher

AI总结:

本文提出一种针对分割体数据的无损压缩技术,通过迭代细化编码小块标签及边界,结合全局频率表的rANS熵编码,实现高吞吐量(GB/s级)和约1%-3%的强压缩比,并支持GPU实时可视化与细节层次渲染。

摘要:

基于体素的分割体数据通常存储大量标签和体素,由此产生的数据量可能使存储、传输和交互式可视化变得困难。我们提出了一种无损压缩技术来解决这些挑战。该技术处理分割体数据中的各个小块,并通过迭代细化方案紧凑地编码标记区域及其边界。每个小块的结果是一个标签列表,以及一系列用于重建该小块的运算序列,该序列进一步使用rANS熵编码进行压缩。由于各小块间运算的相对频率非常相似,熵编码可以对整个数据集使用全局频率表,从而实现高效且有效的并行(解)压缩。我们的技术实现了高吞吐量(压缩和解压缩均可达每秒千兆字节级别)以及约原始数据集大小1%至3%的强压缩比,同时适用于基于GPU的渲染。我们针对来自不同领域的多种数据集评估了我们的方法,并展示了基于GPU的体数据可视化,包括即时解压缩、细节层次渲染(可选地将细节系数按需流式传输到GPU),以及用于解压缩小块的缓存策略以进一步提升性能。

英文摘要:

Voxel-based segmentation volumes often store a large number of labels and voxels, and the resulting amount of data can make storage, transfer, and interactive visualization difficult. We present a lossless compression technique which addresses these challenges. It processes individual small bricks of a segmentation volume and compactly encodes the labelled regions and their boundaries by an iterative refinement scheme. The result for each brick is a list of labels, and a sequence of operations to reconstruct the brick which is further compressed using rANS-entropy coding. As the relative frequencies of operations are very similar across bricks, the entropy coding can use global frequency tables for an entire data set which enables efficient and effective parallel (de)compression. Our technique achieves high throughput (up to gigabytes per second both for compression and decompression) and strong compression ratios of about 1% to 3% of the original data set size while being applicable to GPU-based rendering. We evaluate our method for various data sets from different fields and demonstrate GPU-based volume visualization with on-the-fly decompression, level-of-detail rendering (with optional on-demand streaming of detail coefficients to the GPU), and a caching strategy for decompressed bricks for further performance improvement.

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

↑