Name
Abstract | ||
|---|---|---|
In a multimedia information retrieval system, the response time to a query is crucial for user experience. For a practical QBH system, developers not only need to devise an effective method of melody match, but also need to consider the response speed to a query. Although the index-based methods can effectively reduce the latency, to meet the strict requirements in most real situations where, for example, the database contains hundreds of thousands of songs, further efforts are needed. To strike a balance between response speed and retrieval accuracy, this paper presents an optimal design for filter combination (FC) applied in a query by humming (QBH) system. In the design of FC, we first make use of a greedy algorithm to sort filters and then group filters to reduce the total number of levels of filters. To further accelerate the speed of retrieval and present results within a time limit, we adopt the dynamic programming to optimize the confidence threshold in each filter. The proposed methodology can greatly accelerate the retrieval process with the cost of sacrificing the least accuracy. A four-level filtering QBH system is evaluated on a large-scale database of 100,000 MIDI files. The experimental results demonstrate the feasibility of the proposed method. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1007/s00034-015-0021-9 | CSSP |
Keywords | Field | DocType |
Query by humming, Locality sensitive hashing, Filter combination, Dynamic programming, Music information retrieval | Dynamic programming,Data mining,Music information retrieval,Query expansion,Computer science,sort,Multimedia information retrieval,Filter (signal processing),Greedy algorithm,Query by humming | Journal |
Volume | Issue | ISSN |
34 | 10 | 1531-5878 |
Citations | PageRank | References |
0 | 0.34 | 11 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Qiang Wang | 1 | 0 | 0.34 |
| Zhiyuan Guo | 2 | 30 | 5.35 |
| Jun Guo | 3 | 1579 | 137.24 |
| Gang Liu | 4 | 5 | 1.86 |