Graphs and Combinatorics

, Volume 23, Supplement 1, pp 169–178 | Cite as

Efficient Many-To-Many Point Matching in One Dimension

  • Justin Colannino
  • Mirela Damian
  • Ferran Hurtado
  • Stefan Langerman
  • Henk Meijer
  • Suneeta Ramaswami
  • Diane Souvaine
  • Godfried Toussaint
Article
Received:
Accepted:

Abstract

Let S and T be two sets of points with total cardinality n. The minimum-cost many-to-many matching problem matches each point in S to at least one point in T and each point in T to at least one point in S, such that sum of the matching costs is minimized. Here we examine the special case where both S and T lie on the line and the cost of matching s ∈S to t ∈T is equal to the distance between s and t. In this context, we provide an algorithm that determines a minimum-cost many-to-many matching in O(n log n) time, improving the previous best time complexity of O(n2) for the same problem.

Keywords

Match Problem Point Match Maximal Subset Match Cost Music Information Retrieval 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ben-Dor, A., Karp, R. M., Schwikowski, B., Shamir, R.: The restriction scaffold problem. J. Comput. Biol. 10(2), 385–398 (2003)Google Scholar
  2. Burkard, R. E., Çela, E.: Linear assignment problems and extensions. In: Du, D.-Z., Pardalos, P. M. (eds.): Handbook of Combinatorial Optimization—Supplement, vol. A, vol. 4, pp. 75–149. Kluwer, Dordrecht (1999)Google Scholar
  3. Buss, S. R., Yianilos, P. N.: A bipartite matching approach to approximate string comparison and search. Technical report, NEC Research Institute, Princeton, New Jersey (1995)Google Scholar
  4. Colannino, J., Damian, M., Hurtado, F., Iacono, J., Meijer, H., Ramaswami, S., Toussaint, G.: A O(n log n)-time algorithm for the restricted scaffold assignment problem. J. Comput. Biol. 13(4) (2006)Google Scholar
  5. Colannino, J., Toussaint, G.: Faster algorithms for computing distances between one-dimensional point sets. In: Santos, F., Orden, D. (eds.) Proceedings of the XI Encuentros de Geometria Computacional, pp. 189–198, Santander, Spain, June 27–29 (2005)Google Scholar
  6. Colannino, J., Toussaint, G.: An algorithm for computing the restriction scaffold assignment problem in computational biology. Inf. Proces. Lett. 95(4), 466–471 (2005)Google Scholar
  7. Colannino, J., Toussaint, G.: A faster algorithm for computing the link distance between two point sets on the real line. Technical Report SOCS-TR-2005.5, McGill University, School of Computer Science, July (2005)Google Scholar
  8. Demirci, M.F., Shokoufandeh, A., Keselman, Y., Bretzner, L., Dickinson, S.: Object recognition as many-to-many feature matching. Int. J. Comput. Visi. 69(2), 203–222 (2006)Google Scholar
  9. Edmonds, J., Karp, R.M.: Theoretical improvements in algorithmic efficiency for network flow problems. J. Assoc. Comput. Mach. 19, 248–264 (1972)Google Scholar
  10. Efrat, A., Itai, A., Katz, M.J.: Geometry helps in bottleneck matching and related problems. Algorithmica. 31, 1–28 (2001)Google Scholar
  11. Eiter, T., Mannila, H.: Distance measures for point sets and their computation. Acta Inf. 34(2), 109–133 (1997)Google Scholar
  12. Fredman, M.L., Tarjan, R.E.: Fibonacci heaps and their uses in improved network optimization algorithms. J. Assoc. Comput. Mach. 34, 596–615 (1987)Google Scholar
  13. Karp, R.M., Li, S.-Y.R.: Two special cases of the assignment problem. Discrete Math. 13(46), 129–142 (1975)Google Scholar
  14. Keijsper, J., Pendavingh, R.: An efficient algorithm for minimum-weight bibranching. J. Combin. Theory 73(Series B), 130–145 (1998)Google Scholar
  15. Keith, M.: From polychords to polya: adventures in musical combinatorics. Vinculum Press, Princeton (1991)Google Scholar
  16. Marcotte, O., Suri, S.: Fast matching algorithms for points on a polygon. SIAM J. Comput. 20, 405–422 (1991)Google Scholar
  17. Schrijver, A.: Min-max relations for directed graphs. Ann. Discrete Math. 16, 261–280 (1982)Google Scholar
  18. Tenney, J., Polansky, L.: Temporal gestalt perception in music. J. Music Theory 24(2), 205–241 Autumn (1980)Google Scholar
  19. Tomizawa, N.: On some techniques useful for the solution of transportation network problems. Networks 1, 173–194 (1972)Google Scholar
  20. Toussaint, G.T.: A comparison of rhythmic similarity measures. In: Proceedings of the 5th International Conference on Music Information Retrieval, pp. 242–245, Barcelona, Spain, October 10–14 2004. Universitat Pompeu FabraGoogle Scholar
  21. Toussaint, G. T.: The geometry of musical rhythm. In: Proceedings of the Japan Conference on Discrete and Computational Geometry, volume LNCS 3742, pp. 198–212, Springer, Heidelberg (2005)Google Scholar
  22. Vaidya, P. M.: Geometry helps in matching. SIAM J. Comput. 18, 1201–1225 (1989)Google Scholar

Copyright information

© Springer-Verlag Tokyo 2007

Authors and Affiliations

  • Justin Colannino
    • 1
  • Mirela Damian
    • 2
  • Ferran Hurtado
    • 3
  • Stefan Langerman
    • 4
  • Henk Meijer
    • 5
  • Suneeta Ramaswami
    • 6
  • Diane Souvaine
    • 7
  • Godfried Toussaint
    • 8
  1. 1.School of Computer ScienceMcGill UniversityMontrealCanada
  2. 2.Department of Computer ScienceVillanova UniversityVillanovaUSA
  3. 3.Departament de Matemàtica Aplicada IIUniversitat Politècnica de CatalunyaBarcelonaSpain
  4. 4.Chercheur qualifié du FNRS, Département d’ InformatiqueUniversité Libre de BruxellesBrusselsBelgium
  5. 5.School of ComputingQueen’s UniversityKingstonCanada
  6. 6.Department of Computer ScienceRutgers UniversityCamdenUSA
  7. 7.Department of Computer ScienceTufts UniversityMedfordUSA
  8. 8.School of Computer Science and Centre for Interdisciplinary Research in Music Media and Technology (CIRMMT), The Schulich School of MusicMcGill UniversityMontrealCanada

Personalised recommendations