SRFeat: Learning Locally Accurate and Globally Consistent Non-Rigid Shape Correspondence

09/16/2022
by   Lei Li, et al.
0

In this work, we present a novel learning-based framework that combines the local accuracy of contrastive learning with the global consistency of geometric approaches, for robust non-rigid matching. We first observe that while contrastive learning can lead to powerful point-wise features, the learned correspondences commonly lack smoothness and consistency, owing to the purely combinatorial nature of the standard contrastive losses. To overcome this limitation we propose to boost contrastive feature learning with two types of smoothness regularization that inject geometric information into correspondence learning. With this novel combination in hand, the resulting features are both highly discriminative across individual points, and, at the same time, lead to robust and consistent correspondences, through simple proximity queries. Our framework is general and is applicable to local feature learning in both the 3D and 2D domains. We demonstrate the superiority of our approach through extensive experiments on a wide range of challenging matching benchmarks, including 3D non-rigid shape correspondence and 2D image keypoint matching.

READ FULL TEXT

page 8

page 14

research
03/31/2020

Deep Geometric Functional Maps: Robust Feature Learning for Shape Correspondence

We present a novel learning-based approach for computing correspondences...
research
06/11/2016

Universal Correspondence Network

We present a deep learning framework for accurate visual correspondences...
research
02/03/2022

Bending Graphs: Hierarchical Shape Matching using Gated Optimal Transport

Shape matching has been a long-studied problem for the computer graphics...
research
07/26/2020

A Dual Iterative Refinement Method for Non-rigid Shape Matching

In this work, a simple and efficient dual iterative refinement (DIR) met...
research
11/19/2022

Local Contrastive Feature learning for Tabular Data

Contrastive self-supervised learning has been successfully used in many ...
research
07/12/2016

Bayesian Inference of Bijective Non-Rigid Shape Correspondence

Many algorithms for the computation of correspondences between deformabl...
research
12/08/2022

Graph Matching with Bi-level Noisy Correspondence

In this paper, we study a novel and widely existing problem in graph mat...

Please sign up or login with your details

Forgot password? Click here to reset