Skip to main content

Evaluating Melodic Segmentation

  • Conference paper
  • First Online:
Music and Artificial Intelligence (ICMAI 2002)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 2445))

Included in the following conference series:

Abstract

We discuss why evaluating melodic segmentation is difficult when solutions are ambiguous and explore the nature of this ambiguity using a corpus of melodies hand-segmented by musicians. For each melody, the musicians identified different, musically coherent solutions, suggesting that ambiguity should be modeled when assessing how “well” an algorithm segments the same melody. We propose a probabilistic framework for modeling ambiguity that integrates both the segment boundaries and the lengths that the musicians preferred. The framework gives rise to several potential extensions of existing segmentation algorithms.

Author ordering was determined by stochastic simulation.

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

  • R. Bellman (1957). Dynamic Programming. Princeton University Press.

    Google Scholar 

  • C. M. Bishop (1995). Neural Networks for Pattern Recognition. Clarendon Press.

    Google Scholar 

  • R. Bod (2001). Memory-based models of melodic analysis: challenging the gestalt principles. Journal of New Music Research, 30(3):In Press.

    Google Scholar 

  • E. Cambouropoulos (1998). Musical Parallelism and Melodic Segmentation. In Proceedings of the XII Colloquium on Musical Informatics, Gorizia, Italy, pages 111–114.

    Google Scholar 

  • E. Cambouropoulos (2001). The Local Boundary Detection Model (LBDM) and its application in the study of expressive timing. In: Proceedings of the International Computer Music Conference (ICMC), Havana, Cuba, pages 290–293.

    Google Scholar 

  • T. Crawford, C. S. Iliopoulos, and R. Raman (1998). String-matching techniques for musical similarity and melodic recognition. In: W. B. Hewlett and E. Selfridge-Field, editors, Melodic Similarity: Concepts, Procedures, and Applications, pages 73–100. MIT Press.

    Google Scholar 

  • K. Höthker, B. Thom, and C. Spevak (2002). Melodic segmentation: evaluating the performance of algorithms and musicians. Technical Report 2002-3, Faculty of Computer Science, University of Karlsruhe.

    Google Scholar 

  • F. Lerdahl and R. Jackendo.(1983). A Generative Theory of Tonal Music. MIT Press.

    Google Scholar 

  • H. Schaffrath (1995). The Essen Folksong Collection. D. Huron, editor. Center for Computer Assisted Research in the Humanities, Stanford, California.

    Google Scholar 

  • D. Temperley (2001). The Cognition of Basic Musical Structures. MIT Press.

    Google Scholar 

  • B. Thom, C. Spevak, and K. Höthker (2002). Melodic segmentation: evaluating the performance of algorithms and musical experts. Submitted to the International Computer Music Conference.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Spevak, C., Thom, B., Höthker, K. (2002). Evaluating Melodic Segmentation. In: Anagnostopoulou, C., Ferrand, M., Smaill, A. (eds) Music and Artificial Intelligence. ICMAI 2002. Lecture Notes in Computer Science(), vol 2445. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45722-4_16

Download citation

  • DOI: https://doi.org/10.1007/3-540-45722-4_16

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-44145-8

  • Online ISBN: 978-3-540-45722-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics