Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

Time-Span Tree Leveled by Duration of Time-Span

  • Conference paper
  • First Online:
Music in the AI Era (CMMR 2021)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 13770 ))

Included in the following conference series:

  • 519 Accesses

Abstract

This paper describes a time-span tree leveled by the length of the time span. Using the time-span tree of the Generative Theory of Tonal Music, it is possible to reduce notes in a melody, but it is difficult to automate because the priority order of the branches to be reduced is not defined. A similar problem arises in the automation of time-span analysis and melodic morphing. Therefore, we propose a method for defining the priority order in total order in accordance with the length of the time span of each branch in a time-span tree. In the experiment, we confirmed that melodic morphing and deep learning of time-span tree analysis can be carried out automatically using the proposed method.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 64.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 84.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

References

  1. Amari, S., Ozeki, T., Karakida, R., Yoshida, Y., Okada, M.: Dynamics of learning in MLP: natural gradient and singularity revisited. Neural Comput. 30(1), 1–33 (2018)

    Article  MathSciNet  MATH  Google Scholar 

  2. Hamanaka, M., Hirata, K., Tojo, S.: ATTA: automatic time-span tree analyzer based on extended GTTM. In: Proceedings of the 6th International Conference on Music Information Retrieval Conference (ISMIR 2005), pp. 358–365 (2005)

    Google Scholar 

  3. Hamanaka, M., Hirata, K., Tojo, S.: Melody morphing method based on GTTM. In: Proceedings of International Computer Music Conference (ICMC 2008), pp. 155–158 (2008)

    Google Scholar 

  4. Hamanaka, M., Hirata, K., Tojo, S.: Melody extrapolation in GTTM approach. In: Proceedings of International Computer Music Conference (ICMC 2009), pp. 89–92 (2009)

    Google Scholar 

  5. Hamanaka, M., Hirata, K., Tojo, S.: Musical structural analysis database based on GTTM. In: Proceedings of the 15th International Conference on Music Information Retrieval Conference (ISMIR 2014), pp. 107–112 (2014)

    Google Scholar 

  6. Hamanaka, M., Hirata, K., Tojo, S.: \(\sigma \)GTTM III: learning-based time-span tree generator based on PCFG. In: Proceedings of International Symposium on Computer Music Multidisciplinary Research (CMMR 2015), pp. 387–404 (2015)

    Google Scholar 

  7. Hamanaka, M., Hirata, K., Tojo, S.: deepGTTM-I: local boundaries analyzer based on deep learning technique. In: Proceedings of International Symposium on Computer Music Multidisciplinary Research (CMMR 2016), pp. 8–20 (2016)

    Google Scholar 

  8. Hamanaka, M., Hirata, K., Tojo, S.: deepGTTM-II: automatic generation of metrical structure based on deep learning technique. In: Proceedings of the 13th Sound and Music Conference (SMC 2016), pp. 221–249 (2016)

    Google Scholar 

  9. Hamanaka, M.: Melody Slot Machine. https://gttm.jp/hamanaka/en/melodyslotmachine/. Accessed 25 Oct 2022

  10. Hochreiter, S., Schmidhuber, J.: Long short-term memory. Neural Comput. 9(8), 1735–1780 (1997)

    Article  Google Scholar 

  11. Lerdahl, F., Jackendoff, R.: A Generative Theory of Tonal Music. The MIT Press, Cambridge (1985)

    Google Scholar 

  12. Marsden, A., Tojo, S., Hirata, K.: No longer ‘somewhat arbitrary’: calculating salience in GTTM-style reduction. In: Proceedings of the 5th International Conference on Digital Libraries for Musicology (DLfM 2018), pp. 26–33 (2018)

    Google Scholar 

  13. Nvidia: Quadro for laptops. https://www.nvidia.com/en-us/design-visualization/quadro-in-laptops/. Accessed 25 Oct 2022

  14. Pineda, J.F.: Generalization of back-propagation to recurrent neural networks. Phys. Rev. Lett. 19(59), 2229–2232 (1987)

    Article  MathSciNet  Google Scholar 

  15. Sutskever, I., Vinyals, O., Le, V.Q.: Sequence to sequence learning with neural networks. In: Advances in Neural Information Processing Systems, vol. 27, pp. 3104–3112 (2014)

    Google Scholar 

  16. Vaswani, A., et al.: Attention is all you need. In: Proceedings of the 31st Conference on Neural Information Processing Systems (NIPS 2017), vol. 30, pp. 6000–6010 (2017)

    Google Scholar 

Download references

Acknowledgements

This work was supported by JSPS KAKENHI Grant number 21H03572.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Masatoshi Hamanaka .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2023 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Hamanaka, M., Hirata, K., Tojo, S. (2023). Time-Span Tree Leveled by Duration of Time-Span. In: Aramaki, M., Hirata, K., Kitahara, T., Kronland-Martinet, R., Ystad, S. (eds) Music in the AI Era. CMMR 2021. Lecture Notes in Computer Science, vol 13770 . Springer, Cham. https://doi.org/10.1007/978-3-031-35382-6_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-35382-6_5

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-35381-9

  • Online ISBN: 978-3-031-35382-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics