A general framework of progressive filtering and its application to query by singing/humming

被引:36
作者
Jang, Jyh-Shing Roger [1 ]
Lee, Hong-Ru [1 ]
机构
[1] Natl Tsing Hua Univ, Dept Comp Sci, Hsinchu 300, Taiwan
来源
IEEE TRANSACTIONS ON AUDIO SPEECH AND LANGUAGE PROCESSING | 2008年 / 16卷 / 02期
关键词
dynamic programming (DP); melody recognition; progressive filtering (PF); query by singing/humming (QBSH);
D O I
10.1109/TASL.2007.913035
中图分类号
O42 [声学];
学科分类号
070206 ; 082403 ;
摘要
This paper presents the mathematical formulation and design methodology of progressive filtering (PF) for multimedia information retrieval, and discusses its application to the so-called query by singing/humming (QBSH), or more formally, melody recognition. The concept of PF and the corresponding dynamic programming-based design method are applicable to large multimedia retrieval systems for striking a balance between efficiency (in terms of response time) and effectiveness (in terms of recognition rate). The application of the proposed PF to a five-stage QBSH system is reported, and the experimental results demonstrate the feasibility of the proposed approach.
引用
收藏
页码:350 / 358
页数:9
相关论文
共 21 条
  • [1] ADAMS N, 2005, P INT S MUS INF RETR, P199
  • [2] [Anonymous], 2001, P 9 ACM INT C MULTIM
  • [3] [Anonymous], 2002, P 2 SIAM INT C DAT M
  • [4] [Anonymous], P INT C MAN DAT
  • [5] Deller J., 1993, DISCRETE TIME PROCES
  • [6] BRANCH AND BOUND ALGORITHM FOR COMPUTING K-NEAREST NEIGHBORS
    FUKUNAGA, K
    NARENDRA, PM
    [J]. IEEE TRANSACTIONS ON COMPUTERS, 1975, C 24 (07) : 750 - 753
  • [7] Ghias A., 1995, P READ MULT COMP NET, P216
  • [8] HU N, 2002, P 2 ACM IEEE CS JOIN, P301
  • [9] *ISMIR, 2006, ISMIR MIREX EV QBSH
  • [10] Jang, 2001, P INT C MULT EXP, P289