POp-GS: Next Best View in 3D-Gaussian Splatting with P-Optimality
Joey Wilson, Marcelino Almeida, Sachit Mahajan, Martin Labrie, Maani Ghaffari, Omid Ghasemalizadeh, Min Sun, Cheng-Hao Kuo, Arnab Sen
TL;DR
The paper tackles uncertainty quantification for 3D-Gaussian Splatting (3D-GS) by recasting information gain as a problem in optimal experimental design using P-Optimality. It derives a general covariance-based framework, then introduces scalable diagonal and block-diagonal Hessian approximations to enable practical Next-Best-View (NbV) selection, including single and batch view strategies. Across real and synthetic datasets, especially Mip-NeRF360 and Blender, D-Optimality and T-Optimality consistently outperform FisherRF and uniform baselines, with block-diagonal covariance offering additional gains in rendering fidelity (PSNR/SSIM/LPIPS) and better alignment with oracle guidance. The approach supports improved active perception and SLAM-like tasks with 3D-GS by providing principled view selection and a trade-off between computational cost and information fidelity. Overall, the work advances robust uncertainty-aware 3D-GS mapping and view planning with practical implications for robotics and immersive scene understanding.
Abstract
In this paper, we present a novel algorithm for quantifying uncertainty and information gained within 3D Gaussian Splatting (3D-GS) through P-Optimality. While 3D-GS has proven to be a useful world model with high-quality rasterizations, it does not natively quantify uncertainty or information, posing a challenge for real-world applications such as 3D-GS SLAM. We propose to quantify information gain in 3D-GS by reformulating the problem through the lens of optimal experimental design, which is a classical solution widely used in literature. By restructuring information quantification of 3D-GS through optimal experimental design, we arrive at multiple solutions, of which T-Optimality and D-Optimality perform the best quantitatively and qualitatively as measured on two popular datasets. Additionally, we propose a block diagonal covariance approximation which provides a measure of correlation at the expense of a greater computation cost.
