Saved in:
Bibliographic Details
Main Authors: Jin, Ke, Chen, Jiming, Ye, Qi
Format: Preprint
Published: 2026
Subjects:
Online Access:https://arxiv.org/abs/2604.06713
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866917391308423168
author Jin, Ke
Chen, Jiming
Ye, Qi
author_facet Jin, Ke
Chen, Jiming
Ye, Qi
contents Recent semi-dense image matching methods have achieved remarkable success, but two long-standing issues still impair their performance. At the coarse stage, the over-exclusion issue of their mutual nearest neighbor (MNN) matching layer makes them struggle to handle cases with scale difference between images. To this end, we comprehensively revisit the matching mechanism and make a key observation that the hint concealed in the score matrix can be exploited to indicate the scale ratio. Based on this, we propose a scale-aware matching module which is exceptionally effective but introduces negligible overhead. At the fine stage, we point out that existing methods neglect the local consistency of final matches, which undermines their robustness. To this end, rather than independently predicting the correspondence for each source pixel, we reformulate the fine stage as a cascaded flow refinement problem and introduce a novel gradient loss to encourage local consistency of the flow field. Extensive experiments demonstrate that our novel matching pipeline, with these proposed modifications, achieves robust and accurate matching performance on downstream tasks.
format Preprint
id arxiv_https___arxiv_org_abs_2604_06713
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Improving Local Feature Matching by Entropy-inspired Scale Adaptability and Flow-endowed Local Consistency
Jin, Ke
Chen, Jiming
Ye, Qi
Computer Vision and Pattern Recognition
Recent semi-dense image matching methods have achieved remarkable success, but two long-standing issues still impair their performance. At the coarse stage, the over-exclusion issue of their mutual nearest neighbor (MNN) matching layer makes them struggle to handle cases with scale difference between images. To this end, we comprehensively revisit the matching mechanism and make a key observation that the hint concealed in the score matrix can be exploited to indicate the scale ratio. Based on this, we propose a scale-aware matching module which is exceptionally effective but introduces negligible overhead. At the fine stage, we point out that existing methods neglect the local consistency of final matches, which undermines their robustness. To this end, rather than independently predicting the correspondence for each source pixel, we reformulate the fine stage as a cascaded flow refinement problem and introduce a novel gradient loss to encourage local consistency of the flow field. Extensive experiments demonstrate that our novel matching pipeline, with these proposed modifications, achieves robust and accurate matching performance on downstream tasks.
title Improving Local Feature Matching by Entropy-inspired Scale Adaptability and Flow-endowed Local Consistency
topic Computer Vision and Pattern Recognition
url https://arxiv.org/abs/2604.06713