arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2008.02734cs.SDcs.IRcs.LGcs.MMeess.AS
收藏

具有线性存储器的精确、可扩展的动态时间弯曲对齐

Exact, Parallelizable Dynamic Time Warping Alignment with Linear Memory

Ursinus College(乌尔辛纳斯学院)

Christopher Tralie, Elizabeth Dempsey

摘要:

音频对齐是许多MIR管道中的基本预处理步骤。对于分别具有M帧和N帧的两个音频剪辑,最流行的方法动态时间规整(DTW)在存储器和计算两者中具有O(MN)要求,这对于以合理速率的帧级对准是禁止的。为了解决这个问题,存在各种存储器有效的算法来近似DTW成本下的最佳对齐。然而,据我们所知,没有确切的算法存在,保证打破二次记忆障碍。在这项工作中,我们提出了一个分而治之的算法,计算精确的全局最优DTW对齐使用O(M+N)的内存。它的运行时间仍然是O(MN),用内存换取2倍的计算增长。然而,该算法可以在相同的内存约束下并行化到min(M,N)的因子,因此它仍然可以比具有足够GPU的教科书版本更有效地运行。我们使用我们的算法来计算一组管弦乐的精确对齐,我们使用它作为地面实况来基准几个流行的近似对齐方案在以前不可能的尺度上的对齐精度。

英文摘要:

Audio alignment is a fundamental preprocessing step in many MIR pipelines. For two audio clips with M and N frames, respectively, the most popular approach, dynamic time warping (DTW), has O(MN) requirements in both memory and computation, which is prohibitive for frame-level alignments at reasonable rates. To address this, a variety of memory efficient algorithms exist to approximate the optimal alignment under the DTW cost. To our knowledge, however, no exact algorithms exist that are guaranteed to break the quadratic memory barrier. In this work, we present a divide and conquer algorithm that computes the exact globally optimal DTW alignment using O(M+N) memory. Its runtime is still O(MN), trading off memory for a 2x increase in computation. However, the algorithm can be parallelized up to a factor of min(M, N) with the same memory constraints, so it can still run more efficiently than the textbook version with an adequate GPU. We use our algorithm to compute exact alignments on a collection of orchestral music, which we use as ground truth to benchmark the alignment accuracy of several popular approximate alignment schemes at scales that were not previously possible.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑