Matching points into pairwise-disjoint noise regions: combinatorial bounds and algorithms

Esther M. Arkin, Klara Kedem, Joseph S.B. Mitchell, Josef Sprinzak, Michael Werman

Research output: Contribution to journalArticlepeer-review

15 Scopus citations

Abstract

We consider several cases of the point matching problem in which we are to find a transformation of a set of n points such that each transformed point lies in one of n given pairwise-disjoint 'noise regions.' We prove upper and lower bounds on the number of possible matches, under a variety of types of transformations (rotations, translations, similarity) and noise regions (circles, squares, polygons). We also give efficient algorithms for computing the set of all possible matches, along with a corresponding transformation that realizes each match.

Original languageEnglish
Pages (from-to)375-386
Number of pages12
JournalORSA journal on computing
Volume4
Issue number4
DOIs
StatePublished - 1 Jan 1992
Externally publishedYes

Fingerprint

Dive into the research topics of 'Matching points into pairwise-disjoint noise regions: combinatorial bounds and algorithms'. Together they form a unique fingerprint.

Cite this