arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1311.7535cs.GR
收藏

稠密对应的紧部分基形状空间

Compact Part-Based Shape Spaces for Dense Correspondences

Oliver Burghard, Alexander Berner, Michael Wand, Niloy Mitra, Hans-Peter Seidel, Reinhard Klein

摘要:

我们考虑的问题,建立密集的对应关系内的一组相关的形状强烈变化的几何形状。对于这样的输入,传统的形状匹配方法往往产生不令人满意的结果。我们提出了一种集成优化方法,提高了给定的粗对应,以获得密集的对应。该方法遵循最小描述长度方法的思想,最大化诱导形状空间的紧凑性,以获得高质量的对应关系。我们做了一些改进,是重要的计算机图形应用程序:我们的方法处理网格的一般拓扑结构和处理不同的拓扑结构的输入之间的部分匹配。为此,我们引入了一种新的基于部分的生成统计形状模型。我们开发了一种新的分析算法,学习这些模型从不同的拓扑结构的训练形状。我们还提供了一种新的合成方法,可以生成新的实例与不同的部分布局和通用的变分约束。在实际的实验中,我们获得了一个国家的最先进的方法在对应质量的大幅改善。作为示例应用程序,我们展示了一个系统,学习形状的家庭作为可变形部件的组件,并允许实时编辑连续和离散的变化。

英文摘要:

We consider the problem of establishing dense correspondences within a set of related shapes of strongly varying geometry. For such input, traditional shape matching approaches often produce unsatisfactory results. We propose an ensemble optimization method that improves given coarse correspondences to obtain dense correspondences. Following ideas from minimum description length approaches, it maximizes the compactness of the induced shape space to obtain high-quality correspondences. We make a number of improvements that are important for computer graphics applications: Our approach handles meshes of general topology and handles partial matching between input of varying topology. To this end we introduce a novel part-based generative statistical shape model. We develop a novel analysis algorithm that learns such models from training shapes of varying topology. We also provide a novel synthesis method that can generate new instances with varying part layouts and subject to generic variational constraints. In practical experiments, we obtain a substantial improvement in correspondence quality over state-of-the-art methods. As example application, we demonstrate a system that learns shape families as assemblies of deformable parts and permits real-time editing with continuous and discrete variability.

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

↑