An Efficient Approach to Correspondences between Multiple Non-Rigid Parts
An Efficient Approach to Correspondences between Multiple Non-Rigid Parts
复制标题
多个非刚性零件之间对应的有效方法
DOI：
10.1111/cgf.12439
复制
发表时间：
2014
影响因子：
2.5
通讯作者：
Tam G
中科院分区：
文献类型：
--
作者：
Tam G
识别网格上的多个可变形部分并在它们之间建立密集的对应关系是计算机图形学的基本重要任务，其应用例如几何编辑传播和纹理转移。许多研究都考虑在非刚性表面之间建立对应关系，但很少有工作可以识别相似的多个可变形部分并处理部分形状对应关系。本文解决了两个相关的问题，把它们作为一个整体：（i）识别网格上的相似的可变形部分，通过一个非刚性变换到一个给定的查询部分，和（ii）建立稠密点之间的自动对应。我们表明，简单而有效的技术可以开发，如果我们假设这些部分局部进行等距变形。我们的见解是，类似的变形部分建议由大集群的点对应，等距一致。一旦识别出这些部分，就可以通过迭代传播过程获得密集点对应。我们的技术适用于任意拓扑结构的模型。各种例子证明了我们的技术的有效性。
Identifying multiple deformable parts on meshes and establishing dense correspondences between them are tasks of fundamental importance to computer graphics, with applications to e.g. geometric edit propagation and texture transfer. Much research has considered establishing correspondences between non‐rigid surfaces, but little work can both identify similar multiple deformable partsandhandle partial shape correspondences. This paper addresses two related problems, treating them as a whole: (i) identifying similar deformable parts on a mesh, related by anon‐rigidtransformation to a given query part, and (ii) establishing dense point correspondences automatically between such parts. We show that simple and efficient techniques can be developed if we make the assumption that these parts locally undergo isometric deformation. Our insight is that similar deformable parts are suggested by large clusters of point correspondences that are isometrically consistent. Once such parts are identified,densepoint correspondences can be obtained by an iterative propagation process. Our techniques are applicable to models with arbitrary topology. Various examples demonstrate the effectiveness of our techniques.