...
首页> 外文期刊>Audio, Speech, and Language Processing, IEEE/ACM Transactions on >Scalable Discovery of Audio Fingerprint Motifs in Broadcast Streams With Determinantal Point Process Based Motif Clustering
【24h】

Scalable Discovery of Audio Fingerprint Motifs in Broadcast Streams With Determinantal Point Process Based Motif Clustering

机译:基于确定性点过程的母题聚类在广播流中音频指纹母题的可扩展发现

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

摘要

In this paper, we study the scalable discovery of audio repetitive patterns/motifs in long broadcast streams, where two segments are said to be repetitive if their audio fingerprints are close to each other. In this task, as we are confined to handle limited variability, we can adapt an audio hashing technique, originally proposed for searching a given music clip in music tracks, to successfully devise a linear complexity similarity matching method with a new step of repeated interval formation. This is the first contribution of this paper. As the similarity matching is super fast and thus coarse, there are false alarms in the large number of pairwise matches generated, which constitute a major source of noise. We propose applying subset selection to the original set of pairwise matches based on determinantal point processes (DPPs), as a filtering step, to reduce the noise. The selected subset of pairwise matches is then subjected to motif clustering. We successfully apply DPP-based subset selection to improve motif clustering, which has a nice property that favors both quality and diversity. This is the second contribution of this paper. The proposed method is thoroughly evaluated on a 9-hour real-world audio stream and is compared with several reference methods. The bootstrap technique is used for the significance test. It is shown that the similarity matching is computationally very efficient (above 100 times faster than real time), and the filtering step with DPPs can significantly improve the precision of motif discovery, without sacrificing the recall performance.
机译:在本文中,我们研究了长广播流中音频重复模式/图案的可扩展发现,其中如果两个段的音频指纹彼此接近,则可以说两个段是重复的。在此任务中,由于我们只能处理有限的可变性,因此我们可以采用最初建议用于在音乐曲目中搜索给定音乐片段的音频哈希技术,从而成功设计出线性复杂度相似度匹配方法,并采用重复间隔形成的新步骤。这是本文的第一篇贡献。由于相似性匹配非常快且因此很粗糙,因此在生成的成对大量匹配中会出现错误警报,这构成了主要的噪声源。我们建议基于确定点过程(DPP)将子集选择应用于原始的成对匹配集,以作为过滤步骤,以减少噪声。然后将选定的成对匹配子集进行主题聚类。我们成功地应用了基于DPP的子集选择来改善图案聚类,该聚类具有良好的特性,既有利于质量又有利于多样性。这是本文的第二个贡献。在9小时的真实音频流上对提出的方法进行了全面评估,并与几种参考方法进行了比较。自举技术用于显着性检验。结果表明,相似度匹配在计算上非常有效(比实时快100倍以上),并且使用DPP进行过滤的步骤可以显着提高基元发现的精度,而不会牺牲召回性能。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号