Hierarchical Framework for Shape Correspondence

作     者：Dan Raviv Anastasia Dubrovina Ron Kimmel 

作者机构：TechnionIsrael Institute of TechnologyTechnion CityHaifa 32000Israel 

出 版 物：《Numerical Mathematics(Theory,Methods and Applications)》 (高等学校计算数学学报（英文版）)

年 卷 期：2013年第6卷第1期

页      面：245-261页

核心收录：

学科分类：07[理学] 0701[理学-数学] 070101[理学-基础数学] 

基　　金：This research was supported by European Community’s FP7-ERC program grant agreement no.267414 

主　　题：Shape correspondence Laplace-Beltrami diffusion geometry local signatures 

摘      要：Detecting similarity between non-rigid shapes is one of the fundamental problems in computer *** order to measure the similarity the shapes must first be *** opposite to rigid alignment that can be parameterized using a small number of unknowns representing rotations,reflections and translations,non-rigid alignment is not easily *** of the methods addressing this problem boil down to a minimization of a certain distortion *** complexity of a matching process is exponential by nature,but it can be heuristically reduced to a quadratic or even linear for shapes which are smooth *** we model the shapes using both local and global structures,employ these to construct a quadratic dissimilarity measure,and provide a hierarchical framework for minimizing it to obtain sparse set of corresponding *** correspondences may serve as an initialization for dense linear correspondence search.