arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2011.13076cs.CVcs.GR

Non-Rigid Puzzles

University of Lugano(卢加诺大学);Technion(以色列理工学院);Intel(英特尔);TU Munich(慕尼黑工业大学)

Or Litany, Emanuele Rodolà, Alex Bronstein, Michael Bronstein, Daniel Cremers

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑