Non-Rigid Puzzles

dc.contributor.authorLitany, Oren_US
dc.contributor.authorRodolĂ , Emanueleen_US
dc.contributor.authorBronstein, Alex M.en_US
dc.contributor.authorBronstein, Michael M.en_US
dc.contributor.authorCremers, Danielen_US
dc.contributor.editorMaks Ovsjanikov and Daniele Panozzoen_US
dc.date.accessioned2016-06-17T14:11:56Z
dc.date.available2016-06-17T14:11:56Z
dc.date.issued2016en_US
dc.description.abstractShape 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.en_US
dc.description.number5en_US
dc.description.sectionheadersFunctional Correspondenceen_US
dc.description.seriesinformationComputer Graphics Forumen_US
dc.description.volume35en_US
dc.identifier.doi10.1111/cgf.12970en_US
dc.identifier.issn1467-8659en_US
dc.identifier.pages135-143en_US
dc.identifier.urihttps://doi.org/10.1111/cgf.12970en_US
dc.publisherThe Eurographics Association and John Wiley & Sons Ltd.en_US
dc.subjectI.3.5 [Computer Graphics]en_US
dc.subjectComputational Geometry and Object Modelingen_US
dc.subjectShape Analysisen_US
dc.titleNon-Rigid Puzzlesen_US
Files