Approximate geometric pattern matching under rigid motions

Michael T. Goodrich; Joseph S.B. Mitchell; Markw Orletsky

doi:10.1109/34.761267

Approximate geometric pattern matching under rigid motions

Michael T. Goodrich
, Joseph S.B. Mitchell
, Markw Orletsky

Applied Mathematics and Statistics

Johns Hopkins University
Stony Brook University

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

58 Scopus citations

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.

Original language	English
Pages (from-to)	371-379
Number of pages	9
Journal	IEEE Transactions on Pattern Analysis and Machine Intelligence
Volume	21
Issue number	4
DOIs	https://doi.org/10.1109/34.761267
State	Published - 1999

Access to Document

10.1109/34.761267

Cite this

@article{bcedba16ee944306a1942e78fc5322b3,

title = "Approximate geometric pattern matching under rigid motions",

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

author = "Goodrich, \{Michael T.\} and Mitchell, \{Joseph S.B.\} and Markw Orletsky",

year = "1999",

doi = "10.1109/34.761267",

language = "English",

volume = "21",

pages = "371--379",

journal = "IEEE Transactions on Pattern Analysis and Machine Intelligence",

issn = "0162-8828",

number = "4",

}

TY - JOUR

T1 - Approximate geometric pattern matching under rigid motions

AU - Goodrich, Michael T.

AU - Mitchell, Joseph S.B.

AU - Orletsky, Markw

PY - 1999

Y1 - 1999

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/0032634603

U2 - 10.1109/34.761267

DO - 10.1109/34.761267

M3 - Article

AN - SCOPUS:0032634603

SN - 0162-8828

VL - 21

SP - 371

EP - 379

JO - IEEE Transactions on Pattern Analysis and Machine Intelligence

JF - IEEE Transactions on Pattern Analysis and Machine Intelligence

IS - 4

ER -

Approximate geometric pattern matching under rigid motions

Abstract

Access to Document

Other files and links

Fingerprint

Cite this