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

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

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 - http://www.scopus.com/inward/record.url?scp=0242344341&partnerID=8YFLogxK

M3 - Conference contribution

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 -