Name
Abstract | ||
|---|---|---|
Searching for similarities in large musical databases has become a common procedure. Local alignment methods, based on dynamic programming, explore all the possible matchings between two musical pieces; and as a result return the optimal local alignment. Unfortunately these very powerful methods have a very high computational cost. The exponential growth of musical databases makes exact alignment algorithm unrealistic for searching similarities. Alternatives have been proposed in bioinformatics either by using heuristics or by developing faster implementation of exact algorithm. The main motivation of this work is to exploit the huge computational power of commonly available graphic cards to develop high performance solutions for Query-by-Humming applications. In this paper, we present a fast implementation of a local alignment method, which allows to retrieve a hummed query in a database of MIDI files, with good accuracy, in a time up to 160 times faster than other comparable systems. |
Year | Venue | Keywords |
|---|---|---|
2009 | ISMIR 2013 | power method,local alignment,exponential growth |
Field | DocType | Citations |
Dynamic programming,Data mining,Exact algorithm,Computer science,MIDI,Theoretical computer science,Exploit,Query by humming,Heuristics,Smith–Waterman algorithm,Artificial intelligence,Machine learning | Conference | 7 |
PageRank | References | Authors |
0.55 | 13 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Pascal Ferraro | 1 | 77 | 11.54 |
| Pierre Hanna | 2 | 110 | 20.53 |
| Laurent Imbert | 3 | 217 | 18.69 |
| Thomas Izard | 4 | 24 | 1.88 |