Flexible and Efficient Bit-Parallel Techniques for Transposition Invariant Approximate Matching in Music Retrieval
- 400 Downloads
Recent research in music retrieval has shown that a combinatorial approach to the problem could be fruitful. Three distinguishing requirements of this particular problem are (a) approximate searching permitting missing, extra, and distorted notes, (b) transposition invariance, to allow matching a sequence that appears in a different scale, and (c) handling polyphonic music. These combined requirements make up a complex combinatorial problem that is currently under research. On the other hand, bit-parallelism has proved a powerful practical tool for combinatorial pattern matching, both flexible and efficient. In this paper we use bit-parallelism to search for several transpositions at the same time, and obtain speedups of O(w/logk) over the classical algorithms, where the computer word has w bits and k is the error threshold allowed in the match. Although not the best solution for the easier approximation measures, we show that our technique can be adapted to complex cases where no competing method exists, and that are the most interesting in terms of music retrieval.
KeywordsEdit Distance String Match Query Pattern Approximate String Match Computer Word
Unable to display preview. Download preview PDF.
- 2.Crochemore, M., Iliopoulos, C.S., Pinzon, Y.J., Rytter, W.: Finding motifs with gaps. In: First International Symposium on Music Information Retrieval (ISMIR 2000), Plymouth, MA (2000)Google Scholar
- 6.Dovey, M.J.: A technique for “regular expression” style searching in polyphonic music. In: the 2nd Annual International Symposium on Music Information Retrieval (ISMIR 2001), Bloomington, IND, October 2001, pp. 179–185 (2001)Google Scholar
- 9.Lemström, K., Laine, P.: Musical information retrieval using musical parameters. In: Proceedings of the 1998 International Computer Music Conference, Ann Arbor, MI, pp. 341–348 (1998)Google Scholar
- 10.Lemström, K., Tarhio, J.: Transposition invariant pattern matching for multitrack strings. Nordic Journal of Computing (2003) (to appear)Google Scholar
- 11.Lemström, K., Ukkonen, E.: Including interval encoding into edit distance based music comparison and retrieval. In: Proceedings of the AISB 2000 Symposium on Creative & Cultural Aspects and Applications of AI & Cognitive Science, Birmingham, April 2000, pp. 53–60 (2000)Google Scholar
- 13.MIDI Manufacturers Association, Los Angeles, California. The Complete Detailed MIDI 1.0 Specification (1996)Google Scholar
- 15.Paul, W., Simon, J.: Decision trees and random access machines. In: Proc. Int’l. Symp. on Logic and Algorithmic, Zurich, pp. 331–340 (1980)Google Scholar
- 16.Wiggins, G.A., Lemström, K., Meredith, D.: Sia(M): A family of efficient algorithms for translation-invariant pattern matching in multidimensional datasets (submitted)Google Scholar