4 search results - page 1 / 1 » On Bipartite Matching under the RMS Distance |
CCCG
2006
13 years 6 months ago
2006
Given two sets A and B of n points each in R2 , we study the problem of computing a matching between A and B that minimizes the root mean square (rms) distance of matched pairs. W...
GBRPR
2007
Springer
13 years 11 months ago
2007
Springer
In the field of structural pattern recognition graphs constitute a very common and powerful way of representing patterns. In contrast to string representations, graphs allow us to ...
ESA
2005
Springer
13 years 10 months ago
2005
Springer
Let A and B be two sets of m resp. n weighted points in the plane, with m ≤ n. We present (1 + ) and (2+ )-approximation algorithms for the minimum Euclidean Earth Mover’s Dis...
COMPGEOM
2006
ACM
13 years 6 months ago
2006
ACM
We present upper and lower bounds for the number of iterations performed by the Iterative Closest Point (ICP) algorithm. This algorithm has been proposed by Besl and McKay [4] as ...