mlsanityData to 14 Oct 2026

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

arXiv 2303.16202 ↗First posted 28 Mar 2023cs.CVcited by 11

Not on the map. Why?

Abstract (arXiv)

Jointly matching multiple, non-rigidly deformed 3D shapes is a challenging, NP-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 NP-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.

Key facts. Cited by 11 papers in the map (data through 14 Oct 2026). Builds on 22 of its 50 references that are in the map. First posted on arXiv 28 Mar 2023.

Builds on

22 of 50 references.

References · 22

  1. 20163D Menagerie: Modeling the 3D shape and pose of animalscited by 312
  2. 20183D-CODED : 3D Correspondences by Deep Deformationcited by 160
  3. 2019Learning elementary structures for 3D shape generation and matchingcited by 98
  4. 2022A Survey of Non-Rigid 3D Registrationcited by 59
  5. 2022Unsupervised Deep Multi-Shape Matchingcited by 39
  6. 2020Isometric Multi-Shape Matchingcited by 33
  7. 2021Quantum Permutation Synchronizationcited by 32
  8. 2019ZoomOut: Spectral Upsampling for Efficient Shape Correspondencecited by 30
  9. 2021Q-Match: Iterative Shape Matching via Quantum Annealingcited by 27
  10. 2014A practical heuristic for finding graph minorscited by 26
  11. 2017Efficient Deformable Shape Correspondence via Kernel Matchingcited by 25
  12. 2018Higher-order Projected Power Iterations for Scalable Multi-Matchingcited by 24
10 more
  1. 2019A Quantum Computational Approach to Correspondence Problems on Point Setscited by 23
  2. 2022Adiabatic Quantum Computing for Multi Object Trackingcited by 22
  3. 2021Adiabatic Quantum Graph Matching with Permutation Matrix Constraintscited by 20
  4. 2020Quantum-soft QUBO Suppression for Accurate Object Detectioncited by 19
  5. 2021Fusion Moves for Graph Matchingcited by 16
  6. 2022A Hybrid Quantum-Classical Algorithm for Robust Fittingcited by 16
  7. 2022Quantum Motion Segmentationcited by 16
  8. 2022Implicit field supervision for robust non-rigid shape matchingcited by 13
  9. 2021Matching Point Sets with Quantum Circuit Learningcited by 10
  10. 2019Quadratization in discrete optimization and quantum mechanicscited by 5

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2023: 4; 2024: 2; 2025: 2; 2026: 3.

11 papers.