SplatQ introduces a combinatorial pruning algorithm for 3D Gaussian Splatting that coordinates regional budget allocation and joint Gaussian selection under a fixed budget. The method partitions Gaussians into spatially and appearance‑similar blocks, smooths block retention quotas to avoid budget concentration, and builds a quadratic approximation of joint deletion effects using pixel color responses. Solving the resulting QUBO with simulated annealing or a coherent Ising machine, SplatQ achieves superior reconstruction quality, spatial balance, and rendering speed across five benchmarks compared to existing pruning techniques.
2D Gaussian Splatting is an attractive direction for image representation due to its explicit formulation, fast rasterization, and favorable decoding efficiency. The representation quality of this paradigm depends on the proper allocation of Gaussian capacity to the demanding regions.
arXiv:2607. 02721v1 Announce Type: cross Abstract: 3D Gaussian Splatting (3DGS) enables high-quality real-time novel-view synthesis, but practical scenes often contain millions of Gaussians, making compression essential for deployment on limited hardware.
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.
Budgeted-GS is a post‑hoc technique that transforms any trained 3D Gaussian Splatting model into a factoring tree—a multi‑resolution hierarchy of moment‑matched aggregates. After a brief construction pass, a single quality parameter selects the appropriate level of detail for each view, allowing the same city‑scale model to run in real time on GPUs with varying memory capacities. The method also informs budget‑centered training, enabling models to be built directly at the necessary size and avoiding wasted optimization of later discarded primitives.
Constrained Dynamic Gaussian Splatting (CDGS) addresses the memory challenges of Dynamic Gaussian Splatting by framing reconstruction as a budget‑constrained optimization problem. It introduces a differentiable budget controller that fuses geometric, motion, and perceptual cues to enforce a strict, user‑defined Gaussian budget during training. CDGS further splits the representation into static and dynamic branches, allocates capacity based on motion complexity, and employs a three‑phase training strategy and hybrid compression to achieve high‑quality rendering with over 3× model compression compared to Ex4DGS.
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.
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.39553v1 Announce Type: new Abstract: 3D Gaussian Splatting (3DGS) enables real-time novel view synthesis, but existing general-purpose acceleration methods suffer severe rendering quality...
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:2603. 21933v2 Announce Type: replace-cross Abstract: The pruning of 3D Gaussian splats is essential for reducing their complexity to enable efficient storage, transmission, and downstream processing.
arXiv:2604.18980v2 Announce Type: replace Abstract: Reducing the number of Gaussian-tile pairs is one of the most promising approaches to improve 3D Gaussian Splatting (3D-GS) rendering speed on GPUs...
The paper introduces QuADA-GS, a method for Arbitrary-Scale Super-Resolution that dynamically densifies 2D Gaussian splatting based on low‑resolution input. By allocating Gaussians adaptively to structurally complex regions and employing a sparse communication mechanism, it balances high visual fidelity with lower computational cost. Experiments show that this approach achieves a competitive trade‑off between quality and efficiency for super‑resolution tasks.