DocumentCode
1502205
Title
Approximate geometric pattern matching under rigid motions
Author
Goodrich, Michael T. ; Mitchell, Joseph S B ; Orletsky, Mark W.
Author_Institution
Dept. of Comput. Sci., Johns Hopkins Univ., Baltimore, MD, USA
Volume
21
Issue
4
fYear
1999
fDate
4/1/1999 12:00:00 AM
Firstpage
371
Lastpage
379
Abstract
We present techniques for matching point-sets in two and three dimensions under rigid-body transformations. We prove bounds on the worst-case performance of these algorithms to be within a small constant factor of optimal and conduct experiments to show that the average performance of these matching algorithms is often better than that predicted by the worst-case bounds
Keywords
geometry; pattern matching; approximate geometric pattern matching; point-set matching; rigid motions; rigid-body transformations; worst-case bounds; Data mining; Dictionaries; Euclidean distance; Least squares approximation; Least squares methods; Machine vision; Pattern matching;
fLanguage
English
Journal_Title
Pattern Analysis and Machine Intelligence, IEEE Transactions on
Publisher
ieee
ISSN
0162-8828
Type
jour
DOI
10.1109/34.761267
Filename
761267
Link To Document