A Gromov-Hausdorff Framework with Diffusion Geometry for Topologically-Robust Non-rigid Shape Matching

被引:151
作者
Bronstein, Alexander M. [2 ]
Bronstein, Michael M. [2 ]
Kimmel, Ron [2 ]
Mahmoudi, Mona [1 ]
Sapiro, Guillermo [1 ]
机构
[1] Univ Minnesota, Dept Elect & Comp Engn, Minneapolis, MN 55455 USA
[2] Technion Israel Inst Technol, Dept Comp Sci, IL-32000 Haifa, Israel
基金
以色列科学基金会;
关键词
Non-rigid shape matching; Diffusion geometry; Gromov-Hausdorff distance; Topology; Missing data; Partiality; DISTANCE FUNCTIONS; POINT; RECOGNITION; COMPUTATION; GEODESICS; SURFACES;
D O I
10.1007/s11263-009-0301-6
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this paper, the problem of non-rigid shape recognition is studied from the perspective of metric geometry. In particular, we explore the applicability of diffusion distances within the Gromov-Hausdorff framework. While the traditionally used geodesic distance exploits the shortest path between points on the surface, the diffusion distance averages all paths connecting the points. The diffusion distance constitutes an intrinsic metric which is robust, in particular, to topological changes. Such changes in the form of shortcuts, holes, and missing data may be a result of natural non-rigid deformations as well as acquisition and representation noise due to inaccurate surface construction. The presentation of the proposed framework is complemented with examples demonstrating that in addition to the relatively low complexity involved in the computation of the diffusion distances between surface points, its recognition and matching performances favorably compare to the classical geodesic distances in the presence of topological changes between the non-rigid shapes.
引用
收藏
页码:266 / 286
页数:21
相关论文
共 72 条
[1]  
[Anonymous], 2007, Proc. SGP
[2]  
[Anonymous], P EUR 2008 WORKSH 3D
[3]  
[Anonymous], 1994, Multidimensional Scaling
[4]  
[Anonymous], 2003, Visualization and Mathematics, DOI DOI 10.1007/978-3-662-05105-4_2
[5]  
[Anonymous], P IEEE C COMP VIS PA
[6]  
[Anonymous], P WORKSH NONR REG TR
[7]  
[Anonymous], 2004, Diffusion maps and geometric harmonics
[8]   Laplacian eigenmaps for dimensionality reduction and data representation [J].
Belkin, M ;
Niyogi, P .
NEURAL COMPUTATION, 2003, 15 (06) :1373-1396
[9]  
Belkin M, 2009, PROCEEDINGS OF THE TWENTIETH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, P1031
[10]   A METHOD FOR REGISTRATION OF 3-D SHAPES [J].
BESL, PJ ;
MCKAY, ND .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1992, 14 (02) :239-256