用排序透明度场加速大场景表面重建,精度与速度双提升。
SOF: Sorted Opacity Fields for Fast Unbounded Surface Reconstruction
- 引入分层重排序和鲁棒深度公式,更准提取表面
- 重建精度更高,总处理时间缩短3倍以上
- 适合需要快速高质网格生成的大型场景应用
近期基于3D高斯的表示方法显著提升了图像驱动场景重建的质量与效率。其显式结构支持实时渲染与快速优化,但在大规模无界环境中精确提取表面仍具挑战。现有方法依赖近似深度估计与全局排序启发式,易引入伪影并限制网格保真度。本文提出排序透明度场(SOF),从3D高斯中高效高精度恢复细节表面。通过引入分层重排序与更契合水平集的高斯深度定义,改进了表面提取。为提升网格质量,采用基于透明度场的水平集正则项,并设计几何一致性的损失函数。此外,开发适配透明度场的并行化四面体漫步算法,使网格生成时间降低一个数量级。定量评估显示,SOF在保持更高重建精度的同时,总处理时间减少逾三倍。该工作推动了高效高斯渲染向等效高效几何提取的迈进。
原文摘要 · Abstract (English)
Recent advances in 3D Gaussian representations have significantly improved the quality and efficiency of image-based scene reconstruction. Their explicit nature facilitates real-time rendering and fast optimization, yet extracting accurate surfaces - particularly in large-scale, unbounded environments - remains a difficult task. Many existing methods rely on approximate depth estimates and global sorting heuristics, which can introduce artifacts and limit the fidelity of the reconstructed mesh. In this paper, we present Sorted Opacity Fields (SOF), a method designed to recover detailed surfaces from 3D Gaussians with both speed and precision. Our approach improves upon prior work by introducing hierarchical resorting and a robust formulation of Gaussian depth, which better aligns with the level-set. To enhance mesh quality, we incorporate a level-set regularizer operating on the opacity field and introduce losses that encourage geometrically-consistent primitive shapes. In addition, we develop a parallelized Marching Tetrahedra algorithm tailored to our opacity formulation, reducing meshing time by up to an order of magnitude. As demonstrated by our quantitative evaluation, SOF achieves higher reconstruction accuracy while cutting total processing time by more than a factor of three. These results mark a step forward in turning efficient Gaussian-based rendering into equally efficient geometry extraction.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。