Conjugate Product Graphs for Globally Optimal 2D-3D Shape Matching

by   Paul Roetzer, et al.

We consider the problem of finding a continuous and non-rigid matching between a 2D contour and a 3D mesh. While such problems can be solved to global optimality by finding a shortest path in the product graph between both shapes, existing solutions heavily rely on unrealistic prior assumptions to avoid degenerate solutions (e.g. knowledge to which region of the 3D shape each point of the 2D contour is matched). To address this, we propose a novel 2D-3D shape matching formalism based on the conjugate product graph between the 2D contour and the 3D shape. Doing so allows us for the first time to consider higher-order costs, i.e. defined for edge chains, as opposed to costs defined for single edges. This offers substantially more flexibility, which we utilise to incorporate a local rigidity prior. By doing so, we effectively circumvent degenerate solutions and thereby obtain smoother and more realistic matchings, even when using only a one-dimensional feature descriptor. Overall, our method finds globally optimal and continuous 2D-3D matchings, has the same asymptotic complexity as previous solutions, produces state-of-the-art results for shape matching and is even capable of matching partial shapes.


page 1

page 2

page 3

page 4


Geometrically Consistent Partial Shape Matching

Finding correspondences between 3D shapes is a crucial problem in comput...

Efficient Globally Optimal 2D-to-3D Deformable Shape Matching

We propose the first algorithm for non-rigid 2D-to-3D shape matching, wh...

Adaptive Locally Affine-Invariant Shape Matching

Matching deformable objects using their shapes is an important problem i...

Perceptually Motivated Shape Context Which Uses Shape Interiors

In this paper, we identify some of the limitations of current-day shape ...

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

We present a scalable combinatorial algorithm for globally optimizing ov...

A Combinatorial Solution to Non-Rigid 3D Shape-to-Image Matching

We propose a combinatorial solution for the problem of non-rigidly match...

Globally Optimal Joint Image Segmentation and Shape Matching Based on Wasserstein Modes

A functional for joint variational object segmentation and shape matchin...

Please sign up or login with your details

Forgot password? Click here to reset