Skip to main content

Top-K Similarity Search for Query-By-Humming

  • Conference paper
  • First Online:
  • 1145 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 9659))

Abstract

As an important way of music retrieval, Query-By-Humming has gained wide attention because of its effectiveness and convenience. This paper proposes a novel Top-K similarity search technique, which provides fast retrieval for Query-By-Humming. We propose a distance function MDTW for multi-dimensional sequence matching as well as a subsequence matching method \(MDTW_{sub}\). We show that the proposed method is highly applicable to music retrieval. In our paper, music pieces are represented by 2-dimensional time series, where each dimension holds information about the pitch or duration of each note, respectively. In order to improve the efficiency, we utilize inverted lists and q-gram technique to process music database, and utilize q-chunk technique to process hummed piece. Then, we calculate the MDTW distances between hummed q-chunks and music q-grams, and we can get the candidate music and their sensitive data areas. We proposes TopK-Brute and TopK-LB Algorithm to search the Top-K songs. The experimental results demonstrate both the efficiency and effectiveness of our approach.

The work is partially supported by the NSF of China (Nos. 61572122, 61272178), the NSF of China for Outstanding Young Scholars (No. 61322208), and the NSF of China for Key Program (No. 61572122).

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Notes

  1. 1.

    http://vlm1.uta.edu/ akotsif/ismbgt/.

References

  1. Kageyama, T.: Melody retrieval with humming. In: Proceedings of the ICMC 1993, pp. 349–351 (1993)

    Google Scholar 

  2. Ghias, A., Logan, J., Chamberlin, D., Smith, B.C.: Query by humming: musical information retrieval in an audio database. In: Proceedings of the Third ACM International Conference on Multimedia, pp. 231–236. ACM (1995)

    Google Scholar 

  3. Kotsifakos, A., Karlsson, I., Papapetrou, P., Athitsos, V., Gunopulos, D.: Embedding-based subsequence matching with gaps-range-tolerances: a query-by-humming application. VLDB J. 24(4), 1–18 (2015)

    Article  Google Scholar 

  4. Sutinen, E., Tarhio, J.: On using q-gram locations in approximate string matching. In: Spirakis, P.G. (ed.) ESA 1995. LNCS, vol. 979, pp. 327–340. Springer, Heidelberg (1995)

    Google Scholar 

  5. Qin, J., Wang, W., Lu, Y., Xiao, C., Lin, X.: Efficient exact edit similarity query processing with the asymmetric signature scheme. In: Proceedings of the 2011 ACM SIGMOD International Conference on Management of data, pp. 1033–1044. ACM (2011)

    Google Scholar 

  6. Lemström, K., Ukkonen, E.: Including interval encoding into edit distance based music comparison and retrieval. In: Proceedings of the AISB, pp. 53–60 (2000)

    Google Scholar 

  7. Jang, J.S.R., Lee, H.R., Kao, M.Y.: Content-based music retrieval using linear scaling and branch-and-bound tree search. In: Null, p. 74. IEEE (2001)

    Google Scholar 

  8. Zhu, Y., Shasha, D.: Warping indexes with envelope transforms for query by humming. In: Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data, pp. 181–192. ACM (2003)

    Google Scholar 

  9. Adams, N.H., Bartsch, M.A., Shifrin, J.B., Wakefield, G.H.: Time series alignment for music information retrieval. Ann Arbor 1001, 48109-2110 (2004)

    Google Scholar 

  10. Unal, E., Chew, E., Georgiou, P.G., Narayanan, S.S.: Challenging uncertainty in query by humming systems: a fingerprinting approach. IEEE Trans. Audio Speech Lang. Processing 16(2), 359–371 (2008)

    Article  Google Scholar 

  11. Shifrin, J., Pardo, B., Meek, C., Birmingham, W.: Hmm-based musical query retrieval. In: Proceedings of the 2nd ACM/IEEE-CS Joint Conference on Digital Libraries, pp. 295–300. ACM (2002)

    Google Scholar 

  12. Ryynänen, M., Klapuri, A.: Query by humming of midi and audio using locality sensitive hashing. In: 2008 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP 2008, pp. 2249–2252. IEEE (2008)

    Google Scholar 

  13. Kotsifakos, A., Papapetrou, P., Hollmén, J., Gunopulos, D.: A subsequence matching with gaps-range-tolerances framework: a query-by-humming application. Proc. VLDB Endowment 4(11), 761–771 (2011)

    Google Scholar 

  14. Sakurai, Y., Faloutsos, C., Yamamuro, M.: Stream monitoring under the time warping distance. In: 2007 IEEE 23rd International Conference on Data Engineering, ICDE 2007, pp. 1046–1055. IEEE (2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Peipei Wang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Wang, P., Wang, B., Luo, S. (2016). Top-K Similarity Search for Query-By-Humming. In: Cui, B., Zhang, N., Xu, J., Lian, X., Liu, D. (eds) Web-Age Information Management. WAIM 2016. Lecture Notes in Computer Science(), vol 9659. Springer, Cham. https://doi.org/10.1007/978-3-319-39958-4_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-39958-4_16

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-39957-7

  • Online ISBN: 978-3-319-39958-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics