Matching points into noise regions: Combinatorial bounds and algorithms

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

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 proceeding › Conference contribution › peer-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 language	English
Title of host publication	Proceedings of the 2nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1991
Publisher	Association for Computing Machinery
Pages	42-51
Number of pages	10
ISBN (Print)	0897913760
State	Published - 1 Mar 1991
Event	2nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1991 - San Francisco, United States Duration: 28 Jan 1991 → 30 Jan 1991

Publication series

Name	Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Conference

Conference	2nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1991
Country/Territory	United States
City	San Francisco
Period	28/01/91 → 30/01/91

Bibliographical note

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

Cite this

@inproceedings{f6d991acc8a44b12af0288dc8465212a,

title = "Matching points into noise regions: Combinatorial bounds and algorithms",

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

author = "Arkin, \{Esther M.\} and Klara Kedem and Mitchell, \{Joseph S.B.\} and Josef Sprinzak and Michael Werman",

note = "Publisher Copyright: {\textcopyright} 1991 Association for Computing Machinery. All rights reserved.; 2nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1991 ; Conference date: 28-01-1991 Through 30-01-1991",

year = "1991",

month = mar,

day = "1",

language = "אנגלית",

isbn = "0897913760",

series = "Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms",

publisher = "Association for Computing Machinery",

pages = "42--51",

booktitle = "Proceedings of the 2nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1991",

}

Arkin, EM, Kedem, K, Mitchell, JSB, Sprinzak, J & Werman, M 1991, Matching points into noise regions: Combinatorial bounds and algorithms. in Proceedings of the 2nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1991. Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, Association for Computing Machinery, pp. 42-51, 2nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1991, San Francisco, United States, 28/01/91.

Matching points into noise regions: Combinatorial bounds and algorithms. / Arkin, Esther M.; Kedem, Klara; Mitchell, Joseph S.B. et al.
Proceedings of the 2nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1991. Association for Computing Machinery, 1991. p. 42-51 (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Matching points into noise regions

T2 - 2nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1991

AU - Arkin, Esther M.

AU - Kedem, Klara

AU - Mitchell, Joseph S.B.

AU - Sprinzak, Josef

AU - Werman, Michael

PY - 1991/3/1

Y1 - 1991/3/1

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

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

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

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:0242344341

SN - 0897913760

T3 - Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

SP - 42

EP - 51

BT - Proceedings of the 2nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1991

PB - Association for Computing Machinery

Y2 - 28 January 1991 through 30 January 1991

ER -

Matching points into noise regions: Combinatorial bounds and algorithms

Abstract

Publication series

Conference

Bibliographical note

Other files and links

Fingerprint

Cite this