首页> 外文会议>Advances in computer science and information technology >A Novel Approach Based on Fault Tolerance and Recursive Segmentation to Query by Humming
【24h】

A Novel Approach Based on Fault Tolerance and Recursive Segmentation to Query by Humming

机译:基于容错和递归分段的悍马查询新方法

获取原文
获取原文并翻译 | 示例

摘要

With the explosive growth of digital music content-based music information retrieval especially query by humming/singing have been attracting more and more attention and are becoming popular research topics over the past decade. Although query by humming/singing can provide natural and intuitive way to search music, retrieval system still confronts many issues such as key modulation, tempo change, note insertion, deletion or substitution which are caused by users and query transcription respectively. In this paper, we propose a novel approach based on fault tolerance and recursive segmentation to solve above problems. Music melodies in database are represented with specified manner and indexed using inverted index method. Query melody is segmented into phrases recursively with musical dictionary firstly. Then improved edit distance, pitch deviation and overall bias are employed to measure the similarity between phrases and indexed entries. Experimental results reveal that proposed approach can achieve high recall for music retrieval.
机译:随着基于数字音乐内容的音乐信息检索的爆炸性增长,特别是通过哼唱/唱歌的查询已引起越来越多的关注,并且在过去的十年中已成为流行的研究主题。尽管通过哼唱/唱歌进行查询可以提供自然而直观的搜索音乐的方式,但是检索系统仍然面临着许多问题,例如密钥调制,速度变化,音符插入,删除或替换分别由用户和查询转录引起。在本文中,我们提出了一种基于容错和递归分割的新颖方法来解决上述问题。数据库中的音乐旋律以指定的方式表示并使用倒排索引方法进行索引。首先,用音乐词典将查询旋律细分为短语。然后使用改进的编辑距离,音高偏差和整体偏差来测量短语和索引条目之间的相似度。实验结果表明,该方法可以实现较高的音乐检索召回率。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号