Skip to main content

Error-Tolerant Content-Based Music-Retrieval with Mathematical Morphology

  • Conference paper
Book cover Exploring Music Contents (CMMR 2010)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 6684))

Included in the following conference series:

Abstract

In this paper, we show how to apply the framework of mathematical morphology (MM) in order to improve error-tolerance in content-based music retrieval (CBMR) when dealing with approximate retrieval of polyphonic, symbolically encoded music. To this end, we introduce two algorithms based on the MM framework and carry out experiments to compare their performance against well-known algorithms earlier developed for CBMR problems. Although, according to our experiments, the new algorithms do not perform quite as well as the rivaling algorithms in a typical query setting, they provide ease of adjusting the desired error tolerance. Moreover, in certain settings the new algorithms become even faster than their existing counterparts.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Barrera Hernández, A.: Finding an o(n2 log n) algorithm is sometimes hard. In: Proceedings of the 8th Canadian Conference on Computational Geometry, pp. 289–294. Carleton University Press, Ottawa (1996)

    Google Scholar 

  2. Bloomberg, D., Maragos, P.: Generalized hit-miss operators with applications to document image analysis. In: SPIE Conference on Image Algebra and Morphological Image Processing, pp. 116–128 (1990)

    Google Scholar 

  3. Bloomberg, D., Vincent, L.: Pattern matching using the blur hit-miss transform. Journal of Electronic Imaging 9(2), 140–150 (2000)

    Article  Google Scholar 

  4. Clausen, M., Engelbrecht, R., Meyer, D., Schmitz, J.: Proms: A web-based tool for searching in polyphonic music. In: Proceedings of the International Symposium on Music Information Retrieval (ISMIR 2000), Plymouth, MA (October 2000)

    Google Scholar 

  5. Clifford, R., Christodoulakis, M., Crawford, T., Meredith, D., Wiggins, G.: A fast, randomised, maximal subset matching algorithm for document-level music retrieval. In: Proceedings of the 7th International Conference on Music Information Retrieval (ISMIR 2006), Victoria, BC, Canada, pp. 150–155 (2006)

    Google Scholar 

  6. Heijmans, H.: Mathematical morphology: A modern approach in image processing based on algebra and geometry. SIAM Review 37(1), 1–36 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  7. Hu, N., Dannenberg, R., Tzanetakis, G.: Polyphonic audio matching and alignment for music retrieval. In: Proc. IEEE WASPAA, pp. 185–188 (2003)

    Google Scholar 

  8. Karvonen, M., Lemström, K.: Using mathematical morphology for geometric music information retrieval. In: International Workshop on Machine Learning and Music (MML 2008), Helsinki, Finland (2008)

    Google Scholar 

  9. Lemström, K.: Towards more robust geometric content-based music retrieval. In: Proceedings of the 11th International Society for Music Information Retrieval Conference (ISMIR 2010), Utrecht, pp. 577–582 (2010)

    Google Scholar 

  10. Lemström, K., Mikkilä, N., Mäkinen, V.: Filtering methods for content-based retrieval on indexed symbolic music databases. Journal of Information Retrieval 13(1), 1–21 (2010)

    Article  Google Scholar 

  11. Lubiw, A., Tanur, L.: Pattern matching in polyphonic music as a weighted geometric translation problem. In: Proceedings of the 5th International Conference on Music Information Retrieval (ISMIR 2004), Barcelona, pp. 289–296 (2004)

    Google Scholar 

  12. Romming, C., Selfridge-Field, E.: Algorithms for polyphonic music retrieval: The hausdorff metric and geometric hashing. In: Proceedings of the 8th International Conference on Music Information Retrieval (ISMIR 2007), Vienna, Austria (2007)

    Google Scholar 

  13. Typke, R.: Music Retrieval based on Melodic Similarity. Ph.D. thesis, Utrecht University, Netherlands (2007)

    Google Scholar 

  14. Ukkonen, E., Lemström, K., Mäkinen, V.: Geometric algorithms for transposition invariant content-based music retrieval. In: Proceedings of the 4th International Conference on Music Information Retrieval (ISMIR 2003), Baltimore, MA, pp. 193–199 (2003)

    Google Scholar 

  15. Wiggins, G.A., Lemström, K., Meredith, D.: SIA(M)ESE: An algorithm for transposition invariant, polyphonic content-based music retrieval. In: Proceedings of the 3rd International Conference on Music Information Retrieval (ISMIR 2002), Paris, France, pp. 283–284 (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Karvonen, M., Laitinen, M., Lemström, K., Vikman, J. (2011). Error-Tolerant Content-Based Music-Retrieval with Mathematical Morphology. In: Ystad, S., Aramaki, M., Kronland-Martinet, R., Jensen, K. (eds) Exploring Music Contents. CMMR 2010. Lecture Notes in Computer Science, vol 6684. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23126-1_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-23126-1_20

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-23125-4

  • Online ISBN: 978-3-642-23126-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics