Density-based Geometric Convergence of NeRFs at Training Time

Insights from Spatio-temporal Discretization

Journal Article (2024)
Author(s)

D.H. Haitz (TU Delft - Computer Graphics and Visualisation, Karlsruhe Institut für Technologie)

Berk Kivilcim (Karlsruhe Institut für Technologie)

Markus Ulrich (Karlsruhe Institut für Technologie)

Martin Weinmann (Karlsruhe Institut für Technologie)

M. Weinmann (TU Delft - Computer Graphics and Visualisation)

Research Group
Computer Graphics and Visualisation
DOI related publication
https://doi.org/10.5194/isprs-archives-XLVIII-2-W7-2024-49-2024
More Info
expand_more
Publication Year
2024
Language
English
Research Group
Computer Graphics and Visualisation
Issue number
2/W7-2024
Volume number
48
Pages (from-to)
49-56
Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Abstract

Whereas emerging learning-based scene representations are predominantly evaluated based on image quality metrics such as PSNR, SSIM or LPIPS, only a few investigations focus on the evaluation of geometric accuracy of the underlying model. In contrast to only demonstrating the geometric deviations of models for the fully optimized scene model, our work aims at investigating the geometric convergence behavior during the optimization. For this purpose, we analyze the geometric convergence of discretized density fields by leveraging respectively derived point cloud representations for different training steps during the optimization of the scene representation and their comparison based on established point cloud metrics, thereby allowing insights regarding which scene parts are already represented well within the scene representation at a certain time during the optimization. By demonstrating that certain regions reach convergence earlier than other regions in the scene, we provide the motivation regarding future developments on locally-guided optimization approaches to shift the computational burden to the adjustment of regions that still need to converge while leaving converged regions unchanged which might help to further reduce training time and improve the achieved quality.

Files

License info not available