Naka-GS is a low‑light 3D Gaussian Splatting framework that jointly enhances observations and improves Gaussian initialization. It introduces Naka‑Guided Chroma Correction, which uses a fixed bionic response as a photometric anchor to learn bounded, frequency‑decoupled luminance and chromatic corrections, preserving fine structures while reducing color and boundary artifacts. A lightweight, non‑learned Point‑Prior Compaction Module refines dense scene priors via voxel pooling and distance‑adaptive pruning, cutting the number of points from 1.00 M to 59.52 K and shortening optimization time by 37.7 % while achieving state‑of‑the‑art PSNR, SSIM, and LPIPS on eight RealX3D scenes.
arXiv:2603.20714v4 Announce Type: replace Abstract: 3D Gaussian Splatting (3DGS) has become the method of choice for photo-realistic novel view synthesis (NVS), due to its efficiency and compelling v...
arXiv:2609.12682v1 Announce Type: new Abstract: Reconstructing 3D scenes under real-world low-light conditions remains challenging due to severe sensor noise, low signal-to-noise ratios, and degraded...
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...
arXiv:2609.22941v1 Announce Type: new Abstract: Novel view synthesis from sparse inputs remains challenging for 3D Gaussian Splatting (3DGS) due to ambiguous geometry, cross-view inconsistency, and m...
Efficient Confidence-Aware Densification for 3DGS proposes a new densification strategy for 3D Gaussian Splatting that replaces opacity-based sampling with error-driven placement of primitives. The method keeps a fixed primitive budget and places new primitives where image error and low learned confidence are highest, relocating under-contributing primitives accordingly. Across 24 scenes, it outperforms existing fixed-budget methods—including 3DGS-MCMC, ConeGS, and EDGS—in PSNR, SSIM, and LPIPS at budgets from 100k to 2M primitives, and can also leverage prior-based initialization to match or exceed prior methods.
arXiv:2610.00749v1 Announce Type: new Abstract: Standard 3D Gaussian Splatting (3DGS) learns geometry and appearance jointly from RGB supervision, making it difficult to isolate how luminance and chr...
arXiv:2609.36969v1 Announce Type: new Abstract: 3D Gaussian Splatting (3DGS) is a state-of-the-art technique for 3D scene rendering, offering high efficiency and excellent visual quality. However, be...
arXiv:2609.01516v1 Announce Type: new Abstract: While 3D Gaussian Splatting (3DGS) has revolutionized 3D reconstruction and novel-view synthesis, scenarios with limited input views often lead to poor...
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...
arXiv:2610.09853v1 Announce Type: new Abstract: Pose-free feed-forward 3D Gaussian Splatting (3DGS) reconstructs a scene from sparse, unposed images in a single network pass, removing the need for ca...
GeoGSplat introduces a geometry‑grounded, feed‑forward Gaussian splatting framework that avoids the pixel‑aligned prediction bottleneck by using a fixed number of Gaussians. A dual‑branch encoder builds coarse 3D anchors and fine triplane features, while a hierarchical decoder progressively generates dense 3D points and Gaussian primitives for reconstruction and novel view synthesis. The method outperforms state‑of‑the‑art pixel‑aligned and non‑pixel‑aligned splatting techniques on DTU and NRGBD datasets, especially when rendering views far from the input cameras.
ACD-GS introduces an Asymmetric Curvature-aware Densification framework for 3D Gaussian Splatting that uses second-order depth responses to guide cloning and splitting, thereby better capturing geometric discontinuities. It incorporates a multi-view photometric consistency constraint and a capacity-aware adaptive regulation strategy to balance densification and pruning during training. The approach reduces Gaussian count and storage by nearly 60% while maintaining competitive rendering fidelity, outperforming existing methods across multiple datasets.