Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Hum-a-song: a subsequence matching with gaps-range-tolerances query-by-humming system
Stockholms universitet, Samhällsvetenskapliga fakulteten, Institutionen för data- och systemvetenskap.
Vise andre og tillknytning
2012 (engelsk)Inngår i: Proceedings of the VLDB Endowment, ISSN 2150-8097, Vol. 5, nr 12, 1930-1933 s.Artikkel i tidsskrift (Fagfellevurdert) Published
Abstract [en]

We present "Hum-a-song", a system built for music retrieval, and particularly for the Query-By-Humming (QBH) application. According to QBH, the user is able to hum a part of a song that she recalls and would like to learn what this song is, or find other songs similar to it in a large music repository. We present a simple yet efficient approach that maps the problem to time series subsequence matching. The query and the database songs are represented as 2-dimensional time series conveying information about the pitch and the duration of the notes. Then, since the query is a short sequence and we want to find its best match that may start and end anywhere in the database, subsequence matching methods are suitable for this task. In this demo, we present a system that employs and exposes to the user a variety of state-of-the-art dynamic programming methods, including a newly proposed efficient method named SMBGT that is robust to noise and considers all intrinsic problems in QBH; it allows variable tolerance levels when matching elements, where tolerances are defined as functions of the compared sequences, gaps in both the query and target sequences, and bounds the matching length and (optionally) the minimum number of matched elements. Our system is intended to become open source, which is to the best of our knowledge the first non-commercial effort trying to solve QBH with a variety of methods, and that also approaches the problem from the time series perspective.

sted, utgiver, år, opplag, sider
New York: Association for Computing Machinery (ACM) , 2012. Vol. 5, nr 12, 1930-1933 s.
HSV kategori
Forskningsprogram
data- och systemvetenskap
Identifikatorer
URN: urn:nbn:se:su:diva-100728OAI: oai:DiVA.org:su-100728DiVA: diva2:695736
Tilgjengelig fra: 2014-02-12 Laget: 2014-02-12 Sist oppdatert: 2014-03-11bibliografisk kontrollert

Open Access i DiVA

Fulltekst mangler

Andre lenker

http://vldb.org/pvldb/vol5/p1930_alexioskotsifakos_vldb2012.pdf

Søk i DiVA

Av forfatter/redaktør
Papapetrou, Panagiotis
Av organisasjonen

Søk utenfor DiVA

GoogleGoogle Scholar

Totalt: 34 treff
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf