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.
By Hongbin Ye, Haixu Liu, Shenwei Kang, Wenxiu Wei, Tinglan Wang, Hongdong Zhu, Fan Tang, Qi Gao, Yin Ma, Kai Wen, Hai Wei, Nuo Qian, Wei-Shi Zheng, Shaobo Chen, Fa-Ting Hong, Jingke Meng
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.
By Giulio Federico, Giuseppe Amato, Claudio Gennaro, Fabio Carrara, Marco Di Benedetto
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.
By Zihan Zheng, Zhenlong Wu, Xuanxuan Wang, Houqiang Zhong, Xiaoyun Zhang, Qiang Hu, Guangtao Zhai, Wenjun Zhang
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.
By Afif Boudaoud, Jiayi Liu, Alexandru Calotoiu, Torsten Hoefler
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.
By Injae Kim, Chaehyeon Kim, Minseong Bae, Minseok Joo, Hyunwoo J. Kim
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.
By Tim-Felix Fassch, Jochen Kall, Cyrill Stachniss