Discrete Cycle-Consistency Based Unsupervised Deep Graph Matching

We contribute to the sparsely populated area of unsupervised deep graph matching with application to keypoint matching in images. Contrary to the standard supervised approach, our method does not require ground truth correspondences between keypoint pairs. Instead, it is self-supervised by enforcing consistency of matchings between images of the same object category. As the matching and the consistency loss are discrete, their derivatives cannot be straightforwardly used for learning. We address this issue in a principled way by building our method upon the recent results on black-box differentiation of combinatorial solvers. This makes our method exceptionally flexible, as it is compatible with arbitrary network architectures and combinatorial solvers. Our experimental evaluation suggests that our technique sets a new state-of-the-art for unsupervised graph matching.

Authors

• Siddharth Tourani Computer Vision and Learning Lab, IWR, Heidelberg University MBZUAI
• Muhammad Haris Khan Mohamed Bin Zayed University of Artificial Intelligence
• Carsten Rother Computer Vision and Learning Lab, IWR, Heidelberg University
• Bogdan Savchynskyy Computer Vision and Learning Lab, IWR, Heidelberg University

Keywords

• CV: Learning & Optimization for CV
• SO: Combinatorial Optimization