Handling Multiple Hypotheses in Coarse-to-Fine Dense Image Matching
Not on the map. Why?
Abstract (arXiv)
Dense image matching aims to find a correspondent for every pixel of a source image in a partially overlapping target image. State-of-the-art methods typically rely on a coarse-to-fine mechanism where a single correspondent hypothesis is produced per source location at each scale. In challenging cases -- such as at depth discontinuities or when the target image is a strong zoom-in of the source image -- the correspondents of neighboring source locations are often widely spread and predicting a single correspondent hypothesis per source location at each scale may lead to erroneous matches. In this paper, we investigate the idea of predicting multiple correspondent hypotheses per source location at each scale instead. We consider a beam search strategy to propagat multiple hypotheses at each scale and propose integrating these multiple hypotheses into cross-attention layers, resulting in a novel dense matching architecture called BEAMER. BEAMER learns to preserve and propagate multiple hypotheses across scales, making it significantly more robust than state-of-the-art methods, especially at depth discontinuities or when the target image is a strong zoom-in of the source image.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 19 of its 25 references that are in the map. First posted on arXiv 10 Sep 2025.
Builds on
19 of 25 references.
References · 19
- 2019SuperGlue: Learning Feature Matching with Graph Neural Networkscited by 1,443
- 2021LoFTR: Detector-Free Local Feature Matching with Transformerscited by 984
- 2018MegaDepth: Learning Single-View Depth Prediction from Internet Photoscited by 737
- 2023LightGlue: Local Feature Matching at Light Speedcited by 590
- 2023RoMa: Robust Dense Feature Matchingcited by 302
- 2017HPatches: A benchmark and evaluation of handcrafted and learned local descriptorscited by 264
- 2022DKM: Dense Kernelized Feature Matching for Geometry Estimationcited by 177
- 2019GLU-Net: Global-Local Universal Network for Dense Flow and Correspondencescited by 139
- 2024Efficient LoFTR: Semi-Dense Local Feature Matching with Sparse-Like Speedcited by 120
- 2021Learning Accurate Dense Correspondences and When to Trust Themcited by 113
- 2024XFeat: Accelerated Features for Lightweight Image Matchingcited by 113
- 2022LaMAR: Benchmarking Localization and Mapping for Augmented Realitycited by 100
7 more
- 2022Deep Visual Geo-localization Benchmarkcited by 84
- 2023DeDoDe: Detect, Don't Describe -- Describe, Don't Detect for Local Feature Matchingcited by 63
- 2023PMatch: Paired Masked Image Modeling for Dense Geometric Matchingcited by 29
- 2023Adaptive Spot-Guided Transformer for Consistent Local Feature Matchingcited by 22
- 2022ECO-TR: Efficient Correspondences Finding Via Coarse-to-Fine Refinementcited by 18
- 2023Improving Transformer-based Image Matching by Cascaded Capturing Spatially Informative Keypointscited by 15
- 2024Are Semi-Dense Detector-Free Methods Good at Matching Local Features?cited by 1
Built on by
Citing papers per year: 2026: 1.
1 paper.