Fast Loop Closure Detection via Binary Content

• URL: http://arxiv.org/abs/2002.10622v2
• Date: Mon, 8 Feb 2021 13:54:37 GMT
• Title: Fast Loop Closure Detection via Binary Content
• Authors: Han Wang, Juncheng Li, Maopeng Ran and Lihua Xie
• Abstract summary: We leverage and compress the information into a binary image to accelerate an existing fast loop closure detection method via binary content. Our method is compared with the state-of-the-art loop closure detection methods and the results show that it outperforms the traditional methods at both recall rate and speed.
• Score: 25.571788215801003
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Loop closure detection plays an important role in reducing localization drift in Simultaneous Localization And Mapping (SLAM). It aims to find repetitive scenes from historical data to reset localization. To tackle the loop closure problem, existing methods often leverage on the matching of visual features, which achieve good accuracy but require high computational resources. However, feature point based methods ignore the patterns of image, i.e., the shape of the objects as well as the distribution of objects in an image. It is believed that this information is usually unique for a scene and can be utilized to improve the performance of traditional loop closure detection methods. In this paper we leverage and compress the information into a binary image to accelerate an existing fast loop closure detection method via binary content. The proposed method can greatly reduce the computational cost without sacrificing recall rate. It consists of three parts: binary content construction, fast image retrieval and precise loop closure detection. No offline training is required. Our method is compared with the state-of-the-art loop closure detection methods and the results show that it outperforms the traditional methods at both recall rate and speed.

Related papers

• Appearance-Based Loop Closure Detection for Online Large-Scale and Long-Term Operation [1.1279808969568252]
  In appearance-based localization and mapping, loop closure detection is the process used to determinate if the current observation comes from a previously visited location or a new one. This paper presents an online loop closure detection approach for large-scale and long-term operation.
  arXiv  Detail & Related papers  (2024-07-22T00:13:00Z)
• HashPoint: Accelerated Point Searching and Sampling for Neural Rendering [9.418401219498223]
  Two typical approaches are employed: renderingization and ray tracing. The volumeization-based methods enable real-time rendering at the cost of increased memory and lower fidelity. In contrast, the ray-tracing-based methods yield superior quality but demand longer time. We solve this problem by our HashPoint method combining these two strategies.
  arXiv  Detail & Related papers  (2024-04-22T09:57:53Z)
• Graph-based Asynchronous Event Processing for Rapid Object Recognition [59.112755601918074]
  Event cameras capture asynchronous events stream in which each event encodes pixel location, trigger time, and the polarity of the brightness changes. We introduce a novel graph-based framework for event cameras, namely SlideGCN. Our approach can efficiently process data event-by-event, unlock the low latency nature of events data while still maintaining the graph's structure internally.
  arXiv  Detail & Related papers  (2023-08-28T08:59:57Z)
• Improving Online Lane Graph Extraction by Object-Lane Clustering [106.71926896061686]
  We propose an architecture and loss formulation to improve the accuracy of local lane graph estimates. The proposed method learns to assign the objects to centerlines by considering the centerlines as cluster centers. We show that our method can achieve significant performance improvements by using the outputs of existing 3D object detection methods.
  arXiv  Detail & Related papers  (2023-07-20T15:21:28Z)
• Loop closure detection using local 3D deep descriptors [22.93552565583209]
  We present a method to address loop closure detection in simultaneous localisation and mapping using local 3D deep descriptors (L3Ds) We propose a novel overlap measure for loop detection by computing the metric error between points that correspond to mutually-nearest-neighbour descriptors. This novel approach enables us to accurately detect loops and estimate six degrees-of-freedom poses in the case of small overlaps.
  arXiv  Detail & Related papers  (2021-10-31T09:18:38Z)
• Beyond ANN: Exploiting Structural Knowledge for Efficient Place Recognition [8.121462458089143]
  We propose a novel fast sequence-based method for efficient place recognition that can be applied online. Our method outperforms two state-of-the-art approaches and even full image comparisons in many cases.
  arXiv  Detail & Related papers  (2021-03-15T13:10:57Z)
• Content-Based Detection of Temporal Metadata Manipulation [91.34308819261905]
  We propose an end-to-end approach to verify whether the purported time of capture of an image is consistent with its content and geographic location. The central idea is the use of supervised consistency verification, in which we predict the probability that the image content, capture time, and geographical location are consistent. Our approach improves upon previous work on a large benchmark dataset, increasing the classification accuracy from 59.03% to 81.07%.
  arXiv  Detail & Related papers  (2021-03-08T13:16:19Z)
• FMODetect: Robust Detection and Trajectory Estimation of Fast Moving Objects [110.29738581961955]
  We propose the first learning-based approach for detection and trajectory estimation of fast moving objects. The proposed method first detects all fast moving objects as a truncated distance function to the trajectory. For the sharp appearance estimation, we propose an energy minimization based deblurring.
  arXiv  Detail & Related papers  (2020-12-15T11:05:34Z)
• Displacement-Invariant Cost Computation for Efficient Stereo Matching [122.94051630000934]
  Deep learning methods have dominated stereo matching leaderboards by yielding unprecedented disparity accuracy. But their inference time is typically slow, on the order of seconds for a pair of 540p images. We propose a emphdisplacement-invariant cost module to compute the matching costs without needing a 4D feature volume.
  arXiv  Detail & Related papers  (2020-12-01T23:58:16Z)
• Fast and Incremental Loop Closure Detection with Deep Features and Proximity Graphs [13.328790865796224]
  This article proposes an appearance-based loop closure detection pipeline named FILD++" The system is fed by consecutive images and, via passing them twice through a single convolutional neural network, global and local deep features are extracted. An image-to-image pairing follows, which exploits local features to evaluate the spatial information.
  arXiv  Detail & Related papers  (2020-09-29T02:42:47Z)
• Learning Condition Invariant Features for Retrieval-Based Localization from 1M Images [85.81073893916414]
  We develop a novel method for learning more accurate and better generalizing localization features. On the challenging Oxford RobotCar night condition, our method outperforms the well-known triplet loss by 24.4% in localization accuracy within 5m.
  arXiv  Detail & Related papers  (2020-08-27T14:46:22Z)

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.