arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1607.05994cs.DScs.CG
收藏

动态时间扭曲和几何编辑距离:打破二次障碍

Dynamic Time Warping and Geometric Edit Distance: Breaking the Quadratic Barrier

Omer Gold, Micha Sharir

摘要:

动态时间规整(DTW)和几何编辑距离(GED)是曲线或一般时间序列(例如,时间序列),其被表示为某个度量空间$(X, \mathrm{dist})$中的点序列。DTW和GED度量在计算机科学、计算生物学和工程学的各个领域中被大量使用。因此,计算这些措施的任务是在P的核心问题之一。尽管广泛的努力,以找到更有效的算法,最有名的算法计算的DTW或GED之间的两个序列的点在$X = \mathbb{R}^d$是长期存在的动态规划算法,需要二次运行时间,即使是一维的情况下$d = 1$,这可能是最常用的在实践中。在本文中,我们打破了近50年的二次时间界计算$\mathbb{R}$中的两个序列的$n$点之间的DTW或GED,通过提出确定性算法,运行在$O\left( n^2 / \log\log n \right)$时间。我们的算法可以扩展到也适用于高维空间$\mathbb{R}^d$,对于任何常数$d$,当底层距离度量$\mathrm{dist}$是多面体时(例如,$L_1, L_\infty$)。

英文摘要:

Dynamic Time Warping (DTW) and Geometric Edit Distance (GED) are basic similarity measures between curves or general temporal sequences (e.g., time series) that are represented as sequences of points in some metric space $(X, \mathrm{dist})$. The DTW and GED measures are massively used in various fields of computer science, computational biology, and engineering. Consequently, the tasks of computing these measures are among the core problems in P. Despite extensive efforts to find more efficient algorithms, the best-known algorithms for computing the DTW or GED between two sequences of points in $X = \mathbb{R}^d$ are long-standing dynamic programming algorithms that require quadratic runtime, even for the one-dimensional case $d = 1$, which is perhaps one of the most used in practice. In this paper, we break the nearly 50 years old quadratic time bound for computing DTW or GED between two sequences of $n$ points in $\mathbb{R}$, by presenting deterministic algorithms that run in $O\left( n^2 / \log\log n \right)$ time. Our algorithms can be extended to work also for higher dimensional spaces $\mathbb{R}^d$, for any constant $d$, when the underlying distance-metric $\mathrm{dist}$ is polyhedral (e.g., $L_1, L_\infty$).

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

↑