Query-by-humming on internet

5Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We present a query-by-humming system on the Internet. It is fundamentally a content-based music retrieval system based on multi-dimensional spatial indices for high speed similarity searching. This paper discusses technical goals and approaches that will make it possible to use the system on the Internet. The keywords that indicate our goals are retrieval accuracy, quick response, large database, scalability, flexibility, robustness, and usability. We realize these by using some new technologies such as beat-based music data processing, music data splitting by a sliding-window method, database downsizing based on repetitive structure of songs, feature vectors based on timely transition of tones, or-retrieval with multiple feature information, duplicated registration of songs in doubled/halved tempo for a database, and a high-speed retrieval engine with distributed indices. Finally, we present our query-by-humming system, SoundCompass/Humming, that includes these technologies, using our latest GUI. © Springer-Verlag Berlin Heidelberg 2003.

Cite

CITATION STYLE

APA

Kosugi, N., Nagata, H., & Nakanishi, T. (2003). Query-by-humming on internet. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2736, 589–600. https://doi.org/10.1007/978-3-540-45227-0_58

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free