Point Pattern Matching Using Centroid Bounding

Paul M. Griffin; Christos Alexopoulos

doi:10.1109/21.44047

Point Pattern Matching Using Centroid Bounding

Paul M. Griffin, Christos Alexopoulos

Marcus Department of Industrial and Manufacturing Engineering

Research output: Contribution to journal › Article › peer-review

30 Scopus citations

Abstract

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 language	English (US)
Pages (from-to)	1274-1276
Number of pages	3
Journal	IEEE Transactions on Systems, Man and Cybernetics
Volume	19
Issue number	5
DOIs	https://doi.org/10.1109/21.44047
State	Published - 1989

All Science Journal Classification (ASJC) codes

General Engineering

Access to Document

10.1109/21.44047

Cite this

@article{ed3ccd83ccef425d89cff64c2c93c02b,

title = "Point Pattern Matching Using Centroid Bounding",

abstract = "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.",

author = "Griffin, {Paul M.} and Christos Alexopoulos",

year = "1989",

doi = "10.1109/21.44047",

language = "English (US)",

volume = "19",

pages = "1274--1276",

journal = "IEEE Transactions on Systems, Man and Cybernetics",

issn = "0018-9472",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "5",

}

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

SN - 0018-9472

VL - 19

SP - 1274

EP - 1276

JO - IEEE Transactions on Systems, Man and Cybernetics

JF - IEEE Transactions on Systems, Man and Cybernetics

IS - 5

ER -

Point Pattern Matching Using Centroid Bounding

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this