{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,6]],"date-time":"2024-08-06T23:36:07Z","timestamp":1722987367656},"reference-count":11,"publisher":"Association for Computing Machinery (ACM)","issue":"12","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2012,8]]},"abstract":"<jats:p>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.<\/jats:p>","DOI":"10.14778\/2367502.2367540","type":"journal-article","created":{"date-parts":[[2014,6,24]],"date-time":"2014-06-24T12:17:57Z","timestamp":1403612277000},"page":"1930-1933","source":"Crossref","is-referenced-by-count":4,"title":["Hum-a-song"],"prefix":"10.14778","volume":"5","author":[{"given":"Alexios","family":"Kotsifakos","sequence":"first","affiliation":[{"name":"University of Texas at Arlington"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Panagiotis","family":"Papapetrou","sequence":"additional","affiliation":[{"name":"Aalto University, Finland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jaakko","family":"Hollm\u00e9n","sequence":"additional","affiliation":[{"name":"Aalto University, Finland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dimitrios","family":"Gunopulos","sequence":"additional","affiliation":[{"name":"University of Athens, Greece"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vassilis","family":"Athitsos","sequence":"additional","affiliation":[{"name":"University of Texas at Arlington"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"George","family":"Kollios","sequence":"additional","affiliation":[{"name":"Boston University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2012,8]]},"reference":[{"issue":"6","key":"e_1_2_1_1_1","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1090\/S0002-9904-1954-09848-8","article-title":"The theory of dynamic programming","volume":"60","author":"Bellman R.","year":"1954","unstructured":"R. Bellman . The theory of dynamic programming . Bulletin of the American Mathematical Society , 60 ( 6 ): 503 -- 515 , 1954 . R. Bellman. The theory of dynamic programming. Bulletin of the American Mathematical Society, 60(6):503--515, 1954.","journal-title":"Bulletin of the American Mathematical Society"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1162\/014892604323112239"},{"key":"e_1_2_1_3_1","first-page":"509","volume-title":"ICMC","author":"Hu N.","year":"2002","unstructured":"N. Hu , R. Dannenberg , and A. Lewis . A probabilistic model of melodic similarity . In ICMC , pages 509 -- 515 , 2002 . N. Hu, R. Dannenberg, and A. Lewis. A probabilistic model of melodic similarity. In ICMC, pages 509--515, 2002."},{"key":"e_1_2_1_4_1","first-page":"85","volume-title":"International Workshop on Intelligent Systems Resolutions","author":"Jang J.","year":"2000","unstructured":"J. Jang and M. Gao . A query-by-singing system based on dynamic programming . In International Workshop on Intelligent Systems Resolutions , pages 85 -- 89 , 2000 . J. Jang and M. Gao. A query-by-singing system based on dynamic programming. In International Workshop on Intelligent Systems Resolutions, pages 85--89, 2000."},{"issue":"11","key":"e_1_2_1_5_1","first-page":"761","article-title":"A subsequence matching with gaps-range-tolerances framework: a query-by-humming application","volume":"4","author":"Kotsifakos A.","year":"2011","unstructured":"A. Kotsifakos , P. Papapetrou , J. Hollm\u00e9n , and D. Gunopulos . A subsequence matching with gaps-range-tolerances framework: a query-by-humming application . Proceedings of Very Large Data Bases , 4 ( 11 ): 761 -- 771 , 2011 . A. Kotsifakos, P. Papapetrou, J. Hollm\u00e9n, and D. Gunopulos. A subsequence matching with gaps-range-tolerances framework: a query-by-humming application. Proceedings of Very Large Data Bases, 4(11):761--771, 2011.","journal-title":"Proceedings of Very Large Data Bases"},{"key":"e_1_2_1_6_1","first-page":"267","volume-title":"ISMIR","author":"Pardo B.","year":"2002","unstructured":"B. Pardo and W. Birmingham . Encoding timing information for musical query matching . In ISMIR , pages 267 -- 268 , 2002 . B. Pardo and W. Birmingham. Encoding timing information for musical query matching. In ISMIR, pages 267--268, 2002."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1002\/asi.10373"},{"key":"e_1_2_1_8_1","first-page":"1046","volume-title":"ICDE","author":"Sakurai Y.","year":"2007","unstructured":"Y. Sakurai , C. Faloutsos , and M. Yamamuro . Stream monitoring under the time warping distance . In ICDE , pages 1046 -- 1055 , 2007 . Y. Sakurai, C. Faloutsos, and M. Yamamuro. Stream monitoring under the time warping distance. In ICDE, pages 1046--1055, 2007."},{"key":"e_1_2_1_9_1","volume-title":"ACM Multimedia (Part 1), page 66","author":"Uitdenbogerd A.","year":"1999","unstructured":"A. Uitdenbogerd and J. Zobel . Melodic matching techniques for large music databases . In ACM Multimedia (Part 1), page 66 , 1999 . 10.1145\/319463.319470 A. Uitdenbogerd and J. Zobel. Melodic matching techniques for large music databases. In ACM Multimedia (Part 1), page 66, 1999. 10.1145\/319463.319470"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/TASL.2007.912373"},{"key":"e_1_2_1_11_1","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1145\/872757.872780","volume-title":"SIGMOD","author":"Zhu Y.","year":"2003","unstructured":"Y. Zhu and D. Shasha . Warping indexes with envelope transforms for query by humming . In SIGMOD , pages 181 -- 192 , 2003 . 10.1145\/872757.872780 Y. Zhu and D. Shasha. Warping indexes with envelope transforms for query by humming. In SIGMOD, pages 181--192, 2003. 10.1145\/872757.872780"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/2367502.2367540","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,14]],"date-time":"2023-07-14T14:43:18Z","timestamp":1689345798000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/2367502.2367540"}},"subtitle":["a subsequence matching with gaps-range-tolerances query-by-humming system"],"short-title":[],"issued":{"date-parts":[[2012,8]]},"references-count":11,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2012,8]]}},"alternative-id":["10.14778\/2367502.2367540"],"URL":"https:\/\/doi.org\/10.14778\/2367502.2367540","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2012,8]]}}}