English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Paper

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

MPS-Authors
/persons/resource/persons214986

Bernard,  Florian
Computer Graphics, MPI for Informatics, Max Planck Society;

/persons/resource/persons256069

Suri,  Zeeshan Khan
Computer Graphics, MPI for Informatics, Max Planck Society;

/persons/resource/persons45610

Theobalt,  Christian       
Computer Graphics, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)

arXiv:2002.12623.pdf
(Preprint), 11MB

Supplementary Material (public)
There is no public supplementary material available
Citation

Bernard, F., Suri, Z. K., & Theobalt, C. (2020). MINA: Convex Mixed-Integer Programming for Non-Rigid Shape Alignment. Retrieved from https://arxiv.org/abs/2002.12623.


Cite as: https://hdl.handle.net/21.11116/0000-0007-E00C-F
Abstract
We present a convex mixed-integer programming formulation for non-rigid shape
matching. To this end, we propose a novel shape deformation model based on an
efficient low-dimensional discrete model, so that finding a globally optimal
solution is tractable in (most) practical cases. Our approach combines several
favourable properties: it is independent of the initialisation, it is much more
efficient to solve to global optimality compared to analogous quadratic
assignment problem formulations, and it is highly flexible in terms of the
variants of matching problems it can handle. Experimentally we demonstrate that
our approach outperforms existing methods for sparse shape matching, that it
can be used for initialising dense shape matching methods, and we showcase its
flexibility on several examples.