English  |  正體中文  |  简体中文  |  Items with full text/Total items : 54367/62174 (87%)
Visitors : 13942481      Online Users : 58
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTHU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    National Tsing Hua University Institutional Repository > 電機資訊學院 > 資訊工程學系 > 會議論文  >  Approximate lower-bounding functions for the speedup of DTW for melody recognition

    Please use this identifier to cite or link to this item: http://nthur.lib.nthu.edu.tw/dspace/handle/987654321/13607

    Title: Approximate lower-bounding functions for the speedup of DTW for melody recognition
    Authors: Hong-Ru Lee
    Ching Chen
    Jang, J.S.R.
    Date: 2005
    Publisher: Institute of Electrical and Electronics Engineers Inc
    Keywords: acoustic signal processing
    approximation theory
    dynamic programming music
    Abstract: Conventional methods for melody recognition (or the so-called query by humming) are primarily based on dynamic programming, such as dynamic time warping (DTW). However, the computation load of DTW becomes prohibitively massive when the database has more than, say, 10,000 songs. To lessen the computation while keeping a reasonable recognition rates, this paper present a lower-bound based method that can reduce the computation effectively.
    Relation Link: http://webservices.ieee.org/pindex_basic.html
    URI: http://nthur.lib.nthu.edu.tw/handle/987654321/13607
    Appears in Collections:[資訊工程學系] 會議論文
    [資訊系統與應用研究所] 會議論文
    [電腦與通訊科技研發中心] 會議論文

    Files in This Item:

    File Description SizeFormat
    2030226030007.pdf1367KbAdobe PDF1064View/Open


    SFX Query


    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback