Abstract

Visual Place Recognition (VPR) is a crucial component of many visual localization pipelines for embodied agents. VPR is often formulated as an image retrieval task aimed at jointly learning local features and an aggregation method. The current state-of-the-art VPR methods rely on VLAD aggregation, which can be trained to learn a weighted contribution of features through their soft assignment to cluster centers. However, this process has two key limitations. Firstly, the feature-to-cluster weighting does not account for over-represented repetitive structures within a cluster, e.g., shadows or window panes; this phenomenon is also referred to as the `burstiness' problem, classically solved by discounting repetitive features before aggregation. Secondly, feature to cluster comparisons are compute-intensive for state-of-the-art image encoders with high-dimensional local features. This paper addresses these limitations by introducing VLAD-BuFF with two novel contributions: i) a self-similar

Authors

(none)

Tags

  • Uncategorized

Stats

  • citations8
  • S2 citationsβ€”
  • github stars44
  • HF likes0
  • heat score10.46
  • arxiv keykhaliq2024vlad

Related papers

Vlad-buff: Burst-aware Fast Feature Aggregation For Visual Place Recognition β€” learning-to-hash