Gauss-Newton Optimizer for 3D Gaussian Splatting Reconstruction
| dc.contributor.author | Alsrup, Tom | |
| dc.contributor.author | Almryd, Rasmus | |
| dc.contributor.department | Chalmers tekniska högskola / Institutionen för data och informationsteknik | sv |
| dc.contributor.department | Chalmers University of Technology / Department of Computer Science and Engineering | en |
| dc.contributor.examiner | Sintorn, Erik | |
| dc.contributor.supervisor | Assarsson, Ulf | |
| dc.date.accessioned | 2026-01-09T09:39:20Z | |
| dc.date.issued | 2025 | |
| dc.date.submitted | ||
| dc.description.abstract | Recent advancements in neural rendering have enabled highly realistic and efficient representations of 3D scenes from multi-view images. Among these, 3D Gaussian Splatting (3DGS) has emerged as a promising technique that represents scenes using a collection of 3D Gaussian primitives. Since it is a new and active field of research, progress has been made in terms of reducing reconstruction time. We present a new method of optimizing 3DGS by replacing ADAM with a Gauss-Newton (GN) optimizer integrated with the differentiable rasterizer. To save on memory, we introduce custom CUDA kernels that cache radiance and transmittance instead of explicitly storing all gradients. In addition, we introduce a sparsity-aware memory scheme that allows us to store more relevant data while minimizing waste. In each GN iteration, we compute update directions from multiple image subsets using several kernels and aggregate them through a weighted mean. Finally, a line search algorithm is used to determine the optimal update step length based on the sum of squared residuals objective function. Our optimizer converges significantly faster than ADAM per iteration, but comes with a high memory footprint. Due to GN’s computational complexity, it requires more execution time to reach a similar quality level as the original ADAM optimizer. Our GN optimizer demonstrates encouraging results during training, and with further improvements and research detailed in this paper, we believe it could become a strong competitor to ADAM. | |
| dc.identifier.coursecode | DATX05 | |
| dc.identifier.uri | http://hdl.handle.net/20.500.12380/310851 | |
| dc.language.iso | eng | |
| dc.setspec.uppsok | Technology | |
| dc.subject | 3D Gaussian splatting | |
| dc.subject | 3DGS | |
| dc.subject | Gauss-newton | |
| dc.subject | ADAM | |
| dc.subject | 3D Reconstruction | |
| dc.subject | Preconditioned Conjugate Gradient method | |
| dc.subject | PCG | |
| dc.title | Gauss-Newton Optimizer for 3D Gaussian Splatting Reconstruction | |
| dc.type.degree | Examensarbete för masterexamen | sv |
| dc.type.degree | Master's Thesis | en |
| dc.type.uppsok | H | |
| local.programme | Computer science – algorithms, languages and logic (MPALG), MSc |
