Papers
Topics
Authors
Recent
Search
2000 character limit reached

Sparse-View Gaussian Splatting

Updated 6 July 2026
  • Sparse-view Gaussian Splatting is a technique that adapts explicit Gaussian primitives to reconstruct 3D scenes from a minimal set of calibrated images.
  • It leverages advanced regularization using depth, normal, and feature consistency to address issues like floaters, incomplete geometry, and background collapse.
  • Benchmarks on datasets such as LLFF and DTU demonstrate improved metrics (PSNR, SSIM, Chamfer distance) in both novel-view synthesis and surface reconstruction tasks.

Searching arXiv for the supplied papers and closely related sparse-view Gaussian splatting work. Sparse-view Gaussian Splatting denotes the family of methods that adapt Gaussian Splatting to image collections with severely limited viewpoint coverage, typically where standard dense-view assumptions break down and reconstruction quality degrades through poor initialization, incomplete geometry, floaters, background collapse, holes, or unstable optimization. Across the recent literature, the common setting is that a scene is represented by explicit Gaussian primitives and optimized from as few as 2, 3, 4, 5, 6, 8, 12, or 24 input images, depending on the benchmark and task; the central technical problem is that sparse supervision is insufficient to reliably place, shape, and regularize these primitives without additional priors or training strategies (Xiong et al., 2023, Bao et al., 2024, Han et al., 2024, Sun et al., 27 May 2025, Hofer et al., 3 Feb 2026, Lazzaroni et al., 30 Jun 2026).

1. Foundations and problem formulation

Sparse-view Gaussian Splatting inherits the explicit scene parameterization of 3D Gaussian Splatting. In the standard 3D formulation, a scene is represented by anisotropic Gaussian primitives parameterized by a mean, covariance, opacity, and color; rendering proceeds by projecting Gaussians into screen space, sorting them by depth, and applying front-to-back alpha compositing. Representative formulations write a Gaussian density as

Gi(x)=exp ⁣(12(xμi)TΣi1(xμi)),G_i(x)=\exp\!\left(-\tfrac12(x-\mu_i)^T\Sigma_i^{-1}(x-\mu_i)\right),

with pixel color accumulated as

C=iciαij<i(1αj),C=\sum_i c_i\,\alpha_i\prod_{j<i}(1-\alpha_j),

or equivalent variants using transmittance terms and projected opacities (Xiang et al., 12 Jun 2025, Lu et al., 9 Jun 2025, Han et al., 2024, Xiong et al., 2023).

The sparse-view regime is defined less by a new renderer than by a change in the optimization regime. When only a few calibrated images are available, classical Structure from Motion often yields too few reliable points, geometric supervision becomes weak, and the Gaussian field can overfit the training views rather than recover consistent 3D structure. Multiple papers identify recurrent failure modes: floaters, background collapse, large holes, incomplete geometry in unobserved regions, and degraded novel-view quality (Xiong et al., 2023, Sun et al., 27 May 2025, Xiang et al., 12 Jun 2025). In surface-oriented variants, the difficulty is sharpened further because sparse supervision must support not only view synthesis but also depth consistency, normal fidelity, and watertight or TSDF-fusable geometry (Takama et al., 26 May 2025, Shen et al., 2024, Gu et al., 18 Nov 2025).

A second foundational distinction is between volumetric Gaussians and surface-oriented primitives. Some works retain 3D anisotropic Gaussians for novel-view synthesis and scene rendering (Sun et al., 27 May 2025, Xiang et al., 12 Jun 2025, Lazzaroni et al., 30 Jun 2026), whereas others use 2D Gaussian splatting, Gaussian surfels, or flattened Gaussians aligned to local tangent planes for surface reconstruction (Takama et al., 26 May 2025, Dai et al., 9 Apr 2026, Shen et al., 2024, Gu et al., 18 Nov 2025). This suggests that sparse-view Gaussian Splatting is not a single algorithmic template but a representation family whose specific geometry prior is chosen according to task.

2. Initialization as the dominant bottleneck

A large fraction of the literature treats initialization as the primary sparse-view bottleneck. The baseline failure mode is explicit: standard Gaussian Splatting commonly initializes primitive centers from sparse SfM point clouds, but with only 3–5 images such point clouds are often too sparse for stable optimization (Takama et al., 26 May 2025). SparseGS likewise identifies dependence on sparse COLMAP points as a limitation in extremely sparse settings (Xiong et al., 2023).

Recent methods replace or augment SfM with dense point or depth prediction from foundation models. Sparse2DGS uses DUSt3R together with COLMAP MVS to generate a highly accurate and dense 3D point cloud, then converts each point into a 2D Gaussian by fitting a local tangent plane, estimating local variances from neighbors, and initializing opacity and color from nearby observations (Takama et al., 26 May 2025). Intern-GS uses DUSt3R to produce a dense, globally aligned point cloud, followed by a redundancy-free sampling step that adds Gaussians only for pixels satisfying a mask derived from accumulated support and depth disagreement (Sun et al., 27 May 2025). PointGS uses VGGT to jointly estimate accurate camera poses and dense per-view point clouds, which are bundle-adjusted and fused into a single global cloud before subsequent learned appearance modeling (Xiang et al., 12 Jun 2025). Pi-GS replaces COLMAP/SfM with the reference-free point-cloud-and-pose network π3\pi^3, which predicts per-pixel depth, confidence, and camera extrinsics directly from the sparse image set (Hofer et al., 3 Feb 2026).

Other methods push initialization into feed-forward prediction. FSFSplatter uses a large Transformer to predict monocular depth maps, camera intrinsics and extrinsics, pixel-aligned features, and a dense Gaussian scene initialization via a self-splitting Gaussian head; it then prunes local floaters through contribution-based pruning before fast joint optimization (Zhao et al., 3 Oct 2025). SurfelSplat performs feed-forward prediction of pixel-aligned Gaussian surfels from sparse-view images and is explicitly designed to be generalizable rather than per-scene optimized (Dai et al., 9 Apr 2026). ProSplat adopts a feed-forward two-stage design in which a 3DGS generator first predicts Gaussian primitives and a second stage improves rendered views through a one-step diffusion model (Lu et al., 9 Jun 2025).

An alternative line densifies initialization during optimization rather than before it. LoopSparseGS introduces loop-based Progressive Gaussian Initialization: after optimizing Gaussians for one stage, it renders pseudo-views near the training cameras, reruns COLMAP on the union of real and pseudo images, and reinitializes Gaussians from the densified point set in an outer loop (Bao et al., 2024). SparseGS-W similarly relies on DUSt3R for dense initialization from very sparse outdoor images, including a second DUSt3R pass after masking user-specified occluders (Li et al., 25 Mar 2025).

These works collectively indicate that sparse-view Gaussian Splatting shifted rapidly from SfM-dependent initialization toward dense point-cloud, depth, and pose estimation from DUSt3R, VGGT, and π3\pi^3 (Takama et al., 26 May 2025, Sun et al., 27 May 2025, Xiang et al., 12 Jun 2025, Hofer et al., 3 Feb 2026). A plausible implication is that initialization quality increasingly determines whether later regularization acts as refinement or as damage control.

3. Regularization, priors, and optimization strategies

Once initialized, sparse-view methods introduce additional supervision to constrain geometry and appearance in under-observed regions. A recurrent design is to combine the standard photometric objective with depth, normal, feature, or pseudo-view losses.

Several methods formulate explicit depth and normal constraints. Sparse2DGS refines 2D Gaussian parameters under a total loss

L=Lc+αLd+βLn,L=L_c+\alpha L_d+\beta L_n,

with α=1000\alpha=1000 and β=0.05\beta=0.05, where LdL_d penalizes inconsistent depths among overlapping Gaussians on each ray and LnL_n aligns Gaussian normals with depth-map normals (Takama et al., 26 May 2025). Pi-GS introduces uncertainty-guided depth supervision via a confidence-weighted Pearson correlation, a masked normal consistency loss, and a depth-warping pseudo-view loss; its total objective combines these with PGSR losses and a planar scale penalty (Hofer et al., 3 Feb 2026). PointGS uses photometric reconstruction, monocular depth regularization, and an edge-aware depth-smoothness term, while learning appearance-aware Gaussian attributes through feature aggregation and self-attention (Xiang et al., 12 Jun 2025).

Pseudo-view supervision is another dominant strategy. Intern-GS creates pseudo-views by slight camera rotations and imposes both depth-correlation and color losses on these views, where pseudo-view appearance is refined using a diffusion model (Sun et al., 27 May 2025). SparseGS-W alternates Gaussian updates with a Constrained Novel-View Enhancement module that generates diffusion-enhanced pseudo ground truth for novel views, and an Occlusion Handling module that inpaints training views containing transient occluders (Li et al., 25 Mar 2025). SaveWildGS also uses a one-step diffusion model for reference-guided view refinement and pseudo-view synthesis, combined with an SDS regularizer and a sparsity-aware Gaussian replication strategy (Park et al., 30 Apr 2026). AugSplat approaches the same problem from the opposite direction: it first trains a radiance-field ensemble on the sparse real images, renders synthetic views from nearby poses, computes per-pixel confidence from ensemble variance, and then uses those synthetic views as auxiliary supervision for Gaussian optimization in either staged or dual schedules (Lazzaroni et al., 30 Jun 2026).

Several papers tackle overfitting or instability through structural regularization of the Gaussian field itself. PairDropGS samples two dropped Gaussian subsets from the same shared field, applies a Gaussian-blur low-pass filter, and minimizes a low-frequency consistency loss

Llfcpair=I~1sg(I~2)1,L_{lfc}^{pair}=\|\tilde I_1-\mathrm{sg}(\tilde I_2)\|_1,

with a progressive weight schedule C=iciαij<i(1αj),C=\sum_i c_i\,\alpha_i\prod_{j<i}(1-\alpha_j),0 and C=iciαij<i(1αj),C=\sum_i c_i\,\alpha_i\prod_{j<i}(1-\alpha_j),1 (Li et al., 12 May 2026). LoopSparseGS proposes Sparse-friendly Sampling, which identifies top-error pixels, locates the dominant contributing Gaussian, and splits oversized primitives into two children; it couples this with Depth-alignment Regularization that aligns rendered depth with sparse SfM depth and sliding-window Pearson correlation against monocular depth (Bao et al., 2024). Binocular-Guided 3D Gaussian Splatting dispenses with external priors and instead uses disparity-guided binocular stereo consistency between rendered and shifted views, together with multiplicative opacity decay C=iciαij<i(1αj),C=\sum_i c_i\,\alpha_i\prod_{j<i}(1-\alpha_j),2 using C=iciαij<i(1αj),C=\sum_i c_i\,\alpha_i\prod_{j<i}(1-\alpha_j),3 (Han et al., 2024).

Surface-reconstruction methods add more explicitly geometric penalties. Sparse2DGS: Geometry-Prioritized Gaussian Splatting for Surface Reconstruction from Sparse Views fixes appearance during a geometry stage, renders MVS features via splatting, and imposes cosine feature consistency as well as disk-sampling-based cross-view regularization over primitive position, orientation, and scale (Wu et al., 29 Apr 2025). SparseSurf augments flattened Gaussians with Stereo Geometry-Texture Alignment and Pseudo-Feature Enhanced Geometry Consistency, activating stereo priors from iteration 500 and pseudo-feature losses from iteration 3000 in a 7000-iteration schedule (Gu et al., 18 Nov 2025). SolidGS replaces the Gaussian kernel itself with a generalized-exponential “solid” kernel

C=iciαij<i(1αj),C=\sum_i c_i\,\alpha_i\prod_{j<i}(1-\alpha_j),4

and combines this with depth distortion, normal consistency, and monocular normal supervision (Shen et al., 2024).

The broader pattern is clear: sparse-view Gaussian Splatting is no longer trained solely by image reconstruction. It is trained by image reconstruction plus priors, with those priors variously drawn from monocular depth, stereo, diffusion, radiance fields, feature correspondence, dropout consistency, or kernel design (Sun et al., 27 May 2025, Lazzaroni et al., 30 Jun 2026, Li et al., 12 May 2026, Shen et al., 2024).

4. Representation variants and task-specific branches

The topic spans several distinct subdomains rather than a single benchmark culture. A compact taxonomy is useful.

Branch Representative methods Core emphasis
Sparse-view novel-view synthesis SparseGS, LoopSparseGS, Binocular-Guided 3DGS, PointGS, PairDropGS, CuriGS, AugSplat Real-time rendering, anti-overfitting regularization, pseudo-view or feature priors
Sparse-view surface reconstruction Sparse2DGS, SolidGS, SparseSurf, SurfelSplat, FSFSplatter Geometry accuracy, depth/normal consistency, TSDF or mesh extraction
In-the-wild or distractor-aware reconstruction SparseGS-W, SaveWildGS, Sparse View Distractor-Free Gaussian Splatting Occlusion handling, transient masking, reference-guided diffusion, semantic priors
Feed-forward or wide-baseline systems ProSplat, SurfelSplat, FSFSplatter Per-scene optimization reduction, wide-baseline robustness, fast inference
Domain-specific inverse problems GR-Gaussian Sparse-view CT reconstruction

Novel-view-synthesis papers usually evaluate PSNR, SSIM, and LPIPS under sparse splits. SparseGS addresses unbounded 360° scenes with depth priors, unseen-viewpoint regularization, and floater pruning (Xiong et al., 2023). LoopSparseGS uses outer-loop densification and depth alignment (Bao et al., 2024). PointGS introduces multiscale 2D appearance features and a point interaction network based on local self-attention (Xiang et al., 12 Jun 2025). CuriGS turns pseudo-view generation into a curriculum over perturbation magnitudes, promoting only the best-performing student views under a multi-signal metric (Wu et al., 20 Nov 2025). PairDropGS reinterprets dropout as a consistency-regularization problem (Li et al., 12 May 2026). AugSplat uses NeRF-generated synthetic views as auxiliary supervision while preserving Gaussian rasterization at inference (Lazzaroni et al., 30 Jun 2026).

Surface-reconstruction papers are typically stricter about geometry. Sparse2DGS demonstrates that dense DUSt3R plus COLMAP MVS initialization can support reconstruction from only three images (Takama et al., 26 May 2025). Sparse2DGS: Geometry-Prioritized Gaussian Splatting for Surface Reconstruction from Sparse Views stages optimization from geometry to appearance and uses feature splatting and disk regularization (Wu et al., 29 Apr 2025). SolidGS introduces a shared solidness factor for all Gaussians to consolidate geometry across views (Shen et al., 2024). SparseSurf argues that flattened Gaussians alone can exacerbate overfitting under sparse supervision and therefore adds stereo and pseudo-feature consistency (Gu et al., 18 Nov 2025). SurfelSplat reframes the problem as generalizable feed-forward Gaussian surfel prediction and explicitly analyzes Nyquist sampling constraints (Dai et al., 9 Apr 2026). FSFSplatter combines learned dense initialization, differentiable camera refinement, and geometry-enhanced optimization in a fast pipeline (Zhao et al., 3 Oct 2025).

The in-the-wild and distractor-aware branch extends sparse-view Gaussian Splatting beyond controlled datasets. SparseGS-W handles large-scale outdoor scenes from as few as five training images through constrained diffusion priors and user-provided reference images (Li et al., 25 Mar 2025). SaveWildGS adds Grounded-SAM-based transient masking, reference-guided diffusion refinement, pseudo-view synthesis, and sparsity-aware Gaussian replication (Park et al., 30 Apr 2026). Sparse View Distractor-Free Gaussian Splatting integrates VGGT geometry, attention-based semantic entity matching, VLM confirmation of large static regions, and a warm-up phase with non-learnable mask priors inside RobustGS (Gu et al., 2 Mar 2026).

A final branch adapts Gaussian splatting to sparse-view CT. GR-Gaussian models volumetric density as a sum of radiative Gaussians, introduces denoised point-cloud initialization from FDK, and uses a graph-aware gradient augmentation for splitting decisions (Yuluo et al., 4 Aug 2025). This broadens the topic from image-based scene synthesis to tomography and suggests that the same sparse-view difficulties recur whenever Gaussian primitives are optimized under limited projections.

The benchmark landscape is heterogeneous but consistent in its stress tests. LLFF, DTU, Mip-NeRF360, Tanks and Temples, BlendedMVS, PhotoTourism, NeRF-on-the-go, RealEstate10K, DL3DV-10K, Replica, and X-3D appear repeatedly, usually under 2-, 3-, 4-, 5-, 6-, 8-, 12-, or 24-view settings (Bao et al., 2024, Sun et al., 27 May 2025, Lu et al., 9 Jun 2025, Li et al., 25 Mar 2025, Gu et al., 18 Nov 2025, Zhao et al., 3 Oct 2025, Yuluo et al., 4 Aug 2025).

On forward-facing or object-centric three-view benchmarks, several papers report state-of-the-art or near-state-of-the-art performance with different inductive biases. Intern-GS reports, under 3-view training, LLFF C=iciαij<i(1αj),C=\sum_i c_i\,\alpha_i\prod_{j<i}(1-\alpha_j),5, DTU C=iciαij<i(1αj),C=\sum_i c_i\,\alpha_i\prod_{j<i}(1-\alpha_j),6, and Tanks and Temples C=iciαij<i(1αj),C=\sum_i c_i\,\alpha_i\prod_{j<i}(1-\alpha_j),7 in PSNR/SSIM/LPIPS (Sun et al., 27 May 2025). PointGS reports LLFF 3-view performance of C=iciαij<i(1αj),C=\sum_i c_i\,\alpha_i\prod_{j<i}(1-\alpha_j),8 dB, C=iciαij<i(1αj),C=\sum_i c_i\,\alpha_i\prod_{j<i}(1-\alpha_j),9, and π3\pi^30, with ablations showing degradation when removing the point interaction module, variance fusion, depth loss, or smoothness loss (Xiang et al., 12 Jun 2025). Binocular-Guided 3D Gaussian Splatting reports LLFF 3-view PSNR π3\pi^31, SSIM π3\pi^32, LPIPS π3\pi^33, and DTU 3-view PSNR π3\pi^34, SSIM π3\pi^35, LPIPS π3\pi^36 (Han et al., 2024). CuriGS reports averaged LLFF 3-view π3\pi^37 and DTU 3-view π3\pi^38, while its ablation without curriculum degrades substantially on representative scenes (Wu et al., 20 Nov 2025). PairDropGS reports LLFF 3-view improvement from DropGaussian’s PSNR π3\pi^39 to π3\pi^30, and also reduces PSNR standard deviation across 10 seeds from approximately π3\pi^31 dB to approximately π3\pi^32 dB (Li et al., 12 May 2026).

For 360° or unbounded sparse-view scenes, SparseGS reports on Mip-NeRF360 with 12 views PSNR π3\pi^33, SSIM π3\pi^34, LPIPS π3\pi^35, improving over base 3DGS while retaining 120+ FPS (Xiong et al., 2023). AugSplat reports average Mip-NeRF360 performance over nine scenes of SSIM π3\pi^36, PSNR π3\pi^37, LPIPS π3\pi^38, and Avg π3\pi^39 for Staged AugSplat, compared with standard GSplat at SSIM L=Lc+αLd+βLn,L=L_c+\alpha L_d+\beta L_n,0, PSNR L=Lc+αLd+βLn,L=L_c+\alpha L_d+\beta L_n,1, LPIPS L=Lc+αLd+βLn,L=L_c+\alpha L_d+\beta L_n,2, and Avg L=Lc+αLd+βLn,L=L_c+\alpha L_d+\beta L_n,3 (Lazzaroni et al., 30 Jun 2026). On Mip-NeRF360 with 24 views, PointGS reports L=Lc+αLd+βLn,L=L_c+\alpha L_d+\beta L_n,4 dB, L=Lc+αLd+βLn,L=L_c+\alpha L_d+\beta L_n,5, and L=Lc+αLd+βLn,L=L_c+\alpha L_d+\beta L_n,6 (Xiang et al., 12 Jun 2025).

Surface-reconstruction metrics commonly use Chamfer distance. Sparse2DGS reports mean Chamfer distance approximately L=Lc+αLd+βLn,L=L_c+\alpha L_d+\beta L_n,7 mm over 12 challenging DTU scenes using only 3 views, compared with approximately L=Lc+αLd+βLn,L=L_c+\alpha L_d+\beta L_n,8 mm for SparseNeuS, approximately L=Lc+αLd+βLn,L=L_c+\alpha L_d+\beta L_n,9 mm for ReTR, approximately α=1000\alpha=10000 mm for COLMAP MVS, and approximately α=1000\alpha=10001 mm for 2DGS with SfM initialization (Takama et al., 26 May 2025). Sparse2DGS: Geometry-Prioritized Gaussian Splatting for Surface Reconstruction from Sparse Views reports DTU mean Chamfer distance α=1000\alpha=10002 mm under 3 views, versus α=1000\alpha=10003 mm for 2DGS, α=1000\alpha=10004 mm for PGSR, and α=1000\alpha=10005 mm for SparseNeus, while taking approximately 10 minutes per scene (Wu et al., 29 Apr 2025). SolidGS reports DTU 3-view mean Chamfer distance α=1000\alpha=10006 with PSNR α=1000\alpha=10007 in α=1000\alpha=10008 min, compared with α=1000\alpha=10009 for PGSR, β=0.05\beta=0.050 for 2DGS, and β=0.05\beta=0.051 for MVPGS (Shen et al., 2024). SparseSurf reports DTU 3-view Chamfer distance β=0.05\beta=0.052 mm under little overlap and β=0.05\beta=0.053 mm under large overlap, along with DTU sparse NVS metrics PSNR β=0.05\beta=0.054, SSIM β=0.05\beta=0.055, LPIPS β=0.05\beta=0.056, and AVGE β=0.05\beta=0.057 (Gu et al., 18 Nov 2025). SurfelSplat reports mean DTU 2-view Chamfer-D2S β=0.05\beta=0.058 mm with 1-second inference, compared with β=0.05\beta=0.059 for FatesGS and much longer runtimes for several optimization-based baselines (Dai et al., 9 Apr 2026). FSFSplatter reports DTU surface CD LdL_d0 mm after 1000 iterations and Replica surface CD LdL_d1 cm, with LPIPS LdL_d2 on DTU and LdL_d3 on Replica after full optimization (Zhao et al., 3 Oct 2025).

In-the-wild benchmarks emphasize perceptual and no-reference metrics. SparseGS-W reports on PhotoTourism with five input views PSNR LdL_d4, SSIM LdL_d5, LPIPS LdL_d6, FID LdL_d7, ClipIQA LdL_d8, and MUSIQ LdL_d9, and on Tanks and Temples with three input views PSNR LnL_n0, SSIM LnL_n1, LPIPS LnL_n2, FID LnL_n3, ClipIQA LnL_n4, and MUSIQ LnL_n5 (Li et al., 25 Mar 2025). SaveWildGS reports relative gains averaged over splits of LnL_n6 PSNR, LnL_n7 SSIM, and LnL_n8 LPIPS on NeRF-on-the-go, and states that it outperforms GS-W, WildGaussians, and Difix3D+ by 3–4 dB in sparse-view settings (Park et al., 30 Apr 2026).

These results do not isolate a single universally dominant method. Instead, they show benchmark-dependent specialization: diffusion- and reference-guided methods excel in unconstrained scenes (Li et al., 25 Mar 2025, Park et al., 30 Apr 2026); geometry-prioritized and surfel-based methods excel in surface reconstruction (Wu et al., 29 Apr 2025, Dai et al., 9 Apr 2026, Gu et al., 18 Nov 2025); and dropout, curriculum, or augmentation methods stabilize general sparse-view NVS (Li et al., 12 May 2026, Wu et al., 20 Nov 2025, Lazzaroni et al., 30 Jun 2026).

6. Limitations, misconceptions, and open directions

A common misconception is that sparse-view Gaussian Splatting is simply “3DGS with fewer images.” The literature indicates otherwise. Sparse-view performance depends on changing the initialization, the supervision, the regularization schedule, or even the primitive itself; several papers explicitly show that vanilla 3DGS degrades sharply under sparse inputs (Xiong et al., 2023, Takama et al., 26 May 2025, Xiang et al., 12 Jun 2025). Another misconception is that sparse-view improvements come only from stronger appearance priors. In fact, many of the strongest gains in reconstruction accuracy are attributed to dense geometry initialization, depth correlation, normal consistency, feature correspondence, or kernel redesign rather than purely photometric enhancement (Wu et al., 29 Apr 2025, Shen et al., 2024, Hofer et al., 3 Feb 2026).

The literature also converges on several limitations. Extrapolation beyond the convex hull of training views remains weak in diffusion-guided systems; Intern-GS states that diffusion cannot hallucinate far-out regions reliably (Sun et al., 27 May 2025). Depth priors remain vulnerable to scale ambiguity and monocular noise (Sun et al., 27 May 2025, Hofer et al., 3 Feb 2026). MVS- or foundation-model-based initialization can propagate errors under heavy occlusion, specularity, or textureless regions (Wu et al., 29 Apr 2025). Dropout and pseudo-view methods improve stability, but still degrade under extreme sparsity such as two views in some settings (Xiang et al., 12 Jun 2025). Feed-forward methods trade per-scene optimization for learned inductive bias and may require strong pretraining or architecture-specific assumptions (Lu et al., 9 Jun 2025, Dai et al., 9 Apr 2026, Zhao et al., 3 Oct 2025). In distractor-aware pipelines, semantic matching and mask priors reduce dependence on color residuals, but introduce additional foundation-model and VLM dependencies (Gu et al., 2 Mar 2026, Park et al., 30 Apr 2026).

Several open directions recur explicitly across papers. These include scene extrapolation with stronger geometric constraints (Sun et al., 27 May 2025); dynamic-scene or video extensions (Sun et al., 27 May 2025, Yuluo et al., 4 Aug 2025); learned Gaussian placement and redundancy reduction (Sun et al., 27 May 2025); joint optimization of camera poses and Gaussians under sparse supervision (Xiong et al., 2023, Zhao et al., 3 Oct 2025); stronger integration of radiance-field or diffusion priors with explicit geometry (Lazzaroni et al., 30 Jun 2026, Lu et al., 9 Jun 2025); adaptive or learned graph structures for inverse problems (Yuluo et al., 4 Aug 2025); and faster, generalizable surface reconstruction without per-scene optimization (Dai et al., 9 Apr 2026).

Taken together, the field suggests a broader shift in the role of Gaussian Splatting under sparse supervision. Rather than serving as a standalone explicit renderer, it is increasingly used as the optimization core inside hybrid systems that import priors from stereo foundation models, monocular depth estimators, diffusion models, radiance fields, semantic matchers, or curriculum-based data augmentation (Sun et al., 27 May 2025, Li et al., 25 Mar 2025, Lazzaroni et al., 30 Jun 2026, Wu et al., 20 Nov 2025). A plausible implication is that future sparse-view Gaussian Splatting research will be defined less by the rasterizer itself than by how effectively explicit Gaussian primitives can absorb and reconcile heterogeneous priors while preserving the speed advantages that originally motivated Gaussian Splatting.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (20)

Topic to Video (Beta)

No one has generated a video about this topic yet.

Whiteboard

No one has generated a whiteboard explanation for this topic yet.

Follow Topic

Get notified by email when new papers are published related to Sparse-View Gaussian Splatting.