Name
Abstract | ||
|---|---|---|
Current query by humming system can hardly be extended to large massive database as most of them adopt the features extracted from MIDI files which are not widely used and the very time-consuming match methods. In this work, we regard query by humming as a subsequence similarity match problem and exploit the modified SPRING algorithm instead of DTW as the core match method to compare the melody feature extracted from polyphonic music. The SPRING algorithm reduces the algorithm complexity of subsequence match dramatically. Furthermore, we also make it possible for our system to achieve a high speedup over the serial version on different GPU platforms. Experimental results show that our system has more advantages over the state of the art subsequence match method, and has a good scalability to massive database. The processing capacity can reach to thousands of sequences match per second under down sampling. At the same time, the retrieval accuracy results related to all aspects of query by humming point out the encountered problems and the future direction. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1109/ICDMW.2013.104 | ICDM Workshops |
Keywords | Field | DocType |
sequences match,algorithm complexity,spring algorithm,gpu-accelerated query,core match method,modified spring algorithm,humming point,current query,subsequence similarity match problem,subsequence match,art subsequence match method,time-consuming match method,feature extraction,music | Data mining,Decimation,Computer science,Algorithm,MIDI,Query by humming,Exploit,Feature extraction,Subsequence,Speedup,Scalability | Conference |
ISSN | Citations | PageRank |
2375-9232 | 0 | 0.34 |
References | Authors | |
18 | 6 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Guangchao Yao | 1 | 4 | 2.13 |
| Yao Zheng | 2 | 0 | 0.68 |
| Limin Xiao | 3 | 231 | 47.05 |
| Li Ruan | 4 | 123 | 25.10 |
| Yongnan Li | 5 | 26 | 8.35 |
| Zhenzhong Zhang | 6 | 0 | 0.68 |