Sparse-to-dense Hypercolumn Matching For Long-term Visual Localization

Abstract

We propose a novel approach to feature point matching, suitable for robust and accurate outdoor visual localization in long-term scenarios. Given a query image, we first match it against a database of registered reference images, using recent retrieval techniques. This gives us a first estimate of the camera pose. To refine this estimate, like previous approaches, we match 2D points across the query image and the retrieved reference image. This step, however, is prone to fail as it is still very difficult to detect and match sparse feature points across images captured in potentially very different conditions. Our key contribution is to show that we need to extract sparse feature points only in the retrieved reference image: We then search for the corresponding 2D locations in the query image exhaustively. This search can be performed efficiently using convolutional operations, and robustly by using hypercolumn descriptors, i.e. image features computed for retrieval. We refer to this m

Stats

• citations53
• S2 citations—
• github stars0
• HF likes0
• heat score12.99
• arxiv keygermain2019sparse

Related papers

• Leveraging Local And Global Descriptors In Parallel To Search Correspondences For Visual Localization (2020)8.82
• Yes, We CANN: Constrained Approximate Nearest Neighbors For Local Feature-based Visual Localization (2023)14.99
• Deep Dense Local Feature Matching And Vehicle Removal For Indoor Visual Localization (2022)0.00
• Superncn: Neighbourhood Consensus Network For Robust Outdoor Scenes Matching (2019)2.26
• Local Feature Matching Using Deep Learning: A Survey (2024)18.68
• Densernet: Weakly Supervised Visual Localization Using Multi-scale Feature Aggregation (2020)15.62
• Efficient Loftr: Semi-dense Local Feature Matching With Sparse-like Speed (2024)16.36
• Viewpoint Invariant Dense Matching For Visual Geolocalization (2021)15.04