DeepAI AI Chat
Log In Sign Up

Efficient Deformable Shape Correspondence via Kernel Matching

by   Zorah Lähner, et al.

We present a method to match three dimensional shapes under non-isometric deformations, topology changes and partiality. We formulate the problem as matching between a set of pair-wise and point-wise descriptors, imposing a continuity prior on the mapping, and propose a projected descent optimization procedure inspired by difference of convex functions (DC) programming. Surprisingly, in spite of the highly non-convex nature of the resulting quadratic assignment problem, our method converges to a semantically meaningful and continuous mapping in most of our experiments, and scales well. We provide preliminary theoretical analysis and several interpretations of the method.


page 1

page 6

page 13


A correspondence-less approach to matching of deformable shapes

Finding a match between partially available deformable shapes is a chall...

DC Proximal Newton for Non-Convex Optimization Problems

We introduce a novel algorithm for solving learning problems where both ...

Stochastic Optimization for DC Functions and Non-smooth Non-convex Regularizers with Non-asymptotic Convergence

Difference of convex (DC) functions cover a broad family of non-convex a...

Bayesian Inference of Bijective Non-Rigid Shape Correspondence

Many algorithms for the computation of correspondences between deformabl...

Cyclic Functional Mapping: Self-supervised correspondence between non-isometric deformable shapes

We present the first utterly self-supervised network for dense correspon...

MINA: Convex Mixed-Integer Programming for Non-Rigid Shape Alignment

We present a convex mixed-integer programming formulation for non-rigid ...

Elasticity-based Matching by Minimizing the Symmetric Difference of Shapes

We consider the problem of matching two shapes assuming these shapes are...

Code Repositories


Implementation of Efficient Deformable Shape Correspondence via Kernel Matching (

view repo