CCuantuMM: Cycle-Consistent Quantum-Hybrid Matching of Multiple Shapes

by   Harshil Bhatia, et al.

Jointly matching multiple, non-rigidly deformed 3D shapes is a challenging, 𝒩𝒫-hard problem. A perfect matching is necessarily cycle-consistent: Following the pairwise point correspondences along several shapes must end up at the starting vertex of the original shape. Unfortunately, existing quantum shape-matching methods do not support multiple shapes and even less cycle consistency. This paper addresses the open challenges and introduces the first quantum-hybrid approach for 3D shape multi-matching; in addition, it is also cycle-consistent. Its iterative formulation is admissible to modern adiabatic quantum hardware and scales linearly with the total number of input shapes. Both these characteristics are achieved by reducing the N-shape case to a sequence of three-shape matchings, the derivation of which is our main technical contribution. Thanks to quantum annealing, high-quality solutions with low energy are retrieved for the intermediate 𝒩𝒫-hard objectives. On benchmark datasets, the proposed approach significantly outperforms extensions to multi-shape matching of a previous quantum-hybrid two-shape matching method and is on-par with classical multi-matching methods.


page 1

page 12

page 19

page 20

page 21

page 22

βˆ™ 07/20/2022

Unsupervised Deep Multi-Shape Matching

3D shape matching is a long-standing problem in computer vision and comp...
βˆ™ 12/04/2020

Isometric Multi-Shape Matching

Finding correspondences between shapes is a fundamental problem in compu...
βˆ™ 05/06/2021

Q-Match: Iterative Shape Matching via Quantum Annealing

Finding shape correspondences can be formulated as an NP-hard quadratic ...
βˆ™ 11/26/2018

Higher-order Projected Power Iterations for Scalable Multi-Matching

The matching of multiple objects (e.g. shapes or images) is a fundamenta...
βˆ™ 04/27/2022

A Scalable Combinatorial Solver for Elastic Geometrically Consistent 3D Shape Matching

We present a scalable combinatorial algorithm for globally optimizing ov...
βˆ™ 02/06/2019

CLEAR: A Consistent Lifting, Embedding, and Alignment Rectification Algorithm for Multi-Agent Data Association

A fundamental challenge in many robotics applications is to correctly sy...
βˆ™ 03/16/2018

Synchronisation of Partial Multi-Matchings via Non-negative Factorisations

In this work we study permutation synchronisation for the challenging ca...

Please sign up or login with your details

Forgot password? Click here to reset