Approximate 2D-3D Shape Matching for Interactive Applications

Christoph Petzsch, Paul Roetzer, Zorah Lähner, Florian Bernard

Keywords: shape matching, 2D-to-3D, Dijkstra, product graph, approximation

TL;DR: We propose an approximation scheme to include higher-order cost functions in a shortest path product graph formulation of 2D-to-3D matching.

Abstract: Matching a 2D contour to a non-rigidly deformed 3D mesh is a challenging problem due to ambiguities arising from dimensionality differences. In the past, product graph based methods were only able to either produce fast but noisy solutions, or smooth but slow solutions (the latter enabled by higher-order costs computed in the conjugate product graph). In this work, we propose an approximation of these higher-order costs so that they can be computed in the ordinary product graph. This leads to an efficient algorithm for high-quality 2D-3D shape matching and enables novel applications, like an interactive user interface which allows to refine the solution gradually. We show theoretically that our method is efficient, and we experimentally validate that the accuracy gap of our approximation to the optimum is small in practice. Our code is available.

Submission Number: 332