Browse > Article

A Query by Humming System Using Humming Algebra  

Shin, Je-Yong (경북대학교 컴퓨터공학과)
Han, Wook-Shin (경북대학교 컴퓨터공학과)
Lee, Jong-Hak (대구카톨릭대학교 컴퓨터공학과)
Publication Information
Journal of KIISE:Computing Practices and Letters / v.15, no.8, 2009 , pp. 534-546 More about this Journal
Abstract
Query by humming is an effective and intuitive querying mechanism when a user wants to find a song without knowing lyrics. The query by humming system takes a user-hummed melody as input, compares it with melodies in a music database, and returns top-k similar melodies to the input. In this paper, we propose a novel algebra for query by humming, and design and implement a real query by humming system called HummingBase by exploiting the algebra. By analyzing existing similarity search techniques, we derive 10 core operators for the algebra. By using the well-defined algebra, we can easily implement such a system in a extensible and modular way. With two case studies, we show that the proposed algebra can easily represent the query processing processes of existing query-by-humming systems.
Keywords
Query by humming; Humming algebra; Time-series data;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Ghias, A., Logan, J., Chmberlin, D., and Smith, C., "Query by humming: Musical information retrieval in an audio database," In ACM Multimedia 1995, pp.231-236, 1995   DOI
2 Moon, Y., Whang, K., and Han, W., "General Match: A Subsequence Matching Method in Time-Series Databases Based on Generalized Windows," In Proc. Int'l Conf. on Management of Data, ACM SIGMOD, Madison, Wisconsin, pp.382-393, June 2002   DOI
3 Keogh, E., Chakrabarti, K., Pazzani, M., and Mehrotra, S., “Dimensionality reduction for fast similarity search in large time series databases,” Journal of Knowledge and Information Systems, pp.263-286, 2000   DOI   ScienceOn
4 J.D.Koftinoff Software, ltd. C++ MIDI Library - jdkmidi class library documentation, 2004
5 Zhu, Y., and Shasha, D,, “Warping indexes with envelope transforms for query by humming,” In Proceedings of ACM SIGMOD, pp.181-192, June 2003   DOI
6 Kosugi, N., Nishihara, Y., Sakata, T., Yamamuro, M., and Kushima, K., “A Practical Query-By-Humming System for a Large Music Database,” In Proc. of the 8th ACM International Conference on Multimedia, pp.333-342, 2000   DOI
7 Maher, R., and Beauchamp, J., “Fundamental fre-quency estimation of musical signals using a two-way mismatch procedure,” Journal of the Acou-stical Society of America, vol.95, no.4, pp. 2254- 2263, 1994   DOI   ScienceOn
8 Standard MIDI Files 1.0, http://jedi.ks.uiuc.edu/~johns/links/music/midifile.html
9 Faloutsos, C., Lin, K., “FastMap: A fast algorithm for indexing, data-mining and visualization of traditional and multimedia datasets,” SIGMOD Conference, pp.163-174, 1995   DOI
10 Uitdenbgerd, A., and Zobel, J., "Melodic matching techniques for large music databases," In ACM Multimedia 99, pp.57-66, 1999   DOI
11 Agrawal, R., Faloutsos, C., and Swami, A., "Effi-cient similarity search in sequence databases," In Proc. the 4th Int'l Conf. on Foundations of Data Organization and Algorithms, pp.69-84, 1993   DOI
12 Kosugi, N., Sakurai, Y., and Morimoto, M., “SoundCompass: A Practical Query-by-Humming System,” In Proceedings of ACM SIGMOD, pp.881-886, 2004   DOI
13 Keogh, E., “Exact indexing of dynamic time warping,” In Proceedings of VLDB, pp.406-417, August 2002
14 Rodger McNab, "INTERACTIVE APPLICATIONS OF MUSIC TRANSCRIPTION," Master's thesis, Computer Science at the University of Waikato, 1996
15 Faloutsos, C., Ranganathan, M., and Manolopoulos, Y., “Fast Subsequence Matching in Time-Series Databases,” In Proc. Int'l Conf. on Management of Data, ACM SIGMOD, Minneapolis, Minnesota, pp.419-429, May 1994   DOI   ScienceOn
16 Seidl, T., and Kriegel, H., “Optimal multi-step k-nearest neighbor search,” SIGMOD Conference, pp.154-165, 1998   DOI