Transposition and time-scale invariant geometric music retrieval

Non Peer reviewe

Discovering distorted repeating patterns in polyphonic music through longest increasing subsequences

We study the problem of identifying repetitions under transposition and time-warp invariances in polyphonic symbolic music. Using a novel onset-time-pair representation, we reduce the repeating pattern discovery problem to instances of the classical problem of finding the longest increasing subsequences. The resulting algorithm works in O(n(2) log n) time where n is the number of notes in a musical work. We also study windowed variants of the problem where onset-time differences between notes are restricted, and show that they can also be solved in O(n(2) log n) time using the algorithm.Peer reviewe

Clustering symbolic music using paradigmatic and surface level analyses

Bononia University Press; 88-7395-155-4;Peer reviewe

Geometric algorithms for transposition invariant content-based music retrieval

We are grateful to Mika Turkia for the implementations.Peer reviewe

Digital Education For All: Better Students Through Open Doors?

The Digital Education For All project (DEFA) is a joint collaboration of five universities to open first-year computer science courses online and for free to audiences outside of universities. Additionally, students who complete enough courses through the project can apply for a study right at any of the participating universities. Completing university courses as a method of applying for a study right measures students' motivation over a long period of time, and gives the students a clear idea of the content they will encounter during their studies, whereas a traditional entrance exam measures competence only at a single point in time. While high school grades, another typical intake mechanism besides entrance exams, measure generic study skills, course-based intake mechanisms may help with student retention, as students express and gain interest in the field while completing the required courses. This study is a preliminary examination of the student intake of the DEFA project in the University of Helsinki, one of the participating universities, and a comparison of how the students accepted through the project perform in studies compared to students accepted through other intake mechanisms. Students wishing to apply for a study right through this intake are expected to complete one regular study year's worth of first-year computer science and mathematics courses in approximately one calendar year.Peer reviewe

The C-BRAHMS Project

Bononia University Press; 88-7395-155-4;Peer reviewe

Fast Index Based Filters for Music Retrieval

We consider two content-based music retrieval problems where the music is modeled as sets of points in the Euclidean plane, formed by the (on-set time, pitch) pairs. We introduce fast filtering methods based on indexing the underlying database. The filters run in a sublinear time in the length of the database, and they are lossless if a quadratic space may be used. By taking into account the application, the search space can be narrowed down, obtaining practically lossless filters using linear size index structures. For the checking phase, which dominates the overall running time, we exploit previously designed algorithms suitable for local checking. In our experiments on a music database, our best filter-based methods performed several orders of a magnitude faster than previous solutions