SEMEX - An efficient Music Retrieval Prototype

We present an efficient prototype for music information retrieval. The prototype uses bitparallel algorithms for locating transposition invariant matches of monophonic query melodies within monophonic or polyphonic music stored in a database. When dealing with monophonic music, we employ a fast approximate bit-parallel algorithm with special edit distance metrics. The fast scanning phase is succeeded by verification where a separate metrics is used for ranking matches. We also offer the possibility to search for exact occurrences of a `distributed' melody within polyphonic databases via a bit-parallel filtering technique. In our experiments with a database of 2 million musical elements (notes in a monophonic and chords in a polyphonic database) the responses were obtained within one second in both cases. Furthermore, our prototype is capable of using various interval classes in matching, producing more approximation when it is needed. Key words: music retrieval, bit parallelism, ...

• Type: Conference
• Year: 2000
• Where: ISMIR
• Authors: Kjell Lemström, S. Perttu
• Keywords: ISMIR 2000, Monophonic Music, Monophonic Query Melodies, Music, Polyphonic Databases