Using SIATECCompress to discover repeated themes and sections in polyphonic music

Research output: Contribution to conference without publisher/journalConference abstract for conferenceResearchpeer-review

47 Downloads (Pure)

Abstract

Three variants of the SIATECCompress algorithm were submitted to the 2016 MIREX competition on Discovery of Repeated Themes and Sections. The three variants were those that performed best in terms of three-layer F1 score (TLF1), three-layer precision (TLP) and three-layer recall (TLR), respectively, when a large number of variants of SIATECCompress, COSIATEC and Forth’s algorithm
were run on the polyphonic version of the JKU Patterns Development Database (JKU-PDD). The variant optimised for TLF1 achieved an average TLF1 score of 0.490 over the five pieces in the database. The variant optimised for TLP achieved an average TLP score of 0.561 over the JKU-PDD. The variant optimised for TLR achieved an average TLR score of 0.583 over the JKU-PDD. The three variants have been implemented in Java.
Original languageEnglish
Publication date2016
Number of pages9
Publication statusPublished - 2016
EventMusic Information Retrieval Evaluation Exchange - New York University and Columbia University, New York, United States
Duration: 7 Aug 201611 Sep 2016
Conference number: 11
http://www.music-ir.org/mirex/wiki/2016:Main_Page

Conference

ConferenceMusic Information Retrieval Evaluation Exchange
Number11
LocationNew York University and Columbia University
CountryUnited States
CityNew York
Period07/08/201611/09/2016
Internet address

Cite this