View-Structured Conformal Prediction for 3D Gaussian Splatting
Read the original on Hugging Face Trending Papers →The Flow has not summarised this story yet — read it at Hugging Face Trending Papers.
The Flow has not summarised this story yet — read it at Hugging Face Trending Papers.
arXiv:2609.10307v1 Announce Type: cross Abstract: 3D Gaussian Splatting (3DGS) renders novel views in real time, but an uncertainty heatmap does not certify that a rendered view meets a certain predi...
arXiv:2607. 05522v1 Announce Type: cross Abstract: 3D Gaussian splatting (3DGS) is a strong representation for real-time novel-view synthesis, but its standard training pipeline relies on point estimates and hand-tuned heuristics, providing no native uncertainty or principled complexity control.
Gauss What You Need: Compact Gaussian Splatting Across Scene Scales introduces TangoGS, a method that automatically selects the number of Gaussian primitives for 3D Gaussian Splatting by combining capture-derived model sizing with training-based adaptation. The approach first estimates a learning allowance based on the capture’s total pixels, then adjusts the number of Gaussians during training according to reconstruction quality. On standard benchmarks, TangoGS matches the best baseline’s PSNR while using 48% fewer Gaussians, and on larger captures it scales automatically to achieve the highest mean PSNR with 2.3× more Gaussians.
arXiv:2609.23436v1 Announce Type: new Abstract: Novel view synthesis from sparse observations is severely under-constrained. Although 3D Gaussian Splatting (3DGS) enables real-time rendering, it prod...
arXiv:2609. 30393v1 Announce Type: new Abstract: Selecting informative camera views is critical for efficient training and adaptive refinement in 3D Gaussian Splatting, where each observation significantly influences model parameters.
F4Splat introduces a feed‑forward predictive densification strategy for 3D Gaussian splatting that allocates Gaussians based on a densification‑score guided by spatial complexity and multi‑view overlap. The method predicts per‑region scores to estimate required Gaussian density, enabling explicit control over the total Gaussian budget without retraining. This adaptive allocation reduces redundancy in simple regions and minimizes duplicate Gaussians across overlapping views, yielding compact yet high‑quality 3D representations and superior novel‑view synthesis performance with fewer Gaussians.