早期MFCC和HPCP融合的封面歌曲鲁棒识别
Early MFCC And HPCP Fusion for Robust Cover Song Identification
摘要:
虽然大多数自动翻唱歌曲识别的方案都集中在基于音符的功能,如HPCP和和弦配置文件,最近的一些论文令人惊讶地表明,基于MFCC的功能的局部自相似性也有分类能力。由于MFCC和HPCP捕获互补信息,我们设计了一种无监督算法,该算法在尝试本地对齐一对歌曲之前,使用交叉相似性融合将这些特征的归一化节拍同步块结合起来。作为额外的奖励,我们的方案自然地将结构信息纳入每首歌曲中,以填补两个功能集都失败的对齐空白。我们在MFCC和HPCP单独的性能上显示出惊人的跳跃,在Covers80数据集上实现了0.87的最先进的平均倒数排名。我们还介绍了一个新的中等大小的手设计的基准数据集,称为“封面1000”,其中包括395个集团的封面歌曲,共1000首歌曲,我们表明,我们的算法实现了MRR为0.9,在这个数据集上的第一个正确识别的歌曲在一个集团。我们为Covers 1000数据集中的所有歌曲提供了预先计算的HPCP和MFCC特征以及节拍间隔,以供进一步研究使用。
英文摘要:
While most schemes for automatic cover song identification have focused on note-based features such as HPCP and chord profiles, a few recent papers surprisingly showed that local self-similarities of MFCC-based features also have classification power for this task. Since MFCC and HPCP capture complementary information, we design an unsupervised algorithm that combines normalized, beat-synchronous blocks of these features using cross-similarity fusion before attempting to locally align a pair of songs. As an added bonus, our scheme naturally incorporates structural information in each song to fill in alignment gaps where both feature sets fail. We show a striking jump in performance over MFCC and HPCP alone, achieving a state of the art mean reciprocal rank of 0.87 on the Covers80 dataset. We also introduce a new medium-sized hand designed benchmark dataset called "Covers 1000," which consists of 395 cliques of cover songs for a total of 1000 songs, and we show that our algorithm achieves an MRR of 0.9 on this dataset for the first correctly identified song in a clique. We provide the precomputed HPCP and MFCC features, as well as beat intervals, for all songs in the Covers 1000 dataset for use in further research.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。