Abstract
We consider the RMS-distance (sum of squared distances between pairs of points) under translation between two point sets in the plane. In the Hausdorff setup, each point is paired to its nearest neighbor in the other set. We develop algorithms for finding a local minimum in near-linear time on the line, and in nearly quadratic time in the plane. These improve substantially the worst-case behavior of the popular ICP heuristics for solving this problem. In the partial-matching setup, each point in the smaller set is matched to a distinct point in the bigger set. Although the problem is not known to be polynomial, we establish several structural properties of the underlying subdivision of the plane and derive improved bounds on its complexity. In addition, we show how to compute a local minimum of the partial-matching RMS-distance under translation, in polynomial time.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Agarwal, P.K., Har-Peled, S., Sharir, M., Wang, Y.: Hausdorff distance under translation for points, disks, and balls. ACM Trans. on Algorithms 6, 1–26 (2010)
Asinowski, A., Keszegh, B., Miltzow, T.: Counting houses of Pareto optimal matchings in the House Allocation Problem, arXiv:1401.5354v2
Besl, P.J., McKay, N.D.: A method for registration of 3-d shapes. IEEE Trans. Pattern Anal. Mach. Intell. 14, 239–256 (1992)
Cole, R., Salowe, J., Steiger, W., Szemerédi, E.: An optimal-time algorithm for slope selection. SIAM J. Comput. 18, 792–810 (1989)
Dumitrescu, A., Rote, G., Tóth, C.D.: Monotone paths in planar convex subdivisions and polytopes. In: Bezdek, K., Deza, A., Ye, Y. (eds.) Discrete Geometry and Optimization. Fields Institute Communications, vol. 69, pp. 79–104. Springer (2013)
Edmonds, J., Karp, R.M.: Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems. J. ACM 19(2), 248–264 (1972)
Ezra, E., Sharir, M., Efrat, A.: On the ICP Algorithm. Comput. Geom. Theory Appl. 41, 77–93 (2008)
Henze, M., Jaume, R., Keszegh, B.: On the complexity of the partial least-squares matching Voronoi diagram. In: Proc. 29th European Workshop Comput. Geom (EuroCG 2013), pp. 193–196 (2013)
Jung, I., Lacroix, S.: A robust interest points matching algorithm. In: Proc. ICCV 2001, vol. 2, pp. 538–543 (2001)
Kuhn, H.W.: The Hungarian method for the assignment problem. Naval Research Logistics Quarterly 2(1-2), 83–97 (1955)
Phillips, J.M., Agarwal, P.K.: On bipartite matching under the RMS distance. In: Proc. 18th Canadian Conf. Comput. Geom (CCCG 2006), pp. 143–146 (2006)
Rote, G.: Partial least-squares point matching under translations. In: Proc. 26th European Workshop Comput. Geom (EuroCG 2010), pp. 249–251 (2010)
Rote, G.: Long monotone paths in convex subdivisions. In: Proc. 27th European Workshop Comput. Geom. (EuroCG 2011), pp. 183–184 (2011)
Shapley, L.S., Scarf, H.: On cores and indivisibility. J. Math. Economics 1, 23–37 (1974)
Umeyama, S.: Least-squares estimation of transformation parameters between two point patterns. IEEE Trans. Pattern Anal. Mach. Intell. 13(4), 376–380 (1991)
Zikan, K., Silberberg, T.M.: The Frobenius metric in image registration. In: Shapiro, L., Rosenfeld, A. (eds.) Computer Vision and Image Processing, pp. 385–420. Elsevier (1992)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ben-Avraham, R. et al. (2014). Minimum Partial-Matching and Hausdorff RMS-Distance under Translation: Combinatorics and Algorithms. In: Schulz, A.S., Wagner, D. (eds) Algorithms - ESA 2014. ESA 2014. Lecture Notes in Computer Science, vol 8737. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-44777-2_9
Download citation
DOI: https://doi.org/10.1007/978-3-662-44777-2_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-44776-5
Online ISBN: 978-3-662-44777-2
eBook Packages: Computer ScienceComputer Science (R0)