Aug 2026· 2026 12th International Conference on Big Data and Information Analytics (BigDIA)· pp. 358-365· 0 citations· 20 references
Abstract
3D Gaussian Splatting (3DGS) enables high-quality real-time novel view synthesis, but high-fidelity models usually contain a large number of Gaussian primitives, leading to substantial storage and rendering overhead. Existing compression methods mainly rely on pruning, where each Gaussian is discretely retained or removed, which may discard useful representation capacity and cause reconstruction degradation under aggressive compression. In this paper, we propose DIGU, a NAS-inspired Gaussian Distribution Search framework for compact 3DGS representation. Instead of directly pruning Gaussians, DIGU learns a compact Gaussian distribution through differentiable assignment optimization. Specifically, we introduce feature-aware grouping to decompose the global search into local subproblems, and importance-aware budget allocation to adaptively assign output Gaussian numbers to different groups. A learnable assignment matrix is then optimized under rendering supervision to generate compact Gaussian primitives. Experiments on representative 3DGS scenes demonstrate that DIGU achieves competitive rendering quality under high compression ratios and provides an effective alternative to pruning-based 3DGS compression.
3D Gaussian Splatting (3DGS) enables high-quality novel view synthesis but incurs high storage and transmission costs due to dense Gaussian primitives. Recent anchor-based compression reduces per-primitive redundancy, yet redundancy across anchors remains largely unexploited. We propose CRP-GS (Cross-Representation Pri...
Ye-Zheng Zhang, Huan-Xiong Liang, Chu-Qin Zhou et al.· IEEE Transactions on Image P...· 0 citations
Gaussian Splatting has enabled real-time novel view synthesis, but its tightly coupled geometry and appearance representation often require a large number of primitives to reproduce high-frequency texture details, leading to substantial memory and optimization costs. Recent textured 2D Gaussian methods alleviate this l...
Zhi-Wei Li, Yi-Jia Guo, Yi-Shi Lu et al.· 0 citations
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. We propose Laplacian Frequency Hierarchies, a simple yet efficient 3DGS scheme that combines Laplacian image decomposition with coar...
Yixiong Yang, Sirius Z. Zhang, Q. Yan et al.· 0 citations
This paper proposes CVT-GS, a novel optimization-free post-hoc simplification framework that directly compresses trained 3DGS scenes without sacrificing visual fidelity and outputs a standard 3DGS scene that is seamlessly compatible with existing renderers.
Bing-Xian Li, Yi-Long Li, Jing-Liang Peng et al.· 0 citations
The proposed framework provides a simple and effective path toward fast and inherently compact 3DGS training, and leverages a synergistic design: an L2 reconstruction loss to provide error-proportional gradients that stabilize optimization, and a novel Polarized Opacity Prior to actively manage the Gaussian population.
Zi-Ming Wang, Kai-Wen Duan, Ko-Wei Huang et al.· 0 citations
Scene reconstruction with 3D Gaussian Splatting (3DGS) has become common, however deployment remains painful as the uncompressed file sizes can be massive. Current 3DGS compression systems combine multiple strategies for file size reduction, which can obscure where gains come from and limit component reuse across train...
W. Morgenstern, Friedrich Elias Branschke, F. Fleischmann et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.