6 citations · 12 across the 5 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
cs.CV2021★ 1 cited
Adiabatic Quantum Graph Matching with Permutation Matrix Constraints
Marcel Seelbach Benkner, Vladislav Golyanik, Christian Theobalt +1
Matching problems on 3D shapes and images are challenging as they are frequently formulated as combinatorial quadratic assignment problems (QAPs) with permutation matrix constraint…
cs.CV2021
Q-Match: Iterative Shape Matching via Quantum Annealing
Marcel Seelbach Benkner, Zorah Lähner, Vladislav Golyanik +3
Finding shape correspondences can be formulated as an NP-hard quadratic assignment problem (QAP) that becomes infeasible for shapes with high sampling density. A promising research…