DocumentCode
1011572
Title
Point pattern matching using centroid bounding
Author
Griffin, Paul M. ; Alexopoulos, Christos
Author_Institution
Sch. of Ind. & Syst. Eng., Georgia Inst. of Technol., Atlanta, GA, USA
Volume
19
Issue
5
fYear
1989
Firstpage
1274
Lastpage
1276
Abstract
A method is presented for matching point patterns A and B in the plane where |A |=|B |=N . The method is capable of determining the registration and matching and is not affected by translation, rotation, scaling or noise. An example application of the algorithm to the matching of flat parts is shown. The algorithm not only allows part recognition, but may also be extended to perform automated verification of the dimension of the part
Keywords
computerised pattern recognition; centroid bounding; computerised pattern recognition; noise; part recognition; point pattern matching; rotation; scaling; translation; Application software; Bipartite graph; Computer vision; Databases; Euclidean distance; Inspection; Pattern matching; Pattern recognition; Systems engineering and theory;
fLanguage
English
Journal_Title
Systems, Man and Cybernetics, IEEE Transactions on
Publisher
ieee
ISSN
0018-9472
Type
jour
DOI
10.1109/21.44047
Filename
44047
Link To Document