Jointly matching multiple, non-rigidly deformed 3D shapes is a challenging, $\mathcal{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 $\mathcal{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.
翻译:联合匹配多个非刚性变形的三维形状是一项具有挑战性、$\mathcal{NP}$-难问题。完美的匹配必须是循环一致的: 沿着多个形状的配对点对应关系必须最终到达原始形状的起始顶点。不幸的是,现有的量子形状匹配方法不支持多个形状, 甚至没有循环一致性。本文解决了这些挑战,介绍了第一种用于三维形状多匹配的量子混合方法;此外, 它也是循环一致的。其迭代公式适用于现代绝热量子硬件,与输入形状的总数呈线性关系。这些特征是通过将 $N$-形状降低为一连串的三形状匹配实现的,该部分是我们的主要技术贡献。由于量子退火,可以检索到中间$\mathcal{NP}$-困难对象的低能量高质量解。在基准数据集上,所提出的方法明显优于先前量子混合二形状匹配方法的多形状匹配扩展,与经典的多匹配方法相当。