Detecting similarity between non-rigid shapes is one of the fundamental problems in computer vision.In order to measure the similarity the shapes must first be aligned.As opposite to rigid alignment that can be parame...Detecting similarity between non-rigid shapes is one of the fundamental problems in computer vision.In order to measure the similarity the shapes must first be aligned.As 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 parameterized.Majority of the methods addressing this problem boil down to a minimization of a certain distortion measure.The 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 two-manifolds.Here 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 points.These correspondences may serve as an initialization for dense linear correspondence search.展开更多
基金This research was supported by European Community’s FP7-ERC program,grant agreement no.267414.
文摘Detecting similarity between non-rigid shapes is one of the fundamental problems in computer vision.In order to measure the similarity the shapes must first be aligned.As 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 parameterized.Majority of the methods addressing this problem boil down to a minimization of a certain distortion measure.The 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 two-manifolds.Here 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 points.These correspondences may serve as an initialization for dense linear correspondence search.
