Skip to main content

Classifying Polyphony Music Based on Markov Model

  • Conference paper
Book cover Intelligent Data Engineering and Automated Learning – IDEAL 2006 (IDEAL 2006)

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

Abstract

In this investigation we propose a novel approach for classifying polyphonic melodies. Our main idea comes from Probability Stochastic Processes using Markov models where the characteristic features of polyphonic melodies are extracted from each bar. The similarity among harmonies can be considered by means of the features. We show the effectiveness and the usefulness of the approach by experimental results.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Dowaisamy, S., Ruger, S.M.: A comparative and fault-tolerance study of the use of n-gram with polyphonic music. In: ISMIR 2002, pp. 101–116 (2002)

    Google Scholar 

  2. Dowling, W.J.: Scale and Contour – two components of a theory of memory for melodies. Psychological Reviews 85(4), 341–354 (1978)

    Article  Google Scholar 

  3. Grossman, D., Frieder, O.: Information Retrieval – Algorithms and Heuristics. Kluwer Academic Press, Dordrecht (1998)

    MATH  Google Scholar 

  4. Ishigeta, M., et al.: Theory of Music, Ongaku-No-Tomo-Sha, (2001) (in Japanese )

    Google Scholar 

  5. Iwasaki, M.: Foundation of Incmplete Data Analysis, Economicst Sha (2002) (in Japanese)

    Google Scholar 

  6. Kim, Y., et al.: Analysis of A Contour-based Representation for Melody. In: Intn’l Symp. on Music Information Retrieval, ISMIR (2000)

    Google Scholar 

  7. Miura, T., Shioya, I.: Similarities among Melodies for Music Information Retrieval. In: ACM Conf. on Information and Knowledge Management, CIKM (2003)

    Google Scholar 

  8. Pickens, J.: A Comparison of Language Modelling and Probabilistic Text Information Retrieval Approaches to Monophonic Music Retrieval. In: Intn’l Symp. on Music Information Retrieval, ISMIR (2000)

    Google Scholar 

  9. Pickens, J., Crawford, T.: Harmonic Models for Polyphonic Music Retrieval. In: ACM Conf. on Information and Knowledge Management (CIKM) (2002)

    Google Scholar 

  10. Uitdenbogerd, A.L., et al.: Manipulation of Music For Melody Matching. In: ACM MultiMedia Conf. (1998)

    Google Scholar 

  11. Uitdenbogerd, A.L., et al.: Matching Techniques for Large Music Databases. In: ACM Multimedia Conf. (1999)

    Google Scholar 

  12. Walshaw, C.: abc Ver.1.6, http://www.gre.ac.uk/~c.walshaw/abc2mtex/abc.txt

  13. Yoshihara, Y., Miura, T.: Melody Classification Using EM Algorithm. In: COMPSAC, pp. 204–210 (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yoshihara, Y., Miura, T. (2006). Classifying Polyphony Music Based on Markov Model. In: Corchado, E., Yin, H., Botti, V., Fyfe, C. (eds) Intelligent Data Engineering and Automated Learning – IDEAL 2006. IDEAL 2006. Lecture Notes in Computer Science, vol 4224. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11875581_84

Download citation

  • DOI: https://doi.org/10.1007/11875581_84

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-45485-4

  • Online ISBN: 978-3-540-45487-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics