TY - JOUR
T1 - Point Pattern Matching Using Centroid Bounding
AU - Griffin, Paul M.
AU - Alexopoulos, Christos
PY - 1989
Y1 - 1989
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=0024734255&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0024734255&partnerID=8YFLogxK
U2 - 10.1109/21.44047
DO - 10.1109/21.44047
M3 - Article
AN - SCOPUS:0024734255
VL - 19
SP - 1274
EP - 1276
JO - IEEE Transactions on Systems, Man and Cybernetics
JF - IEEE Transactions on Systems, Man and Cybernetics
SN - 0018-9472
IS - 5
ER -