TY - JOUR
T1 - Matching points into pairwise-disjoint noise regions
T2 - combinatorial bounds and algorithms
AU - Arkin, Esther M.
AU - Kedem, Klara
AU - Mitchell, Joseph S.B.
AU - Sprinzak, Josef
AU - Werman, Michael
PY - 1992
Y1 - 1992
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 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.
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 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.
UR - http://www.scopus.com/inward/record.url?scp=0026922955&partnerID=8YFLogxK
U2 - 10.1287/ijoc.4.4.375
DO - 10.1287/ijoc.4.4.375
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:0026922955
SN - 0899-1499
VL - 4
SP - 375
EP - 386
JO - ORSA journal on computing
JF - ORSA journal on computing
IS - 4
ER -