A2B: Anchor to Barycentric Coordinate for Robust Correspondence
Not on the map. Why?
Abstract (arXiv)
There is a long-standing problem of repeated patterns in correspondence problems, where mismatches frequently occur because of inherent ambiguity. The unique position information associated with repeated patterns makes coordinate representations a useful supplement to appearance representations for improving feature correspondences. However, the issue of appropriate coordinate representation has remained unresolved. In this study, we demonstrate that geometric-invariant coordinate representations, such as barycentric coordinates, can significantly reduce mismatches between features. The first step is to establish a theoretical foundation for geometrically invariant coordinates. We present a seed matching and filtering network (SMFNet) that combines feature matching and consistency filtering with a coarse-to-fine matching strategy in order to acquire reliable sparse correspondences. We then introduce DEGREE, a novel anchor-to-barycentric (A2B) coordinate encoding approach, which generates multiple affine-invariant correspondence coordinates from paired images. DEGREE can be used as a plug-in with standard descriptors, feature matchers, and consistency filters to improve the matching quality. Extensive experiments in synthesized indoor and outdoor datasets demonstrate that DEGREE alleviates the problem of repeated patterns and helps achieve state-of-the-art performance. Furthermore, DEGREE also reports competitive performance in the third Image Matching Challenge at CVPR 2021. This approach offers a new perspective to alleviate the problem of repeated patterns and emphasizes the importance of choosing coordinate representations for feature correspondences.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 33 of its 72 references that are in the map. First posted on arXiv 5 Jun 2023.
Builds on
33 of 72 references.
References · 33
- 2017Attention Is All You Needcited by 60,361
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2017ScanNet: Richly-annotated 3D Reconstructions of Indoor Scenescited by 3,117
- 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,316
- 2018Dynamic Graph CNN for Learning on Point Cloudscited by 2,223
- 2019SuperGlue: Learning Feature Matching with Graph Neural Networkscited by 1,443
- 2017SuperPoint: Self-Supervised Interest Point Detection and Descriptioncited by 1,320
- 2018Self-Attention with Relative Position Representationscited by 1,120
- 2015ORB-SLAM: a Versatile and Accurate Monocular SLAM Systemcited by 988
- 2021LoFTR: Detector-Free Local Feature Matching with Transformerscited by 984
- 2018MegaDepth: Learning Single-View Depth Prediction from Internet Photoscited by 737
- 2017Convolutional Sequence to Sequence Learningcited by 552
21 more
- 2019Deep Closest Point: Learning Representations for Point Cloud Registrationcited by 321
- 2020DISK: Learning local features with policy gradientcited by 312
- 2017HPatches: A benchmark and evaluation of handcrafted and learned local descriptorscited by 264
- 2015YFCC100M: The New Data in Multimedia Researchcited by 235
- 2019Kornia: an Open Source Differentiable Computer Vision Library for PyTorchcited by 232
- 2020Image Matching across Wide Baselines: From Paper to Practicecited by 225
- 2017Working hard to know your neighbor's margins: Local descriptor learning losscited by 212
- 2021Rethinking and Improving Relative Position Encoding for Vision Transformercited by 207
- 2021COTR: Correspondence Transformer for Matching Across Imagescited by 183
- 2017Learning to Find Good Correspondencescited by 176
- 2018Neighbourhood Consensus Networkscited by 174
- 2019Learning Two-View Correspondences and Geometry Using Order-Aware Networkcited by 149
- 2020Patch2Pix: Epipolar-Guided Pixel-Level Correspondencescited by 129
- 2018MAGSAC: marginalizing sample consensuscited by 123
- 2021Learning to Match Features with Seeded Graph Matching Networkcited by 92
- 2019ContextDesc: Local Descriptor Augmentation with Cross-Modality Contextcited by 79
- 2022ClusterGNN: Cluster-based Coarse-to-Fine Graph Neural Network for Efficient Feature Matchingcited by 62
- 2017Repeatability Is Not Enough: Learning Affine Regions via Discriminabilitycited by 57
- 2019GIFT: Learning Transformation-Invariant Dense Visual Descriptors via Group CNNscited by 47
- 2019NM-Net: Mining Reliable Neighbors for Robust Feature Correspondencescited by 29
- 2020Improving the HardNet Descriptorcited by 4
Built on by
Citing papers per year: 2023: 2; 2024: 0; 2025: 1.
3 papers.
- 2023Constraining Depth Map Geometry for Multi-View Stereo: A Dual-Depth Approach with Saddle-shaped Depth Cellscited by 8
- 2023Fast Full-frame Video Stabilization with Iterative Optimizationcited by 8
- 2025Grid-Reg: Detector-Free Gridized Feature Learning and Matching for Large-Scale SAR-Optical Image Registrationcited by 1
- 2025Grid-Reg: Detector-Free Gridized Feature Learning and Matching for Large-Scale SAR-Optical Image Registration6 Jul 2025
- 2023Fast Full-frame Video Stabilization with Iterative Optimization24 Jul 2023
- 2023Constraining Depth Map Geometry for Multi-View Stereo: A Dual-Depth Approach with Saddle-shaped Depth Cells18 Jul 2023