Advertisement

Algorithmica

, Volume 80, Issue 8, pp 2400–2421 | Cite as

Partial-Matching RMS Distance Under Translation: Combinatorics and Algorithms

  • Rinat Ben-Avraham
  • Matthias Henze
  • Rafel Jaume
  • Balázs Keszegh
  • Orit E. Raz
  • Micha Sharir
  • Igor Tubis
Article
  • 117 Downloads

Abstract

We consider the problem of minimizing the RMS distance (sum of squared distances between pairs of points) under translation between two point sets A and B, in the plane, with \(m=|B|\ll n=|A|\), in the partial-matching setup, in which each point in B is matched to a distinct point in A. Although the problem is not known to be polynomial, we establish several structural properties of the underlying subdivision \({\mathcal {D}}_{B,A}\) of the plane and derive improved bounds on its complexity. Specifically, we show that this complexity is \(O(n^2m^{3.5} (e \ln m+e)^m)\), so it is only quadratic in |A|. These results lead to the best known algorithm for finding a translation for which the partial-matching RMS distance between the point sets is minimized. In addition, we show how to compute a local minimum of the partial-matching RMS distance under translation, in polynomial time.

Keywords

Shape matching Partial matching RMS distance Convex subdivision Local minimum 

Notes

Acknowledgements

Rinat Ben-Avraham was supported by Grant 2012/229 from the U.S.-Israel Binational Science Foundation. Matthias Henze was supported by ESF EUROCORES programme EuroGIGA-VORONOI, (DFG): RO 2338/5-1. Rafel Jaume was supported by “Obra Social La Caixa” and the DAAD. Balázs Keszegh was supported by Hungarian National Science Fund (OTKA), under Grants PD 108406, NN 102029 (EUROGIGA project GraDR 10-EuroGIGA-OP-003), NK 78439, by the János Bolyai Research Scholarship of the Hungarian Academy of Sciences and by the DAAD. Orit E. Raz was supported by Grant 892/13 from the Israel Science Foundation. Micha Sharir was supported by Grant 2012/229 from the U.S.-Israel Binational Science Foundation, by Grant 892/13 from the Israel Science Foundation, by the Israeli Centers for Research Excellence (I-CORE) program (Center No. 4/11), and by the Hermann Minkowski–MINERVA Center for Geometry at Tel Aviv University. Igor Tubis was supported by the Deutsch Institute. A preliminary version of this paper has appeared in [5].

References

  1. 1.
    Abdulkadiroğlu, A., Sönmez, T.: Random serial dictatorship and the core from random endowments in house allocation problems. Econometrica 3, 689–701 (1998)MathSciNetCrossRefMATHGoogle Scholar
  2. 2.
    Agarwal, P.K., Phillips, J.M.: On bipartite matching under the RMS distance. In: Proceedings of 18th Canadian Conference on Computational Geometry (CCCG’06), pp. 143–146 (2006)Google Scholar
  3. 3.
    Asinowski, A., Keszegh, B., Miltzow, T.: Counting houses of pareto optimal matchings in the house allocation problem. In: Ferro, A., Luccio, F., Widmayer, P. (eds.) Fun with Algorithms. Lecture Notes in Computer Science, vol. 8496, pp. 301–312. Springer, Sicily, Italy (2014)Google Scholar
  4. 4.
    Balogh, J., Regev, O., Smyth, C., Steiger, W., Szegedy, M.: Long monotone paths in line arrangements. Discrete Comput. Geom. 32, 167–176 (2003)MathSciNetMATHGoogle Scholar
  5. 5.
    Ben-Avraham, R., Henze, M., Jaume, R., Keszegh, B., Raz, O.E., Sharir, M., Tubis, I.: Minimum partial matching and Hausdorff RMS-distance under translation: combinatorics and algorithms. In: Proceedings of 22nd European Symposium on Algorithms, pp. 100–111 (2014)Google Scholar
  6. 6.
    Clarkson, K.L., Shor, P.W.: Applications of random sampling in computational geometry, II. Discrete Comput. Geom. 4, 387–421 (1989)MathSciNetCrossRefMATHGoogle Scholar
  7. 7.
    de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry, Algorithms and Applications. Springer, Berlin (1997); second edition (2000)Google Scholar
  8. 8.
    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, Berlin (2013)CrossRefGoogle Scholar
  9. 9.
    Edmonds, J., Karp, R.M.: Theoretical improvements in algorithmic efficiency for network flow problems. J. ACM 19, 248–264 (1972)CrossRefMATHGoogle Scholar
  10. 10.
    Fredman, M.L., Tarjan, R.E.: Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM 34, 596–615 (1987)MathSciNetCrossRefGoogle Scholar
  11. 11.
    Henze, M., Jaume, R., Keszegh, B.: On the complexity of the partial least-squares matching Voronoi diagram. In: Proceedings of 29th European Workshop on Computational Geometry (EuroCG’13) (2013)Google Scholar
  12. 12.
    Jung, I., Lacroix, S.: A robust interest points matching algorithm. In: Proceedings of ICCV’01, vol. 2, pp. 538–543 (2001)Google Scholar
  13. 13.
    Kuhn, H.W.: The Hungarian method for the assignment problem. Naval Res. Logist. Q. 2(1–2), 83–97 (1955)MathSciNetCrossRefMATHGoogle Scholar
  14. 14.
    Ramshaw, L., Tarjan, R.E.: A weight-scaling algorithm for min-cost imperfect matchings in bipartite graphs. In: Proceedings of 53rd Annual IEEE Symposium on Foundations of Computer Science, pp. 581–590 (2012)Google Scholar
  15. 15.
    Rote, G.: Partial least-squares point matching under translations. In: Proceedings of 26th European Workshop on Computational Geometry (EuroCG’10), pp. 249–251 (2010)Google Scholar
  16. 16.
    Rote, G.: Long monotone paths in convex subdivisions. In: Proceedings of 27th European Workshop on Computational Geometry (EuroCG’11), pp. 183–184 (2011)Google Scholar
  17. 17.
    Shapley, L.S., Scarf, H.: On cores and indivisibility. J. Math. Econ. 1, 23–37 (1974)MathSciNetCrossRefMATHGoogle Scholar
  18. 18.
    Umeyama, S.: Least-squares estimation of transformation parameters between two point patterns. IEEE Trans. Pattern Anal. Mach. Intell. 13(4), 376–380 (1991)CrossRefGoogle Scholar
  19. 19.
    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, Amsterdam (1992)Google Scholar

Copyright information

© Springer Science+Business Media New York 2017

Authors and Affiliations

  1. 1.School of Computer ScienceTel Aviv UniversityTel AvivIsrael
  2. 2.Institut für MathematikFreie Universität BerlinBerlinGermany
  3. 3.Institut für InformatikFreie Universität BerlinBerlinGermany
  4. 4.Alfréd Rényi Institute of MathematicsHungarian Academy of SciencesBudapestHungary

Personalised recommendations