Beyond ANN: Exploiting Structural Knowledge for Efficient Place Recognition

• URL: http://arxiv.org/abs/2103.08366v1
• Date: Mon, 15 Mar 2021 13:10:57 GMT
• Title: Beyond ANN: Exploiting Structural Knowledge for Efficient Place Recognition
• Authors: Stefan Schubert, Peer Neubert, Peter Protzel
• Abstract summary: 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.
• Score: 8.121462458089143
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Visual place recognition is the task of recognizing same places of query images in a set of database images, despite potential condition changes due to time of day, weather or seasons. It is important for loop closure detection in SLAM and candidate selection for global localization. Many approaches in the literature perform computationally inefficient full image comparisons between queries and all database images. There is still a lack of suited methods for efficient place recognition that allow a fast, sparse comparison of only the most promising image pairs without any loss in performance. While this is partially given by ANN-based methods, they trade speed for precision and additional memory consumption, and many cannot find arbitrary numbers of matching database images in case of loops in the database. In this paper, we propose a novel fast sequence-based method for efficient place recognition that can be applied online. It uses relocalization to recover from sequence losses, and exploits usually available but often unused intra-database similarities for a potential detection of all matching database images for each query in case of loops or stops in the database. We performed extensive experimental evaluations over five datasets and 21 sequence combinations, and show that our method outperforms two state-of-the-art approaches and even full image comparisons in many cases, while providing a good tradeoff between performance and percentage of evaluated image pairs. Source code for Matlab will be provided with publication of this paper.

Related papers

• Breaking the Frame: Visual Place Recognition by Overlap Prediction [53.17564423756082]
  We propose a novel visual place recognition approach based on overlap prediction, called VOP. VOP proceeds co-visible image sections by obtaining patch-level embeddings using a Vision Transformer backbone. Our approach uses a voting mechanism to assess overlap scores for potential database images.
  arXiv  Detail & Related papers  (2024-06-23T20:00:20Z)
• MaskSearch: Querying Image Masks at Scale [60.82746984506577]
  MaskSearch is a system that focuses on accelerating queries over databases of image masks while guaranteeing the correctness of query results. Experiments with our prototype show that MaskSearch, using indexes approximately 5% of the compressed data size, accelerates individual queries by up to two orders of magnitude.
  arXiv  Detail & Related papers  (2023-05-03T18:28:14Z)
• Are Local Features All You Need for Cross-Domain Visual Place Recognition? [13.519413608607781]
  Visual Place Recognition aims to predict the coordinates of an image based solely on visual clues. Despite recent advances, recognizing the same place when the query comes from a significantly different distribution is still a major hurdle for state of the art retrieval methods. In this work we explore whether re-ranking methods based on spatial verification can tackle these challenges.
  arXiv  Detail & Related papers  (2023-04-12T14:46:57Z)
• Efficient Image-Text Retrieval via Keyword-Guided Pre-Screening [53.1711708318581]
  Current image-text retrieval methods suffer from $N$-related time complexity. This paper presents a simple and effective keyword-guided pre-screening framework for the image-text retrieval.
  arXiv  Detail & Related papers  (2023-03-14T09:36:42Z)
• ALADIN: Distilling Fine-grained Alignment Scores for Efficient Image-Text Matching and Retrieval [51.588385824875886]
  Cross-modal retrieval consists in finding images related to a given query text or vice-versa. Many recent methods proposed effective solutions to the image-text matching problem, mostly using recent large vision-language (VL) Transformer networks. This paper proposes an ALign And DIstill Network (ALADIN) to fill in the gap between effectiveness and efficiency.
  arXiv  Detail & Related papers  (2022-07-29T16:01:48Z)
• Tune It or Don't Use It: Benchmarking Data-Efficient Image Classification [9.017660524497389]
  We design a benchmark for data-efficient image classification consisting of six diverse datasets spanning various domains. We re-evaluate the standard cross-entropy baseline and eight methods for data-efficient deep learning published between 2017 and 2021 at renowned venues. tuning learning rate, weight decay, and batch size on a separate validation split results in a highly competitive baseline.
  arXiv  Detail & Related papers  (2021-08-30T11:24:51Z)
• Recall@k Surrogate Loss with Large Batches and Similarity Mixup [62.67458021725227]
  Direct optimization, by gradient descent, of an evaluation metric is not possible when it is non-differentiable. In this work, a differentiable surrogate loss for the recall is proposed. The proposed method achieves state-of-the-art results in several image retrieval benchmarks.
  arXiv  Detail & Related papers  (2021-08-25T11:09:11Z)
• Efficient image retrieval using multi neural hash codes and bloom filters [0.0]
  This paper delivers an efficient and modified approach for image retrieval using multiple neural hash codes. It also limits the number of queries using bloom filters by identifying false positives beforehand.
  arXiv  Detail & Related papers  (2020-11-06T08:46:31Z)
• 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)
• Image Matching across Wide Baselines: From Paper to Practice [80.9424750998559]
  We introduce a comprehensive benchmark for local features and robust estimation algorithms. Our pipeline's modular structure allows easy integration, configuration, and combination of different methods. We show that with proper settings, classical solutions may still outperform the perceived state of the art.
  arXiv  Detail & Related papers  (2020-03-03T15:20:57Z)

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.