English

Neural Graph Map: Dense Mapping with Efficient Loop Closure Integration

Computer Vision and Pattern Recognition 2025-06-26 v2 Robotics

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.

Keywords

Cite

@article{arxiv.2405.03633,
  title  = {Neural Graph Map: Dense Mapping with Efficient Loop Closure Integration},
  author = {Leonard Bruns and Jun Zhang and Patric Jensfelt},
  journal= {arXiv preprint arXiv:2405.03633},
  year   = {2025}
}

Comments

WACV 2025, Project page: https://kth-rpl.github.io/neural_graph_mapping/

R2 v1 2026-06-28T16:18:20.560Z