arXiv:2609.23380v1 Announce Type: new Abstract: Gaussian Splatting has enabled real-time novel view synthesis, but its tightly coupled geometry and appearance representation often require a large num...
arXiv:2608.22344v1 Announce Type: new Abstract: 3D Gaussian Splatting (3DGS) achieves state-of-the-art rendering quality at real-time speeds but suffers from "model bloat" - a large number of redunda...
The paper introduces Iterative Gaussian Synopsis, a top‑down unfolding framework that generates compact, progressive levels of detail for 3D Gaussian Splatting (3DGS). Starting from a full‑resolution 3DGS model, it iteratively prunes Gaussian primitives using a learnable mask, building a multi‑level hierarchy that preserves visual quality while reducing storage. The method combines hierarchical spatial grids with a shared Anchor Codebook to capture global structure and local details, enabling efficient, level‑specific rendering with minimal data overhead.
arXiv:2610.20590v1 Announce Type: new Abstract: Feed-forward 3D Gaussian Splatting (3DGS) methods enable efficient reconstruction of 3D scenes from sparse multi-view images in a single forward pass,...
ReSplat introduces a recurrent Gaussian splatting model that iteratively refines 3D Gaussians using the rendering error as a feedback signal, avoiding explicit gradient computation. The method starts from a compact reconstruction in a subsampled space, producing far fewer Gaussians than prior per‑pixel models, which reduces computational cost. Experiments on multiple datasets, view counts, and resolutions show state‑of‑the‑art performance with faster rendering speeds.
KISS-GS is a modular compression pipeline for 3D Gaussian Splatting (3DGS) scenes that separates compression from training. It first compacts a vanilla 3DGS scene by 15.7× using state‑of‑the‑art pruning, then encodes the result into the SOG‑XT image‑based format, achieving an additional 6.6× reduction. Optional encoding‑aware fine‑tuning can further cut the size by 2.2×, yielding total reductions of 85× to 319× on standard benchmarks while enabling web‑native decoding.
arXiv:2607.20813v2 Announce Type: replace Abstract: Pixel-aligned Gaussian splatting enables efficient and generalizable novel-view synthesis. However, high-resolution rendering faces a critical trad...
The paper introduces TruncGradGS, a piecewise truncated gradient approach that mitigates gradient vanishing in 3D Gaussian Splatting, enhancing optimization stability and robustness to initializations. It demonstrates consistent improvements over random and COLMAP initializations in both static and dynamic settings. Additionally, the authors highlight limitations of existing dynamic scene benchmarks and present a new synthetic dataset for evaluating dynamic Gaussian Splatting.
arXiv:2609.38488v1 Announce Type: cross Abstract: Conventional 3D Gaussian Splatting (3DGS) requires depth sorting and ordered alpha blending to correctly render overlapping Gaussian primitives. Stoc...
Recent advances in 3D Gaussian Splatting have demonstrated unprecedented success in novel view synthesis. However, the substantial inference and storage overhead driven by high-order Spherical Harmonics (SH) are primary bottlenecks for mobile platforms.
The paper introduces a structure‑aware merging pipeline that consolidates per‑pixel 3D Gaussian primitives from any feed‑forward reconstruction method into a compact, content‑adaptive Gaussian set. By grouping spatially coherent Gaussians with adaptive superpixel segmentation guided by a saliency map, compressing clusters via a learned encoder, and merging representations across views using geometric overlap and feature similarity, the method reduces the number of Gaussians to about one‑twentieth of the original while preserving visual quality. A level‑of‑detail decoder allows controllable resolution, and the pipeline operates as a backbone‑agnostic post‑processing module, improving robustness and rendering efficiency.
arXiv:2609. 03334v1 Announce Type: new Abstract: A key bottleneck in 3D Gaussian Splatting training is the continual growth of Gaussian primitives, which increases optimization cost and slows convergence, especially at high resolutions.