Effective shape contour extraction, multiresolution representation and matching methods

被引:2
作者
Attalla, E [1 ]
Siy, P [1 ]
机构
[1] Wayne State Univ, Dept Elect & Comp Engn, Detroit, MI 48202 USA
来源
Vision Geometry XIII | 2005年 / 5675卷
关键词
contour tracing; shape representation and matching; shape similarity retrieval; shape polygonal approximation;
D O I
10.1117/12.587798
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this paper we are going to present end to end algorithms that address curvature extraction, shape representation and shape similarity retrieval. Our novel shape contour tracing algorithm can trace open, ill-defined and closed shapes and return an ordered set of background points adjacent to the shape's contour. Our shape descriptor builds a multi-resolution equal segmentation polygonal based shape representation that uses the center of the shape as a reference point and is invariant to scale, rotation and translation, and efficient in terms of time and space. The shape descriptor captures three contour primitives including distance and slope at regular intervals around the center. The dual stage novel shape matching algorithm works in two stages. The first is data driven and uses a shape signature metric to factor out dissimilar shapes while the second stage linearly scans the remaining shapes and measures the similarity using elasticity with a distance and a user-friendly fuzzy measure. We have applied our algorithms on the MPEG-7 shape core experiment and achieved the best result reported based on the number of queries. Our algorithms achieved 83.23% for the similarity test of part B where the optimized CSS shape descriptor came second at 81.12%.
引用
收藏
页码:124 / 135
页数:12
相关论文
共 32 条
[1]  
[Anonymous], 0114 TR U ALB DEP CO
[2]   AN EFFICIENTLY COMPUTABLE METRIC FOR COMPARING POLYGONAL SHAPES [J].
ARKIN, EM ;
CHEW, LP ;
HUTTENLOCHER, DP ;
KEDEM, K ;
MITCHELL, JSB .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1991, 13 (03) :209-216
[3]  
BRADY M, 1983, HUMAN MACHINE VISION, P39
[4]   A SHAPE-RECOGNITION SCHEME BASED ON RELATIVE DISTANCES OF FEATURE POINTS FROM THE CENTROID [J].
CHANG, CC ;
HWANG, SM ;
BUEHRER, DJ .
PATTERN RECOGNITION, 1991, 24 (11) :1053-1063
[5]  
Cookson LJ, 1995, MATER ORGANISMEN, V29, P187
[6]  
Copson E.T., 1968, Metric Spaces
[7]   Relaxing the triangle inequality in pattern matching [J].
Fagin, R ;
Stockmeyer, L .
INTERNATIONAL JOURNAL OF COMPUTER VISION, 1998, 30 (03) :219-231
[8]   Flexible syntactic matching of curves and its application to automatic hierarchical classification of silhouettes [J].
Gdalyahu, Y ;
Weinshall, D .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1999, 21 (12) :1312-1328
[9]  
Gonzalez R., 2019, Digital Image Processing, V2nd
[10]  
GRIGORE O, UUCS2003005