Skip to main content

Understanding and Compressing Music with Maximal Transformable Patterns

  • Conference paper
  • First Online:
Culture and Computing (HCII 2023)

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

Included in the following conference series:

Abstract

We present a polynomial-time algorithm that discovers all maximal patterns in a point set, \(D\subset \mathbb {R}^k\), that are related by transformations in a user-specified class, \(F\), of bijections over \(\mathbb {R}^k\). We also present a second algorithm that discovers the set of occurrences for each of these maximal patterns and then uses compact encodings of these occurrence sets to compute a losslessly compressed encoding of the input point set. This encoding takes the form of a set of pairs, \(E=\left\{ \left\langle P_1, T_1\right\rangle ,\left\langle P_2, T_2\right\rangle ,\ldots \left\langle P_{\ell }, T_{\ell }\right\rangle \right\} \), where each \(\langle P_i,T_i\rangle \) consists of a maximal pattern, \(P_i\subseteq D\), and a set, \(T_i\subset F\), of transformations that map \(P_i\) onto other subsets of \(D\). Each transformation is encoded by a vector of real values that uniquely identifies it within \(F\) and the length of this vector is used as a measure of the complexity of \(F\). We evaluate the new compression algorithm with three transformation classes of differing complexity, on the task of classifying folk-song melodies into tune families. The most complex of the classes tested includes all combinations of the musical transformations of transposition, inversion, retrograde, augmentation and diminution. We found that broadening the transformation class improved performance on this task. However, it did not, on average, improve compression factor, which may be due to the datasets (in this case, folk-song melodies) being too short and simple to benefit from the potentially greater number of pattern relationships that are discoverable with larger transformation classes.

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

Access this chapter

Subscribe and save

Springer+ Basic
EUR 32.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 84.99
Price excludes VAT (USA)
  • Available as EPUB and 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

References

  1. Collins, T.: Improved methods for pattern discovery in music, with applications in automated stylistic composition, Ph. D. thesis, Faculty of Mathematics, Computing and Technology, The Open University, Milton Keynes (2011). http://oro.open.ac.uk/30103/4/TomCthesisEV.pdf

  2. Collins, T., Arzt, A., Flossmann, S., Widmer, G.: SIARCT-CFP: Improving precision and the discovery of inexact musical patterns in point-set representations. In: 14th ISMIR Conference (ISMIR 2013), pp. 549–554. Curitiba, Brazil (2013). https://archives.ismir.net/ismir2013/paper/000161.pdf

  3. Collins, T., Arzt, A., Frostel, H., Widmer, G.: Using geometric symbolic fingerprinting to discover distinctive patterns in polyphonic music corpora. In: Computational Music Analysis, pp. 445–474. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-25931-4_17

    Chapter  MATH  Google Scholar 

  4. Collins, T., Thurlow, J., Laney, R., Willis, A., Garthwaite, P.H.: A comparative evaluation of algorithms for discovering translational patterns in baroque keyboard works. In: Proceedings of the 11th ISMIR Conference, pp. 3–8. Utrecht, The Netherlands (2010). https://archives.ismir.net/ismir2010/paper/000002.pdf

  5. Collins, T., Volk, A., Janssen, B., Ren, I.: MIREX task on discovery of repeated themes & sections (2013–2017). https://www.music-ir.org/mirex/wiki/2017:Discovery_of_Repeated_Themes_%26_Sections

  6. Forth, J.C.: Cognitively-motivated geometric methods of pattern discovery and models of similarity in music, Ph. D. thesis, Department of Computing, Goldsmiths, University of London (2012). http://research.gold.ac.uk/id/eprint/7803/

  7. Grijp, L.P.: Introduction. In: Grijp, L.P., van Beersum, I. (eds.) Under the Green Linden–163 Dutch Ballads from the Oral Tradition, pp. 18–27. Meertens Institute/Music & Words (2008)

    Google Scholar 

  8. van Kranenburg, P., Volk, A., Wiering, F.: A comparison between global and local features for computational classification of folk song melodies. J. New Music Res. 42(1), 1–18 (2013)

    Article  Google Scholar 

  9. Laaksonen, A., Lemström, K.: On the memory usage of the SIA algorithm family for symbolic music pattern discovery. In: Montiel, M., Agustin-Aquino, O.A., Gomez, F., Kastine, J., Lluis-Puebla, E., Milam, B. (eds.) Mathematics and Computation in Music. MCM 2022. Lecture Notes in Computer Science, vol. 13267. Springer, Cham (2022). https://doi.org/10.1007/978-3-031-07015-0_15

  10. Li, M., Chen, X., Li, X., Ma, B., Vitányi, P.M.B.: The similarity metric. IEEE Trans. Inf. Theory 50(12), 3250–3264 (2004). https://ieeexplore.ieee.org/document/1362909

  11. Meredith, D.: The ps13 pitch spelling algorithm. J. New Music Res. 35(2), 121–159 (2006). https://doi.org/10.1080/09298210600834961

    Article  MathSciNet  Google Scholar 

  12. Meredith, D.: COSIATEC and SIATECCompress: pattern discovery by geometric compression. In: MIREX 2013 (Competition on Discovery of Repeated Themes & Sections) (2013). https://www.music-ir.org/mirex/abstracts/2013/DM10.pdf

  13. Meredith, D.: Music analysis and point-set compression. J. New Music Res. 44(3), 245–270 (2015). https://doi.org/10.1080/09298215.2015.1045003

    Article  Google Scholar 

  14. Meredith, D.: RecurSIA-RRT: recursive translatable point-set pattern discovery with removal of redundant translators. In: Cellier, P., Driessens, K. (eds.) ECML PKDD 2019. CCIS, vol. 1168, pp. 485–493. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-43887-6_42

    Chapter  Google Scholar 

  15. Meredith, D., Lemström, K., Wiggins, G.A.: Algorithms for discovering repeated patterns in multidimensional representations of polyphonic music. J. New Music Res. 31(4), 321–345 (2002). https://doi.org/10.1076/jnmr.31.4.321.14162

    Article  Google Scholar 

  16. Meredith, D., Lemström, K., Wiggins, G.A.: Algorithms for discovering repeated patterns in multidimensional representations of polyphonic music. In: Cambridge Music Processing Colloquium (2003). http://www.titanmusic.com/papers/public/cmpc2003.pdf

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to David Meredith .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Meredith, D. (2023). Understanding and Compressing Music with Maximal Transformable Patterns. In: Rauterberg, M. (eds) Culture and Computing. HCII 2023. Lecture Notes in Computer Science, vol 14035. Springer, Cham. https://doi.org/10.1007/978-3-031-34732-0_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-34732-0_24

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-34731-3

  • Online ISBN: 978-3-031-34732-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics