CVCGOct 15, 2015

Elasticity-based Matching by Minimizing the Symmetric Difference of Shapes

arXiv:1510.04563v16 citations
Originality Incremental advance
AI Analysis

This work addresses shape matching in computer vision or graphics, but it appears incremental as it builds on existing elastic deformation methods with a new optimization approach.

The paper tackles the problem of matching two shapes related by elastic deformation by proposing a cost function and optimization procedure that minimizes the symmetric difference between shapes, using linearized elasticity theory and finite element methods, and demonstrates its utility in experiments with comparisons to an ICP-like algorithm.

We consider the problem of matching two shapes assuming these shapes are related by an elastic deformation. Using linearized elasticity theory and the finite element method we seek an elastic deformation that is caused by simple external boundary forces and accounts for the difference between the two shapes. Our main contribution is in proposing a cost function and an optimization procedure to minimize the symmetric difference between the deformed and the target shapes as an alternative to point matches that guide the matching in other techniques. We show how to approximate the nonlinear optimization problem by a sequence of convex problems. We demonstrate the utility of our method in experiments and compare it to an ICP-like matching algorithm.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes