用3D高斯显式表示体积数据,压缩率更高且无需存储网格。
Efficient Compression of Structured and Unstructured Volumes via Learned 3D Gaussian Representation

- 将3D高斯作为标量场的显式表示,通过加权聚合重建空间值
- 在非结构化数据上压缩效果显著优于现有隐式神经表示
- 支持高效采样与自适应密度优化,适合实时渲染与大体积数据
近期研究显示,隐式神经表示(INRs)可有效压缩结构化与非结构化体积数据,实现低内存下的直接查询。然而,现有针对非结构化体积的INRs不包含几何信息,需额外存储部分网格以供采样,限制了压缩潜力。与此同时,新视图合成方法表明,显式的3D高斯集合可精确可视化体积数据。本文提出一种基于3D高斯基元的体积数据压缩显式模型。我们将3D高斯集合重理解为标量场的显式表示,采用加权聚合策略,通过相交高斯的贡献重建空间位置的标量值。我们开发了针对结构化与非结构化模型采样的优化CUDA加速管道,设计了促进域编码准确性的损失函数,并引入基于采样误差的新型稠密化策略。该显式形式天然编码几何结构,消除非结构化体积中对网格存储的需求,带来显著更高的压缩机会。相比现有INRs,本模型在结构化体积上实现了相当的重建质量与显著更快的训练速度,在非结构化体积上则在所有指标上均显著超越现有方法。
原文摘要 · Abstract (English)
Recent work has shown that implicit neural representations (INRs) can be trained to effectively compress structured and unstructured volume data, allowing for direct data querying with a reduced memory footprint. However, as existing INRs for unstructured volumes do not encode geometry, they require partial mesh storage for later sampling, limiting achievable compression. At the same time, novel view synthesis methods have shown that explicit collections of 3D Gaussians can be used to accurately visualize volume data. In this work, we introduce an explicit model for volume data compression based on 3D Gaussian primitives. We reinterpret collections of 3D Gaussians as an explicit representation of a scalar field and use a sampling strategy that reconstructs scalar values at spatial locations through weighted aggregation of intersecting Gaussians. We develop optimized CUDA-accelerated pipelines for structured and unstructured model sampling, loss functions that encourage accurate domain encoding by our models, and a novel sampling-error based densification strategy. Our explicit formulation naturally encodes domain geometry, eliminating the need for mesh storage in unstructured volumes and introducing significantly higher compression opportunities. Compared to existing INRs, we demonstrate that our explicit model achieves competitive reconstruction quality with significant training speedups on structured volumes, while markedly outperforming in all metrics on unstructured volumes.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。