Music Recognition Algorithms Using Queries by Example

被引:0
|
作者
Jaczynska, Marta [1 ]
Bobinski, Piotr [1 ]
Pietrzak, Agnieszka [1 ]
机构
[1] Warsaw Univ Technol, Fac Elect & Informat Technol, Inst Radioelect & Multimedia Technol, Warsaw, Poland
来源
2018 JOINT CONFERENCE - ACOUSTICS | 2018年
关键词
music recognition; query by humming; pitch tracking;
D O I
暂无
中图分类号
O42 [声学];
学科分类号
070206 ; 082403 ;
摘要
With the appearance of audio databases novel information retrieval methods are required. A natural way of searching in a musical audio database is by humming or whistling the tune of a song as a query, which is the so-called "query by humming". In this study five different techniques for effective and efficient querying by humming are described and compared. For this purpose, a system that allows searching for songs in a pre-prepared database using various pitch tracking methods was implemented. The system uses the hummed part of a song or recording of live singing as an input signal for which melodic contours are created. These contours are then compared with sample songs in the database. Five different algorithms were implemented to search the pitch of the input signals and tested in order to determine which of them is the most effective. Additionally, research has been made to set out influence of predefined parameters and the singer vocal skills on search results.
引用
收藏
页码:108 / 111
页数:4
相关论文
共 50 条
  • [41] Efficient rewriting algorithms for preference queries
    Georgiadis, Periklis
    Kapantaidakis, Ioannis
    Christophides, Vassilis
    Nguer, Elhadji Mamadou
    Spyratos, Nicolas
    2008 IEEE 24TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING, VOLS 1-3, 2008, : 1101 - +
  • [42] Graphical Models: Queries, Complexity, Algorithms
    Cooper, Martin C.
    de Givry, Simon
    Schiex, Thomas
    37TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2020), 2020, 154
  • [43] Algorithms and Data Structures for Hyperedge Queries
    Bertrand J.
    Dufossé F.
    Singh S.
    Uçar B.
    ACM Journal of Experimental Algorithmics, 2022, 27 (07):
  • [44] Efficient algorithms for processing XPath queries
    Gottlob, G
    Koch, C
    Pichler, R
    ACM TRANSACTIONS ON DATABASE SYSTEMS, 2005, 30 (02): : 444 - 491
  • [45] OPTIMIZATION ALGORITHMS FOR DISTRIBUTED QUERIES - REPLY
    APERS, PM
    HEVNER, AR
    YAO, SB
    IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 1984, 10 (04) : 465 - 465
  • [46] Genetic algorithms for approximate similarity queries
    Bueno, Renato
    Traina, Agma J. M.
    Traina, Caetano, Jr.
    DATA & KNOWLEDGE ENGINEERING, 2007, 62 (03) : 459 - 482
  • [47] Boolean queries optimization by genetic algorithms
    Húsek, D
    Owais, SSJ
    Krömer, P
    Snásel, V
    NEURAL NETWORK WORLD, 2005, 15 (05) : 395 - 409
  • [48] OPTIMIZATION ALGORITHMS FOR DISTRIBUTED QUERIES - COMMENT
    LAKHANI, GD
    WANG, JS
    IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 1984, 10 (04) : 464 - 465
  • [49] On approximate algorithms for distance-based queries using R-trees
    Corral, A
    Vassilakopoulos, M
    COMPUTER JOURNAL, 2005, 48 (02): : 220 - 238
  • [50] On approximate algorithms for distance-based queries using R-trees
    Corral, A. (acorral@ual.es), 1600, Oxford University Press (48):