基于信息论相似性测度的翻唱歌曲识别
Identifying Cover Songs Using Information-Theoretic Measures of Similarity
摘要:
本文研究了量化音频信号之间的相似性的方法,特别是针对翻唱歌曲检测的任务。我们考虑一个信息理论的方法,我们计算时间序列之间的可预测性的成对措施。我们比较离散值的方法量化的音频功能,连续值的方法。在离散的情况下,我们提出了一种方法来计算归一化的压缩距离,我们占时间序列之间的相关性。在连续的情况下,我们建议计算基于信息的相似性度量作为时间序列之间的预测误差的统计。我们评估我们的方法上的两个封面歌曲识别任务使用的数据集组成的300个爵士乐标准,并使用百万歌曲数据集。对于这两个数据集,我们观察到连续值方法优于离散值方法。我们考虑基于字符串压缩和预测来估计归一化压缩距离(NCD)的方法,其中我们观察到,对于顺序压缩算法,我们提出的归一化压缩距离与对齐(NCDA)提高了NCD的平均性能。最后,我们证明了连续值的距离可以结合起来,以提高性能的基线方法。使用大规模的过滤和细化的方法,我们展示了国家的最先进的性能,使用百万歌曲数据集的封面歌曲识别。
英文摘要:
This paper investigates methods for quantifying similarity between audio signals, specifically for the task of of cover song detection. We consider an information-theoretic approach, where we compute pairwise measures of predictability between time series. We compare discrete-valued approaches operating on quantised audio features, to continuous-valued approaches. In the discrete case, we propose a method for computing the normalised compression distance, where we account for correlation between time series. In the continuous case, we propose to compute information-based measures of similarity as statistics of the prediction error between time series. We evaluate our methods on two cover song identification tasks using a data set comprised of 300 Jazz standards and using the Million Song Dataset. For both datasets, we observe that continuous-valued approaches outperform discrete-valued approaches. We consider approaches to estimating the normalised compression distance (NCD) based on string compression and prediction, where we observe that our proposed normalised compression distance with alignment (NCDA) improves average performance over NCD, for sequential compression algorithms. Finally, we demonstrate that continuous-valued distances may be combined to improve performance with respect to baseline approaches. Using a large-scale filter-and-refine approach, we demonstrate state-of-the-art performance for cover song identification using the Million Song Dataset.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。