Fast intra-collection audio matching

MIRUM '12 Pub Date : 2012-11-02 DOI:10.1145/2390848.2390850
Verena Thomas, Sebastian Ewert, M. Clausen
{"title":"Fast intra-collection audio matching","authors":"Verena Thomas, Sebastian Ewert, M. Clausen","doi":"10.1145/2390848.2390850","DOIUrl":null,"url":null,"abstract":"The general goal of audio matching is to identify all audio extracts of a music collection that are similar to a given query snippet. Over the last years, several approaches to this task have been presented. However, due to the complexity of audio matching the proposed approaches usually either yield excellent matches but have a poor runtime or provide quick responses albeit calculate less satisfying retrieval results. In this paper, we present a novel procedure that combines the positive aspects and efficiently computes good retrieval results. Our idea is to exploit the fact that in some practical applications queries are not arbitrary audio snippets but are rather given as extracts from the music collection itself (intra-collection query). This allows us to split the audio collection into equal sized overlapping segments and to precompute their retrieval results using dynamic time warping (DTW). Storing these matches in appropriate index structures enables us to efficiently recombine them at runtime. Our experiments indicate a significant speedup compared to classical DTW-based audio retrieval while achieving nearly the same retrieval quality.","PeriodicalId":199844,"journal":{"name":"MIRUM '12","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"MIRUM '12","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2390848.2390850","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

The general goal of audio matching is to identify all audio extracts of a music collection that are similar to a given query snippet. Over the last years, several approaches to this task have been presented. However, due to the complexity of audio matching the proposed approaches usually either yield excellent matches but have a poor runtime or provide quick responses albeit calculate less satisfying retrieval results. In this paper, we present a novel procedure that combines the positive aspects and efficiently computes good retrieval results. Our idea is to exploit the fact that in some practical applications queries are not arbitrary audio snippets but are rather given as extracts from the music collection itself (intra-collection query). This allows us to split the audio collection into equal sized overlapping segments and to precompute their retrieval results using dynamic time warping (DTW). Storing these matches in appropriate index structures enables us to efficiently recombine them at runtime. Our experiments indicate a significant speedup compared to classical DTW-based audio retrieval while achieving nearly the same retrieval quality.
快速集合内音频匹配
音频匹配的一般目标是识别音乐集合中与给定查询片段相似的所有音频摘录。在过去几年中,已经提出了完成这项任务的几种方法。然而,由于音频匹配的复杂性,所提出的方法通常要么产生良好的匹配,但有较差的运行时间,要么提供快速的响应,但计算不太令人满意的检索结果。在本文中,我们提出了一种新的程序,结合了积极的方面,并有效地计算出良好的检索结果。我们的想法是利用这样一个事实,即在一些实际应用中,查询不是任意的音频片段,而是作为音乐集合本身的摘录(集合内查询)。这允许我们将音频集合分割成大小相等的重叠片段,并使用动态时间翘曲(DTW)预先计算它们的检索结果。将这些匹配项存储在适当的索引结构中,使我们能够在运行时有效地重新组合它们。我们的实验表明,在获得几乎相同的检索质量的同时,与传统的基于dtw的音频检索相比,该方法有显著的加速。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信