Shape matching: Similarity measures and algorithms

被引：226

作者：

Veltkamp, RC ^{[1
]}

机构：

[1] Univ Utrecht, Dept Comp Sci, NL-3584 CH Utrecht, Netherlands

来源：

INTERNATIONAL CONFERENCE ON SHAPE MODELING AND APPLICATIONS, PROCEEDING | 2001年

关键词：

D O I：

10.1109/SMA.2001.923389

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

Shape matching is an important ingredient in shape retrieval, recognition and classification, alignment and registration. and approximation and simplification. This paper treats various aspects that are needed to solve shape matching problems: choosing the precise problem, selecting the properties of the similarity measure that are needed for the problem, choosing the specific similarity measure, and constructing the algorithm to compute the similarity. The focus is on methods that lie close to the field of computational geometry.

引用

页码：188 / 197

页数：10

共 61 条

[1] Matching shapes with a reference point [J].

Aichholzer, O ;

Alt, H ;

Rote, G .

INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 1997, 7 (04) :349-363

[2] APPROXIMATE MATCHING OF POLYGONAL SHAPES [J].

ALT, H ;

BEHRENDS, B ;

BLOMER, J .

ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, 1995, 13 (3-4) :251-265

[3]

Alt H., 1996, Algorithms - ESA '96. Fourth Annual European Symposium. Proceedings, P320

[4] COMPUTING THE FRECHET DISTANCE BETWEEN 2 POLYGONAL CURVES [J].

ALT, H ;

GODAU, M .

INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 1995, 5 (1-2) :75-91

[5]

[Anonymous], CONTOUR ORIENTED APP

[6]

[Anonymous], 1996, P INT WORKSH IM DAT

[7]

APOLLODORUS, 1921, LIB 100 200 AD

[8] 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

[9]

Baddeley A. J., 1992, ROBUST COMPUTER VISI, P59

[10]

Ballard D.H., 1982, Computer Vision

← 1 2 3 4 5 6 7 →