Matching points into noise regions: Combinatorial bounds and algorithms

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

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

9 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 pairwisedisjoint "noise regions". We prove upper and lower bounds on the number of possible matches, under a variety of types of transformations (rotations, translations, similarity, etc.) and noise regions (circles, squares, polygons, etc.). We also give efficient algorithms for computing the set of all possible matches, along with a corresponding transformation that realizes each match.

Original languageAmerican English
Title of host publicationProceedings of the 2nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1991
PublisherAssociation for Computing Machinery
Pages42-51
Number of pages10
ISBN (Print)0897913760
StatePublished - 1 Mar 1991
Event2nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1991 - San Francisco, United States
Duration: 28 Jan 199130 Jan 1991

Publication series

NameProceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Conference

Conference2nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1991
Country/TerritoryUnited States
CitySan Francisco
Period28/01/9130/01/91

Bibliographical note

Publisher Copyright:
© 1991 Association for Computing Machinery. All rights reserved.

Fingerprint

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

Cite this