An Efficient JMC Algorithm for the Rhythm Query in Music Databases

Abstract

The rhythm query is the fundamental technique in music genre classification and content-based retrieval, which are crucial to multimedia applications. Recently, Christodoulakis et al. has proposed the CIRS algorithm that can be used to classify music duration sequences according to rhythms. In order to classify music by rhythms, the CIRS algorithm locates MaxCover which is the maximum-length substring of the music duration sequence, which can be covered (overlapping or consecutive) by the rhythm query continuously. However, this algorithm will repeatedly generate unnecessary results during the processing, resulting in the increase of the running time. To reduce the processing cost in the CIRS algorithm, we propose the JMC (Jumping-by-MaxCover) algorithm which provides a pruning strategy to find MaxCover incrementally. From our experimental results, we have shown that the running time of our proposed algorithm could be shorter than that of the CIRS algorithm.