Non-Rigid Puzzles
Litany O, Rodola E, Bronstein AM, Bronstein MM, Cremers D (2016)
Publication Type: Journal article
Publication year: 2016
Journal
Book Volume: 35
Pages Range: 135-143
Journal Issue: 5
DOI: 10.1111/cgf.12970
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.
Involved external institutions
Tel Aviv University
Israel (IL)
Università della Svizzera italiana (USI)
Switzerland (CH)
Technion - Israel Institute of Technology
Israel (IL)
Technische Universität München (TUM)
Germany (DE)
Israel (IL)
Università della Svizzera italiana (USI)
Switzerland (CH)
Technion - Israel Institute of Technology
Israel (IL)
Technische Universität München (TUM)
Germany (DE)
How to cite
APA:
Litany, O., Rodola, E., Bronstein, A.M., Bronstein, M.M., & Cremers, D. (2016). Non-Rigid Puzzles. Computer Graphics Forum, 35(5), 135-143. https://dx.doi.org/10.1111/cgf.12970
MLA:
Litany, Or, et al. "Non-Rigid Puzzles." Computer Graphics Forum 35.5 (2016): 135-143.
BibTeX: Download