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

ReMatching:面向可扩展形状对应的低分辨率表示

ReMatching: Low-Resolution Representations for Scalable Shape Correspondence

Filippo Maggioli, Daniele Baieri, Emanuele Rodolà, Simone Melzi

AI总结:

ReMatching提出一种基于函数映射框架的低分辨率重网格化方法,通过保守保持原始拓扑和度量,使百万级顶点网格上的形状对应计算变得高效可行,并在质量和计算成本上优于现有方法。

摘要:

我们提出了ReMatching,一种基于函数映射框架的新型形状对应解决方案。我们的方法通过利用一种新的、合适的重网格化范式,即使在包含数百万顶点的网格上也能处理形状匹配任务,而原始函数映射方法在这些网格上无法应用或需要巨大的计算成本。我们方法的核心是一种时间高效的重网格化算法,该算法在构建低分辨率几何的同时,保守地保持原始拓扑和度量。这些特性使得函数映射优化问题能够在得到的低分辨率表示上进行转换,从而能够利用函数映射方法高效地计算对应关系。最后,我们提出了一种高效的技术,将估计的对应关系扩展到原始网格上。我们通过定量和定性比较表明,我们的方法在质量和计算成本方面均优于最先进的流程,更加高效且有效。

英文摘要:

We introduce \emph{ReMatching}, a novel shape correspondence solution based on the functional maps framework. Our method, by exploiting a new and appropriate \emph{re}-meshing paradigm, can target shape-\emph{matching} tasks even on meshes counting millions of vertices, where the original functional maps does not apply or requires a massive computational cost. The core of our procedure is a time-efficient remeshing algorithm which constructs a low-resolution geometry while acting conservatively on the original topology and metric. These properties allow translating the functional maps optimization problem on the resulting low-resolution representation, thus enabling efficient computation of correspondences with functional map approaches. Finally, we propose an efficient technique for extending the estimated correspondence to the original meshes. We show that our method is more efficient and effective through quantitative and qualitative comparisons, outperforming state-of-the-art pipelines in quality and computational cost.

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

↑