Projekter pr. år
Abstrakt
Several pointset patterndiscovery and compression algorithms designed for analysing music are reviewed and evaluated. Each algorithm takes as input a pointset representation of a score in which each note is represented as a point in pitchtime space. Each algorithm computes the maximal translatable patterns (MTPs) in this input and the translational equivalence classes (TECs) of these MTPs, where each TEC contains all the occurrences of a given MTP. Each TEC is encoded as a ⟨pattern,vector set⟩ pair, in which the vector set gives all the vectors by which the pattern can be translated in pitchtime space to give other patterns in the input dataset. Encoding TECs in this way leads, in general, to compression, since each occurrence of a pattern within a TEC (apart from one) is encoded by a single vector, that has the same information content as one point. The algorithms reviewed here adopt different strategies aimed at selecting a set of MTP TECs that collectively cover (or almost cover) the input dataset in a way that maximizes compression. The algorithms are evaluated on two musicological tasks: classifying folk song melodies into tune families and discovering repeated themes and sections in pieces of classical music. On the first task, the bestperforming algorithms achieved success rates of around 84%. In the second task, the best algorithms achieved mean F1 scores of around 0.49, with scores for individual pieces rising as high as 0.71.
Originalsprog  Engelsk 

Titel  Computational Music Analysis 
Redaktører  David Meredith 
Antal sider  32 
Vol/bind  Part V 
Udgivelsessted  Cham, Switzerland 
Forlag  Springer 
Publikationsdato  2016 
Udgave  1 
Sider  335366 
Kapitel  13 
ISBN (Trykt)  9783319259291 
ISBN (Elektronisk)  9783319259314 
DOI  
Status  Udgivet  2016 
Fingeraftryk Dyk ned i forskningsemnerne om 'Analysing Music with PointSet Compression Algorithms'. Sammen danner de et unikt fingeraftryk.
Projekter
 1 Afsluttet

Lrn2Cre8: Learning to Create
EU Seventh Framework Programme (FP7)
01/10/2013 → 30/09/2016
Projekter: Projekt › Forskning