Non-Rigid Puzzles

O. Litany, E. Rodolà, A. M. Bronstein, M. M. Bronstein, D. Cremers

Research output: Contribution to journalArticlepeer-review

Abstract

Shape correspondence is a fundamental problem in computer graphics and vision, with applications in various problems including animation, texture mapping, robotic vision, medical imaging, archaeology and many more. In settings where the shapes are allowed to undergo non-rigid deformations and only partial views are available, the problem becomes very challenging. To this end, we present a non-rigid multi-part shape matching algorithm. We assume to be given a reference shape and its multiple parts undergoing a non-rigid deformation. Each of these query parts can be additionally contaminated by clutter, may overlap with other parts, and there might be missing parts or redundant ones. Our method simultaneously solves for the segmentation of the reference model, and for a dense correspondence to (subsets of) the parts. Experimental results on synthetic as well as real scans demonstrate the effectiveness of our method in dealing with this challenging matching scenario.

Original languageEnglish
Pages (from-to)135-143
Number of pages9
JournalComputer Graphics Forum
Volume35
Issue number5
DOIs
StatePublished - 1 Aug 2016
Externally publishedYes

Keywords

  • Categories and Subject Descriptors (according to ACM CCS)
  • I.3.5 [Computer Graphics]: Computational Geometry and Object Modeling—Shape Analysis

Fingerprint

Dive into the research topics of 'Non-Rigid Puzzles'. Together they form a unique fingerprint.

Cite this