Neural Graph Map: Dense Mapping with Efficient Loop Closure Integration
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 re-quiring only minimal reintegration. Furthermore, we verify the scalability of our approach by demonstrating success-ful 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.
Authors
- Patric Jensfelt (ORCID: https://orcid.org/0000-0002-1170-7162)
- Leonard Bruns (ORCID: https://orcid.org/0000-0001-8747-6359)
- Jun Zhang
Institutions
- Graz University of Technology (AT)
- KTH Royal Institute of Technology (SE)
Publication Details
- Published
- 2025-02-26
- DOI
- https://doi.org/10.1109/wacv61041.2025.00287
- Primary Topic
- Neural Networks and Applications
- Type
- article
- Field-Weighted Citation Impact
- 0.00