cs.CVOct 19, 2026

Do We Need Learned Targets? Classical Gradients as Supervision for 2D Gaussian Initialization

Authors: Kyungjune Baek

Organizations: Sejong University, Seoul, Republic of Korea

Abstract

Learning-based Gaussian image initializers can require costly supervision obtained by per-image optimization. We investigate whether the Pseudo-PPM targets used by Instant GaussianImage can be replaced by classical image gradients. Our framework uses normalized Sobel maps in two tracks. A training-free analytic initializer combines probability boosting, parallel grid-based sampling, and geometric processing, producing initial parameters in 0.32 seconds on average. A neural initializer is trained on DIV2K with online Sobel supervision, which removes offline target optimization and allows training to scale to 10,000 LSDIR images without additional preprocessing. Both tracks achieve competitive long-budget reconstruction on Kodak and DIV2K. Under domain shift, the DIV2K-trained neural initializer surpasses Instant-GI on Manga109 from 500 fitting iterations onward (by 1.40 dB at 5K iterations), and training on LSDIR increases this margin to 1.85 dB. On Kvasir-SEG, the training-free analytic initializer exceeds Instant-GI at every reported budget. A controlled pipeline-time comparison yields an estimated 4.9×4.9\times reduction for DIV2K. These results establish inexpensive analytic targets as a practical alternative to optimization-derived supervision for scalable Gaussian initialization.

Figures & tables

Explore similar work

May 20, 2026

AIR: Amortized Image Reconstruction Framework for Self-Supervised Feed-Forward 2D Gaussian Splatting

2D Gaussian splatting provides an efficient explicit representation for image reconstruction, but existing methods still require costly per-image iterative optimization or rely on handcrafted priors for primitive allocation. We present AIR, a self-supervised feed-forward framework that amortizes iterative Gaussian fitting into a single network pass, eliminating per-image test-time optimization. AIR adopts a stage-wise residual architecture that progressively predicts additional Gaussian primitives from reconstruction residuals, together with an explicit Stage Control mechanism that activates new primitives only in under-reconstructed regions. A Predict--Optimize--Distill training strategy stabilizes multi-stage prediction by distilling short-horizon optimized Gaussian increments back into the predictor. The stabilized predictor is then jointly finetuned across stages and equipped with an image-adaptive quantizer for compact Gaussian storage. Experiments on Kodak and DIV2K show that AIR achieves better reconstruction quality than representative Gaussian-based baselines while reducing encoding time to 160--300,ms. Code: https://github.com/whoiszzj/AIR.git
Mar 8, 2026

SGI: Structured 2D Gaussians for Efficient and Compact Large Image Representation

2D Gaussian Splatting has emerged as a novel image representation technique that can support efficient rendering on low-end devices. However, scaling to high-resolution images requires optimizing and storing millions of unstructured Gaussian primitives independently, leading to slow convergence and redundant parameters. To address this, we propose Structured Gaussian Image (SGI), a compact and efficient framework for representing high-resolution images. SGI decomposes a complex image into multi-scale local spaces defined by a set of seeds. Each seed corresponds to a spatially coherent region and, together with lightweight multi-layer perceptrons (MLPs), generates structured implicit 2D neural Gaussians. This seed-based formulation imposes structural regularity on otherwise unstructured Gaussian primitives, which facilitates entropy-based compression at the seed level to reduce the total storage. However, optimizing seed parameters directly on high-resolution images is a challenging and non-trivial task. Therefore, we designed a multi-scale fitting strategy that refines the seed representation in a coarse-to-fine manner, substantially accelerating convergence. Quantitative and qualitative evaluations demonstrate that SGI achieves up to 7.5x compression over prior non-quantized 2D Gaussian methods and 1.6x over quantized ones, while also delivering 1.6x and 6.5x faster optimization, respectively, without degrading, and often improving, image fidelity. Code is available at https://github.com/zx-pan/SGI.
Mar 21, 2026

The Role of Initialization in 3D Gaussian Splatting

3D Gaussian Splatting (3DGS) has become the method of choice for photo-realistic novel view synthesis (NVS), due to its efficiency and compelling visual quality. 3DGS represents the scene as a set of 3D Gaussians, parameterized by their position, spatial extent, and view-dependent color. Starting from an initial point cloud, 3DGS refines the Gaussians' parameters to reconstruct a set of training images as accurately as possible. Typically, a sparse Structure-from-Motion point cloud is used as initialization. Thus, in order to obtain a full scene representation, 3DGS methods rely on a densification stage. In this paper, we systematically study how initialization affects 3DGS NVS performance and geometric quality, using several densification strategies. We show that dense initialization does not lead to consistent visual improvements when paired with strong densification. Despite that, it helps in generalization to off-trajectory views and significantly improves geometric accuracy of the scenes. Our code is available at https://github.com/deivse/ivd_splat.