CVSep 19, 2024

3DGS-LM: Faster Gaussian-Splatting Optimization with Levenberg-Marquardt

arXiv:2409.12892v247 citationsh-index: 86
AI Analysis

This addresses optimization speed for 3D scene reconstruction, though it is incremental as it builds on existing 3DGS methods.

The paper tackles slow optimization in 3D Gaussian Splatting (3DGS) by replacing the ADAM optimizer with a tailored Levenberg-Marquardt (LM) approach, achieving 20% faster reconstruction while maintaining the same quality.

We present 3DGS-LM, a new method that accelerates the reconstruction of 3D Gaussian Splatting (3DGS) by replacing its ADAM optimizer with a tailored Levenberg-Marquardt (LM). Existing methods reduce the optimization time by decreasing the number of Gaussians or by improving the implementation of the differentiable rasterizer. However, they still rely on the ADAM optimizer to fit Gaussian parameters of a scene in thousands of iterations, which can take up to an hour. To this end, we change the optimizer to LM that runs in conjunction with the 3DGS differentiable rasterizer. For efficient GPU parallization, we propose a caching data structure for intermediate gradients that allows us to efficiently calculate Jacobian-vector products in custom CUDA kernels. In every LM iteration, we calculate update directions from multiple image subsets using these kernels and combine them in a weighted mean. Overall, our method is 20% faster than the original 3DGS while obtaining the same reconstruction quality. Our optimization is also agnostic to other methods that acclerate 3DGS, thus enabling even faster speedups compared to vanilla 3DGS.

Code Implementations1 repo
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes