A2B: Anchor to Barycentric Coordinate for Robust Correspondence

06/05/2023
by   Weiyue Zhao, et al.
0

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.

READ FULL TEXT

page 2

page 9

page 10

page 12

page 13

page 14

page 17

page 18

research
06/07/2023

Learning Probabilistic Coordinate Fields for Robust Correspondences

We introduce Probabilistic Coordinate Fields (PCFs), a novel geometric-i...
research
01/28/2016

A Grassmannian Graph Approach to Affine Invariant Feature Matching

In this work, we present a novel and practical approach to address one o...
research
12/13/2021

DenseGAP: Graph-Structured Dense Correspondence Learning with Anchor Points

Establishing dense correspondence between two images is a fundamental co...
research
09/25/2022

ECO-TR: Efficient Correspondences Finding Via Coarse-to-Fine Refinement

Modeling sparse and dense image matching within a unified functional cor...
research
07/21/2020

3D Correspondence Grouping with Compatibility Features

We present a simple yet effective method for 3D correspondence grouping....
research
10/26/2021

CoFiNet: Reliable Coarse-to-fine Correspondences for Robust Point Cloud Registration

We study the problem of extracting correspondences between a pair of poi...
research
06/24/2019

On Uniquely Registrable Networks

Consider a network with N nodes in d-dimensional Euclidean space, and M ...

Please sign up or login with your details

Forgot password? Click here to reset