Speeding melody search with vantage point trees

Michael Skalak*, Jinyu Han, Bryan A Pardo

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

6 Scopus citations

Abstract

Melodic search engines let people find music in online collections by specifying the desired melody. Comparing the query melody to every item in a large database is prohibitively slow. If melodies can be placed in a metric space, search can be sped by comparing the query to a limited number of vantage melodies, rather than the entire database. We describe a simple melody metric that is customizable using a small number of example queries. This metric allows use of a generalized vantage point tree to organize the database. We show on a standard melodic database that the general vantage tree approach achieves superior search results for query-by-humming compared to an existing vantage point tree method. We then show this method can be used as a preprocessor to speed search for non-metric melodic comparison.

Original languageEnglish (US)
Title of host publicationISMIR 2008 - 9th International Conference on Music Information Retrieval
Pages95-100
Number of pages6
StatePublished - Dec 1 2008
Event9th International Conference on Music Information Retrieval, ISMIR 2008 - Philadelphia, PA, United States
Duration: Sep 14 2008Sep 18 2008

Publication series

NameISMIR 2008 - 9th International Conference on Music Information Retrieval

Other

Other9th International Conference on Music Information Retrieval, ISMIR 2008
Country/TerritoryUnited States
CityPhiladelphia, PA
Period9/14/089/18/08

ASJC Scopus subject areas

  • Music
  • Information Systems

Fingerprint

Dive into the research topics of 'Speeding melody search with vantage point trees'. Together they form a unique fingerprint.

Cite this