Point Pattern Matching Using Centroid Bounding

Paul M. Griffin, Christos Alexopoulos

Research output: Contribution to journalArticlepeer-review

30 Scopus citations


Given two point patterns A and B in the plane, where \A \ = |B| = N, an algorithm is presented to find a feasible matching and registration between the point patterns. The matching results are invariant to rotation, translation, noise, and scaling.

Original languageEnglish (US)
Pages (from-to)1274-1276
Number of pages3
JournalIEEE Transactions on Systems, Man and Cybernetics
Issue number5
StatePublished - 1989

All Science Journal Classification (ASJC) codes

  • General Engineering


Dive into the research topics of 'Point Pattern Matching Using Centroid Bounding'. Together they form a unique fingerprint.

Cite this