• Corpus ID: 246285806

Understanding and Compressing Music with Maximal Transformable Patterns

  title={Understanding and Compressing Music with Maximal Transformable Patterns},
  author={David Meredith},
  • D. Meredith
  • Published 26 January 2022
  • Computer Science
  • ArXiv
We present a polynomial-time algorithm that discovers all maximal patterns in a point set, D ∈ R, that are related by transformations in a user-specified class, F , of bijections over R. 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 = {〈P1, T1〉 , 〈P2, T2… 


Music Analysis and Point-Set Compression
The best-performing algorithm on the folk-song classification task was COSIATEC, with a success rate of 84%.
COSIATEC and SIATECCompress: Pattern discovery by geometric compression
Three versions of each of two greedy compression algorithms, COSIATEC and SIATECCOMPRESS, were run on the JKU Patterns Development Database to study the effects of compression ratio and compactness on translational equivalence classes of maximal translatable patterns.
Algorithms for discovering repeated patterns in multidimensional representations of polyphonic music
This work proposes a geometric approach to repetition discovery in which the music is represented as a multidimensional dataset, which allows polyphonic music to be analysed as efficiently as monophonic music and it can be used to discoverpolyphonic repeated patterns “with gaps” in the timbre, dynamic and rhythmic structure of a passage as well as its pitch structure.
RECURSIA-RRT: Recursive translatable point-set pattern discovery with removal of redundant translators
We introduce two algorithms, RECURSIA and RRT, designed to increase the compression factor achievable using point-set cover algorithms based on the SIA and SIATEC pattern discovery algorithms. SIA
A Comparative Evaluation of Algorithms for Discovering Translational Patterns in Baroque Keyboard Works
It is demonstrated that in all but the most carefully selected excerpts of music, the two existing algorithms can be affected by what is termed the 'problem of isolated membership'.
SIARCT-CFP: Improving Precision and the Discovery of Inexact Musical Patterns in Point-Set Representations
Two complementary solutions are proposed and assessed for the precision problem, one involving categorisation (hence reduction of output patterns, and the second involving a new algorithm that calculates the difference between consecutive point pairs, rather than all point pairs.
The similarity metric
A new "normalized information distance" is proposed, based on the noncomputable notion of Kolmogorov complexity, and it is demonstrated that it is a metric and called the similarity metric.
Using Geometric Symbolic Fingerprinting to Discover Distinctive Patterns in Polyphonic Music Corpora
The chapter does not solve the problem of inter-opus pattern discovery, but it can act as a platform for research that will further reduce the gap between what music informaticians do, and what musicologists find interesting.
Cognitively-motivated geometric methods of pattern discovery and models of similarity in music
This thesis is concerned with cognitively-motivated representations of musical structure. Three problems are addressed, each related in terms of their focus on music as an object of perception, and
Improved methods for pattern discovery in music, with applications in automated stylistic composition
Improved computational methods for pattern discovery in music, and the precision and runtime of pattern discovery algorithms, and their use for audio summarisation are among topics for future work.