mlsanityData to 7 Oct 2026

CoMatch: Dynamic Covisibility-Aware Transformer for Bilateral Subpixel-Level Semi-Dense Image Matching

arXiv 2503.23925 ↗First posted 31 Mar 2025cs.CVcited by 12

Not on the map. Why?

Abstract (arXiv)

This prospective study proposes CoMatch, a novel semi-dense image matcher with dynamic covisibility awareness and bilateral subpixel accuracy. Firstly, observing that modeling context interaction over the entire coarse feature map elicits highly redundant computation due to the neighboring representation similarity of tokens, a covisibility-guided token condenser is introduced to adaptively aggregate tokens in light of their covisibility scores that are dynamically estimated, thereby ensuring computational efficiency while improving the representational capacity of aggregated tokens simultaneously. Secondly, considering that feature interaction with massive non-covisible areas is distracting, which may degrade feature distinctiveness, a covisibility-assisted attention mechanism is deployed to selectively suppress irrelevant message broadcast from non-covisible reduced tokens, resulting in robust and compact attention to relevant rather than all ones. Thirdly, we find that at the fine-level stage, current methods adjust only the target view's keypoints to subpixel level, while those in the source view remain restricted at the coarse level and thus not informative enough, detrimental to keypoint location-sensitive usages. A simple yet potent fine correlation module is developed to refine the matching candidates in both source and target views to subpixel level, attaining attractive performance improvement. Thorough experimentation across an array of public benchmarks affirms CoMatch's promising accuracy, efficiency, and generalizability.

Key facts. Cited by 12 papers in the map (data through 7 Oct 2026). Builds on 48 of its 67 references that are in the map. First posted on arXiv 31 Mar 2025.

Builds on

48 of 67 references.

References · 48

  1. 2017Attention Is All You Needcited by 59,932
  2. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  3. 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 29,915
  4. 2020End-to-End Object Detection with Transformerscited by 7,384
  5. 20233D Gaussian Splatting for Real-Time Radiance Field Renderingcited by 6,141
  6. 2016Feature Pyramid Networks for Object Detectioncited by 5,021
  7. 2021RoFormer: Enhanced Transformer with Rotary Position Embeddingcited by 4,581
  8. 2017ScanNet: Richly-annotated 3D Reconstructions of Indoor Scenescited by 3,088
  9. 2019A Comprehensive Survey on Graph Neural Networkscited by 2,906
  10. 2020Transformers are RNNs: Fast Autoregressive Transformers with Linear Attentioncited by 1,979
  11. 2019SuperGlue: Learning Feature Matching with Graph Neural Networkscited by 1,437
  12. 2017SuperPoint: Self-Supervised Interest Point Detection and Descriptioncited by 1,313
36 more
  1. 2015ORB-SLAM: a Versatile and Accurate Monocular SLAM Systemcited by 983
  2. 2021LoFTR: Detector-Free Local Feature Matching with Transformerscited by 974
  3. 2016ORB-SLAM2: an Open-Source SLAM System for Monocular, Stereo and RGB-D Camerascited by 801
  4. 2018MegaDepth: Learning Single-View Depth Prediction from Internet Photoscited by 731
  5. 2023LightGlue: Local Feature Matching at Light Speedcited by 583
  6. 2018From Coarse to Fine: Robust Hierarchical Localization at Large Scalecited by 556
  7. 2021RepVGG: Making VGG-style ConvNets Great Againcited by 520
  8. 2019D2-Net: A Trainable CNN for Joint Detection and Description of Local Featurescited by 324
  9. 2023RoMa: Robust Dense Feature Matchingcited by 296
  10. 2017HPatches: A benchmark and evaluation of handcrafted and learned local descriptorscited by 261
  11. 2021COTR: Correspondence Transformer for Matching Across Imagescited by 182
  12. 2022DKM: Dense Kernelized Feature Matching for Geometry Estimationcited by 174
  13. 2018Neighbourhood Consensus Networkscited by 173
  14. 2022ASpanFormer: Detector-Free Image Matching with Adaptive Span Transformercited by 170
  15. 2019GLU-Net: Global-Local Universal Network for Dense Flow and Correspondencescited by 139
  16. 2020ASLFeat: Learning Local Features of Accurate Shape and Localizationcited by 129
  17. 2022QuadTree Attention for Vision Transformerscited by 129
  18. 2022MatchFormer: Interleaving Attention in Transformers for Feature Matchingcited by 126
  19. 2023ALIKED: A Lighter Keypoint and Descriptor Extraction Network via Deformable Transformationcited by 120
  20. 2024Efficient LoFTR: Semi-Dense Local Feature Matching with Sparse-Like Speedcited by 119
  21. 2021Learning Accurate Dense Correspondences and When to Trust Themcited by 113
  22. 2021Learnable Fourier Features for Multi-Dimensional Spatial Positional Encodingcited by 93
  23. 2020Efficient Neighbourhood Consensus Networks via Submanifold Sparse Convolutionscited by 92
  24. 2021Learning to Match Features with Seeded Graph Matching Networkcited by 92
  25. 2020Dual-Resolution Correspondence Networkscited by 90
  26. 2021PDC-Net+: Enhanced Probabilistic Dense Correspondence Networkcited by 80
  27. 2023Detector-Free Structure from Motioncited by 71
  28. 2022ClusterGNN: Cluster-based Coarse-to-Fine Graph Neural Network for Efficient Feature Matchingcited by 62
  29. 2023PATS: Patch Area Transportation with Subdivision for Local Feature Matchingcited by 33
  30. 2022TopicFM: Robust and Interpretable Topic-Assisted Feature Matchingcited by 32
  31. 2022Adaptive Assignment for Geometry Aware Local Feature Matchingcited by 30
  32. 2023SFD2: Semantic-guided Feature Detection and Descriptioncited by 28
  33. 2023IMP: Iterative Matching and Pose Estimation with Adaptive Poolingcited by 10
  34. 2023TopicFM+: Boosting Accuracy and Efficiency of Topic-Assisted Feature Matchingcited by 10
  35. 2024Affine-based Deformable Attention and Selective Fusion for Semi-dense Matchingcited by 5
  36. 2024PRISM: PRogressive dependency maxImization for Scale-invariant image Matchingcited by 5

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 4; 2026: 8.

12 papers.