Laplacian Frequency Hierarchies for Efficient 3D Gaussian Splatting Training
- URL: http://arxiv.org/abs/2609.03334v1
- Date: Thu, 03 Sep 2026 03:46:49 GMT
- Title: Laplacian Frequency Hierarchies for Efficient 3D Gaussian Splatting Training
- Abstract summary: A key bottleneck in 3D Gaussian Splatting training is the continual growth of Gaussian primitives.<n>We propose Laplacian Frequency Hierarchies, a simple yet efficient 3DGS scheme that combines Laplacian image decomposition with coarse-to-fine, frequency-staged training.<n>It achieves average speedups of 1.73x and 1.21x at 1K setting, and 1.74x and 1.33x at 4K setting on Taming-3DGS and FastGS.
- Score: 10.003234443699606
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- 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. We propose Laplacian Frequency Hierarchies, a simple yet efficient 3DGS scheme that combines Laplacian image decomposition with coarse-to-fine, frequency-staged training. After fitting lower-frequency structure, we archive the corresponding Gaussian field so that subsequent fields can optimize higher-frequency residuals without carrying the full primitive burden, and we compose the rendered components in the image domain via a Laplacian-style reconstruction at inference time. This design reduces the number of active Gaussians during training, thereby lowering optimization overhead and accelerating training. The proposed scheme is plug-and-play and orthogonal to prior 3DGS accelerations: it can be directly combined with strong backbones such as Taming-3DGS and FastGS to improve training speed with competitive reconstruction quality. It achieves average speedups of 1.73x and 1.21x at 1K setting, and 1.74x and 1.33x at 4K setting on Taming-3DGS and FastGS, with larger gains on more challenging scenes and increasingly pronounced benefits at higher resolutions.
Related papers
- ATSplat: Compact Feed-forward 3D Gaussian Splatting with Adaptive Token Expansion [60.00320387969695]
ATSplat is a feed-forward 3DGS framework that restores the adaptive allocation capability of 3DGS optimization.<n>From 12 input images at $512 times 960$ resolution, ATSplat completes reconstruction in less than a second using a single commercial GPU.
arXiv Detail & Related papers (2026-07-22T17:54:44Z) - TurboGS: Accelerating 3D Gaussian Splatting via Error-Guided Sparse Pixel Sampling and Optimization [54.179316928687435]
TurboGS is an error-guided training framework that accelerates 3DGS by concentrating optimization on perceptually informative pixels.<n>Experiments on standard benchmarks demonstrate that TurboGS can deliver on par or superior rendering quality within 100 seconds on a single 5090 GPU card.
arXiv Detail & Related papers (2026-06-14T16:59:48Z) - ImprovedGS+: A High-Performance C++/CUDA Re-Implementation Strategy for 3D Gaussian Splatting [0.0]
We propose ImprovedGS+, a high-performance, low-level reinvention of the ImprovedGS strategy.<n>By transitioning from high-level Python logic to hardware-optimized C++/CUDA kernels, we achieve a significant reduction in host-device synchronization and training latency.
arXiv Detail & Related papers (2026-03-09T17:38:27Z) - Speedy Deformable 3D Gaussian Splatting: Fast Rendering and Compression of Dynamic Scenes [57.69608119350651]
Recent extensions of 3D Gaussian Splatting (3DGS) to dynamic scenes achieve high-quality novel view synthesis by using neural networks to predict the time-varying deformation of each Gaussian.<n>However, performing per-Gaussian neural inference at every frame poses a significant bottleneck, limiting rendering speed and increasing memory and compute requirements.<n>We present Speedy Deformable 3D Gaussian Splatting (SpeeDe3DGS), a general pipeline for accelerating the rendering speed of dynamic 3DGS and 4DGS representations by reducing neural inference through two complementary techniques.
arXiv Detail & Related papers (2025-06-09T16:30:48Z) - GSta: Efficient Training Scheme with Siestaed Gaussians for Monocular 3D Scene Reconstruction [4.865050337780373]
Gaussian Splatting (GS) is a popular approach for 3D reconstruction.<n>It suffers from large storage and memory requirements.<n>We propose GSta that identifies Gaussians that have converged well during training.
arXiv Detail & Related papers (2025-04-09T09:17:56Z) - DashGaussian: Optimizing 3D Gaussian Splatting in 200 Seconds [71.37326848614133]
We propose DashGaussian, a scheduling scheme over the optimization complexity of 3DGS.<n>We show that our method accelerates the optimization of various 3DGS backbones by 45.7% on average.
arXiv Detail & Related papers (2025-03-24T07:17:27Z) - Gaussian On-the-Fly Splatting: A Progressive Framework for Robust Near Real-Time 3DGS Optimization [8.422116335889163]
3D Gaussian Splatting (3DGS) achieves high-fidelity rendering with fast real-time performance.<n>Existing methods rely on offline training after full Structure-from-Motion (SfM) processing.<n>We introduce On-the-Fly GS, a progressive framework enabling near real-time 3DGS optimization during image capture.
arXiv Detail & Related papers (2025-03-17T11:47:58Z) - 3DGS-LM: Faster Gaussian-Splatting Optimization with Levenberg-Marquardt [65.25603275491544]
We present 3DGS-LM, a new method that accelerates the reconstruction of 3D Gaussian Splatting (3DGS)<n>Our method is 20% faster than the original 3DGS while obtaining the same reconstruction quality optimization.
arXiv Detail & Related papers (2024-09-19T16:31:44Z) - Taming 3DGS: High-Quality Radiance Fields with Limited Resources [50.92437599516609]
3D Gaussian Splatting (3DGS) has transformed novel-view synthesis with its fast, interpretable, and high-fidelity rendering.
We tackle the challenges of training and rendering 3DGS models on a budget.
We derive faster, numerically equivalent solutions for gradient computation and attribute updates.
arXiv Detail & Related papers (2024-06-21T20:44:23Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.