Neural Graph Map: Dense Mapping with Efficient Loop Closure Integration

Leonard Bruns, Jun Zhang, Patric Jensfelt
5/6/2024
cs.CVcs.RO

Official code: KTH-RPL/neural_graph_mapping (152 stars, MIT, last commit 2025-06-25).

Abstract

Neural field-based SLAM methods typically employ a single, monolithic field as their scene representation. This prevents efficient incorporation of loop closure constraints and limits scalability. To address these shortcomings, we propose a novel RGB-D neural mapping framework in which the scene is represented by a collection of lightweight neural fields which are dynamically anchored to the pose graph of a sparse visual SLAM system. Our approach shows the ability to integrate large-scale loop closures, while requiring only minimal reintegration. Furthermore, we verify the scalability of our approach by demonstrating successful building-scale mapping taking multiple loop closures into account during the optimization, and show that our method outperforms existing state-of-the-art approaches on large scenes in terms of quality and runtime. Our code is available open-source at https://github.com/KTH-RPL/neural_graph_mapping.

View on arXivView PDF

Code Implementations(1)

MIT

Neural Graph Map: Dense Mapping with Efficient Loop Closure Integration

15211Shell, PythonMar 20, 20241 years agoMIT
loop-closuremappingnerfneural-fieldsneural-slam+2 more

Similar Papers

Cite this paper

@article{bruns2024neural,
  title  = {Neural Graph Map: Dense Mapping with Efficient Loop Closure Integration},
  author = {Leonard Bruns and Jun Zhang and Patric Jensfelt},
  year   = {2024},
  eprint = {2405.03633},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2405.03633v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2405.03633.svg)](https://codeofpaper.com/paper/2405.03633)

Discussion