3D shape matching through topological structures

被引:0
作者
Biasotti, S [1 ]
Marini, S [1 ]
Mortara, M [1 ]
Patanè, G [1 ]
Spagnuolo, M [1 ]
Falcidieno, B [1 ]
机构
[1] CNR, Ist Matemat Appl & Tecnol Informat, I-00185 Rome, Italy
来源
DISCRETE GEOMETRY FOR COMPUTER IMAGERY, PROCEEDINGS | 2003年 / 2886卷
关键词
D O I
暂无
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
This paper introduces a framework for the matching of 3D shapes represented by topological graphs. The method proposes as comparison algorithm an error tolerant graph isomorphism that includes a structured process for identifying matched areas on the input objects. Finally, we provide a series of experiments showing its capability to automatically compare complex objects starting from different skeletal representations used in Shape Modeling.
引用
收藏
页码:194 / 203
页数:10
相关论文
共 22 条
[1]  
[Anonymous], P ACM S SOL MOD APP
[2]   Shape understanding by contour-driven retiling [J].
Attene, M ;
Biasotti, S ;
Spagnuolo, M .
VISUAL COMPUTER, 2003, 19 (2-3) :127-138
[3]  
Biasotti S, 2003, SMI 2003: SHAPE MODELING INTERNATIONAL 2003, PROCEEDINGS, P245
[4]   A graph distance metric based on the maximal common subgraph [J].
Bunke, H ;
Shearer, K .
PATTERN RECOGNITION LETTERS, 1998, 19 (3-4) :255-259
[5]   A graduated assignment algorithm for graph matching [J].
Gold, S ;
Rangarajan, A .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1996, 18 (04) :377-388
[6]   Topological quadrangulations of closed triangulated surfaces using the Reeb graph [J].
Hétroy, F ;
Attali, D .
GRAPHICAL MODELS, 2003, 65 (1-3) :131-148
[7]  
Hilaga M, 2001, COMP GRAPH, P203, DOI 10.1145/383259.383282
[8]   Connected filtering and segmentation using component trees [J].
Jones, R .
COMPUTER VISION AND IMAGE UNDERSTANDING, 1999, 75 (03) :215-228
[9]  
Khoo KG, 2001, IEEE C EVOL COMPUTAT, P727, DOI 10.1109/CEC.2001.934261
[10]   SHAPES, SHOCKS, AND DEFORMATIONS .1. THE COMPONENTS OF 2-DIMENSIONAL SHAPE AND THE REACTION-DIFFUSION SPACE [J].
KIMIA, BB ;
TANNENBAUM, AR ;
ZUCKER, SW .
INTERNATIONAL JOURNAL OF COMPUTER VISION, 1995, 15 (03) :189-224