A SLAM Map Restoration Algorithm Based on Submaps and an Undirected Connected Graph

• URL: http://arxiv.org/abs/2007.14592v1
• Date: Wed, 29 Jul 2020 04:26:36 GMT
• Title: A SLAM Map Restoration Algorithm Based on Submaps and an Undirected Connected Graph
• Authors: Zongqian Zhan (1), Wenjie Jian (1), Yihui Li (1), Xin Wang (2) and Yang Yue (1) ((1) School of Geodesy and Geomatics, Wuhan University, China, (2) Leibniz University Hannover Institute of Geodesy)
• Abstract summary: We present a method of reconstructing a complete global map of UAV datasets by sequentially merging the submaps. Results show that the integrity of the mapping was significantly better than that of the current mainstream SLAM method.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Many visual simultaneous localization and mapping (SLAM) systems have been shown to be accurate and robust, and have real-time performance capabilities on both indoor and ground datasets. However, these methods can be problematic when dealing with aerial frames captured by a camera mounted on an unmanned aerial vehicle (UAV) because the flight height of the UAV can be difficult to control and is easily affected by the environment.To cope with the case of lost tracking, many visual SLAM systems employ a relocalization strategy. This involves the tracking thread continuing the online working by inspecting the connections between the subsequent new frames and the generated map before the tracking was lost. To solve the missing map problem, which is an issue in many applications , after the tracking is lost, based on monocular visual SLAM, we present a method of reconstructing a complete global map of UAV datasets by sequentially merging the submaps via the corresponding undirected connected graph. Specifically, submaps are repeatedly generated, from the initialization process to the place where the tracking is lost, and a corresponding undirected connected graph is built by considering these submaps as nodes and the common map points within two submaps as edges. The common map points are then determined by the bag-of-words (BoW) method, and the submaps are merged if they are found to be connected with the online map in the undirect connected graph. To demonstrate the performance of the proposed method, we first investigated the performance on a UAV dataset, and the experimental results showed that, in the case of several tracking failures, the integrity of the mapping was significantly better than that of the current mainstream SLAM method.

Related papers

• NavTopo: Leveraging Topological Maps For Autonomous Navigation Of a Mobile Robot [1.0550841723235613]
  We propose a full navigation pipeline based on topological map and two-level path planning. The pipeline localizes in the graph by matching neural network descriptors and 2D projections of the input point clouds. We test our approach in a large indoor photo-relaistic simulated environment and compare it to a metric map-based approach based on popular metric mapping method RTAB-MAP.
  arXiv  Detail & Related papers  (2024-10-15T10:54:49Z)
• MapTracker: Tracking with Strided Memory Fusion for Consistent Vector HD Mapping [21.5611219371754]
  The paper presents a vector HD-mapping algorithm that formulates the mapping as a tracking task and uses a history of memory latents to ensure consistent reconstructions over time. MapTracker significantly outperforms existing methods on both nuScenes and Agroverse2 datasets by over 8% and 19% on the conventional and the new consistency-aware metrics, respectively.
  arXiv  Detail & Related papers  (2024-03-23T23:05:25Z)
• MapTrack: Tracking in the Map [14.991113420276767]
  Multi-Object Tracking (MOT) aims to maintain stable and uninterrupted trajectories for each target. Most state-of-the-art approaches first detect objects in each frame and then implement data association between new detections and existing tracks. We propose a new framework comprising of three lightweight and plug-and-play algorithms: the probability map, the prediction map, and the covariance adaptive Kalman filter.
  arXiv  Detail & Related papers  (2024-02-20T12:35:23Z)
• Loopy-SLAM: Dense Neural SLAM with Loop Closures [53.11936461015725]
  We introduce Loopy-SLAM that globally optimize poses and the dense 3D model. We use frame-to-model tracking using a data-driven point-based submap generation method and trigger loop closures online by performing global place recognition. Evaluation on the synthetic Replica and real-world TUM-RGBD and ScanNet datasets demonstrate competitive or superior performance in tracking, mapping, and rendering accuracy when compared to existing dense neural RGBD SLAM methods.
  arXiv  Detail & Related papers  (2024-02-14T18:18:32Z)
• ReST: A Reconfigurable Spatial-Temporal Graph Model for Multi-Camera Multi-Object Tracking [11.619493960418176]
  Multi-Camera Multi-Object Tracking (MC-MOT) utilizes information from multiple views to better handle problems with occlusion and crowded scenes. Current graph-based methods do not effectively utilize information regarding spatial and temporal consistency. We propose a novel reconfigurable graph model that first associates all detected objects across cameras spatially before reconfiguring it into a temporal graph.
  arXiv  Detail & Related papers  (2023-08-25T08:02:04Z)
• 3DMODT: Attention-Guided Affinities for Joint Detection & Tracking in 3D Point Clouds [95.54285993019843]
  We propose a method for joint detection and tracking of multiple objects in 3D point clouds. Our model exploits temporal information employing multiple frames to detect objects and track them in a single network.
  arXiv  Detail & Related papers  (2022-11-01T20:59:38Z)
• TANDEM: Tracking and Dense Mapping in Real-time using Deep Multi-view Stereo [55.30992853477754]
  We present TANDEM, a real-time monocular tracking and dense framework. For pose estimation, TANDEM performs photometric bundle adjustment based on a sliding window of alignments. TANDEM shows state-of-the-art real-time 3D reconstruction performance.
  arXiv  Detail & Related papers  (2021-11-14T19:01:02Z)
• Tight-Integration of Feature-Based Relocalization in Monocular Direct Visual Odometry [49.89611704653707]
  We propose a framework for integrating map-based relocalization into online visual odometry. We integrate image features into Direct Sparse Odometry (DSO) and rely on feature matching to associate online visual odometry with a previously built map.
  arXiv  Detail & Related papers  (2021-02-01T21:41:05Z)
• Learning Spatio-Appearance Memory Network for High-Performance Visual Tracking [79.80401607146987]
  Existing object tracking usually learns a bounding-box based template to match visual targets across frames, which cannot accurately learn a pixel-wise representation. This paper presents a novel segmentation-based tracking architecture, which is equipped with a local-temporal memory network to learn accurate-temporal correspondence.
  arXiv  Detail & Related papers  (2020-09-21T08:12:02Z)
• Automatic extraction of road intersection points from USGS historical map series using deep convolutional neural networks [0.0]
  Road intersections data have been used across different geospatial applications and analysis. We employed the standard paradigm of using deep convolutional neural network for object detection task named region-based CNN. Also, compared to the majority of traditional computer vision algorithms RCNN provides more accurate extraction.
  arXiv  Detail & Related papers  (2020-07-14T23:51:15Z)
• Tracking Road Users using Constraint Programming [79.32806233778511]
  We present a constraint programming (CP) approach for the data association phase found in the tracking-by-detection paradigm of the multiple object tracking (MOT) problem. Our proposed method was tested on a motorized vehicles tracking dataset and produces results that outperform the top methods of the UA-DETRAC benchmark.
  arXiv  Detail & Related papers  (2020-03-10T00:04:32Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.