Title
Bending Graphs: Hierarchical Shape Matching using Gated Optimal Transport
Abstract
Shape matching has been a long-studied problem for the computer graphics and vision community. The objective is to predict a dense correspondence between meshes that have a certain degree of deformation. Existing methods either consider the local description of sampled points or discover correspondences based on global shape information. In this work, we investigate a hierarchical learning design, to which we incorporate local patch-level information and global shape-level structures. This flexible representation enables correspondence prediction and provides rich features for the matching stage. Finally, we propose a novel optimal transport solver by recurrently updating features on non-confident nodes to learn globally consistent correspondences between the shapes. Our results on publicly available datasets suggest robust performance in presence of severe deformations without the need of extensive training or refinement.
Year
DOI
Venue
2022
10.1109/CVPR52688.2022.01146
IEEE Conference on Computer Vision and Pattern Recognition
Keywords
DocType
Volume
Segmentation,grouping and shape analysis, Pose estimation and tracking, Representation learning
Conference
2022
Issue
Citations 
PageRank 
1
0
0.34
References 
Authors
0
6
Name
Order
Citations
PageRank
Mahdi Saleh101.35
Shun-Cheng Wu211.03
Luca Cosmo38112.49
Nassir Navab46594578.60
Benjamin Busam501.01
Federico Tombari6180298.90