A new mechanism of similarity evaluation for content-based music information retrieval

Zhuoran Chen, Xingce Wang, Guoxing Zhao, Mingquan Zhou
{"title":"A new mechanism of similarity evaluation for content-based music information retrieval","authors":"Zhuoran Chen, Xingce Wang, Guoxing Zhao, Mingquan Zhou","doi":"10.1109/YCICT.2010.5713089","DOIUrl":null,"url":null,"abstract":"Content-based music information retrieval (CBMIR) has rapidly become a research focus for the areas of computer science, information retrieval, signal processing, audio processing and pattern recognition. Feature selection, representation and matching mechanism play the crucial roles in CBMIR. A new mechanism of similarity comparison has been proposed in this paper. Melody feature is represented in pitch interval based on physics and perception characteristic of music, which averts the effect by gross differences in key or tempo. The Longest matched subsequences (LMS) algorithm is proposed to obtain the most matched portions from two music pieces, according to local similarity between elements. A compound criterion of similarity evaluation is established, with both matched proportion and distance of matched subsequences being considered. The feasibility and validity of the model is verified by the experiment with a music feature database containing hundreds of songs.","PeriodicalId":179847,"journal":{"name":"2010 IEEE Youth Conference on Information, Computing and Telecommunications","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE Youth Conference on Information, Computing and Telecommunications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/YCICT.2010.5713089","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Content-based music information retrieval (CBMIR) has rapidly become a research focus for the areas of computer science, information retrieval, signal processing, audio processing and pattern recognition. Feature selection, representation and matching mechanism play the crucial roles in CBMIR. A new mechanism of similarity comparison has been proposed in this paper. Melody feature is represented in pitch interval based on physics and perception characteristic of music, which averts the effect by gross differences in key or tempo. The Longest matched subsequences (LMS) algorithm is proposed to obtain the most matched portions from two music pieces, according to local similarity between elements. A compound criterion of similarity evaluation is established, with both matched proportion and distance of matched subsequences being considered. The feasibility and validity of the model is verified by the experiment with a music feature database containing hundreds of songs.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于内容的音乐信息检索相似度评价新机制
基于内容的音乐信息检索(CBMIR)已迅速成为计算机科学、信息检索、信号处理、音频处理和模式识别等领域的研究热点。特征的选择、表示和匹配机制在CBMIR中起着至关重要的作用。本文提出了一种新的相似性比较机制。根据音乐的物理特性和感知特性,用音程来表示旋律特征,避免了因音阶或速度的差异而产生的影响。提出了最长匹配子序列(LMS)算法,根据元素之间的局部相似度,从两个音乐片段中获得最匹配的部分。建立了同时考虑匹配子序列匹配比例和匹配子序列距离的复合相似性评价准则。通过对包含数百首歌曲的音乐特征库进行实验,验证了该模型的可行性和有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Dynamic channel allocation based on genetic algorith in TD-SCDMA system A distributed coding protocol for wireless relay networks A differential evolution optimized fuzzy clustering algorithm with adaptive adjusting strategy Optimization of water allocation based on the economic loss analysis under different drought scenarios City traffic flow character analysis and origin-destination estimation based on data mining
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1