MatcherCompass: A Deployment-Aware Benchmark to Guide Image Matcher Selection in the Wild

Dense feature matching aims to estimate all correspondences between two images of a 3D scene and has recently been established as the gold standard due to its high accuracy and robustness. However, existing dense matchers still fail or perform poorly for many hard real-world scenarios, and high-precision models are often slow, limiting their applicability. In this paper, we attack these weaknesses on a wide front through a series of systematic improvements that together yield a significantly better model. In particular, we construct a novel matching architecture and loss, which, combined with a curated diverse training distribution, enables our model to solve many complex matching tasks. We further make training faster through a decoupled two-stage matching-then-refinement pipeline, and at the same time, significantly reduce refinement memory usage through a custom CUDA kernel. Finally, we leverage the recent DINOv3 foundation model along with multiple other insights to make the model more robust and unbiased. In our extensive set of experiments, we show that the resulting novel matcher sets a new state-of-the-art, being significantly more accurate than its predecessors. Code is available at https://github.com/Parskatt/romav2

This paper provides a consistent and extensive evaluation of state-of-the-art filtering and refinement methods on common image matching pipelines. Unlike previous comparisons, the designed benchmark also takes into account the more general, real, and practical cases where camera intrinsics are unavailable. Moreover, a novel and effective strategy combining non-deep traditional computer vision approaches based on planar constraints and cross correlation is presented. Experimental analysis provides several insights for current application design and future research directions. In particular, the choice of a proper evaluation protocol discloses the effective differences within the compared solutions which otherwise would tend to flatten. Moreover, the proposed classical algorithmic approach is competitive with recent deep methods. Besides providing robust baseline using traditional computer vision for the evaluation of deep-based methods, this knowledge is useful to improve and better understand the deep image matching architectures. On one hand, geometry-based filtering is effective in presence of outliers without degrading already robust deep pipelines; on the other hand cross-correlation refinement is valid in the case of corner-like keypoints and allows to not directly discard inaccurate matches by default in deep pipelines but to retain and refine them for achieving a better coverage of the scene.

Reliable correspondence estimation is a fundamental problem in image processing, underpinning applications such as Structure from Motion, visual localization, and image registration. Existing learning-based methods have significantly improved local feature representations, yet most still operate at the pixel or patch level and lack explicit modeling of regions that are jointly visible across views. We propose SAMatcher, a feature matching framework that formulates correspondence estimation through co-visibility modeling. Instead of directly matching local features, SAMatcher first predicts co-visible region masks and bounding boxes as structured priors for correspondence estimation. Built upon the Segment Anything Model (SAM), it introduces a symmetric cross-view interaction mechanism that enables bidirectional feature exchange and cross-view semantic alignment. We further develop a unified supervision scheme that jointly optimizes mask prediction and box localization through mask learning, box regression, and mask-box consistency constraints. Extensive experiments on challenging benchmarks demonstrate substantial improvements over existing matching pipelines, particularly under large viewpoint and scale variations. Our results show that foundation models originally designed for monocular segmentation can be effectively extended to multi-view correspondence reasoning through explicit co-visibility modeling, offering a new perspective on structured representation learning for image matching. Code and project page: https://xupan.top/Projects/samatcher