点击次数：

论文类型：期刊论文

发表时间：2014-06-10

发表刊物：Journal of Information and Computational Science

收录刊物：EI、Scopus

卷号：11

期号：9

页面范围：2975-2982

ISSN号：15487741

摘要：Finding structure-preserving correspondences between pairs of shapes is a common operation in many geometry processing and applications. Usually the ambiguity of primary correspondences and symmetrical correspondences arises in the matching problem between two intrinsically symmetrical shapes. As intrinsically symmetrical shapes are ubiquitous, it is essential to handle this problem. In this paper, we present an approach to establish automatic sparse symmetry-aware correspondences between two shapes using graph matching. We propose a directed-angle scheme to capture the global structure of meshes. Then the graph matching is generalized to high-order potentials, which contains intrinsic descriptors, intrinsic distances and directed-angles among arbitrary three points in deformation-invariant embedding space of the mesh. Comprehensive experiments demonstrate that our method works well. Copyright ? 2014 Binary Information Press.