Bending Graphs: Hierarchical Shape Matching using Gated Optimal Transport

Saleh M, Wu SC, Cosmo L, Navab N, Busam B, Tombari F (2022)


Publication Type: Conference contribution

Publication year: 2022

Journal

Publisher: IEEE Computer Society

Book Volume: 2022-June

Pages Range: 11747-11757

Conference Proceedings Title: Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition

Event location: New Orleans, LA, USA

ISBN: 9781665469463

DOI: 10.1109/CVPR52688.2022.01146

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.

Involved external institutions

How to cite

APA:

Saleh, M., Wu, S.-C., Cosmo, L., Navab, N., Busam, B., & Tombari, F. (2022). Bending Graphs: Hierarchical Shape Matching using Gated Optimal Transport. In Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition (pp. 11747-11757). New Orleans, LA, USA: IEEE Computer Society.

MLA:

Saleh, Mahdi, et al. "Bending Graphs: Hierarchical Shape Matching using Gated Optimal Transport." Proceedings of the 2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition, CVPR 2022, New Orleans, LA, USA IEEE Computer Society, 2022. 11747-11757.

BibTeX: Download