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

平移下的动态时间弯曲:空间填充曲线引导的近似

Dynamic Time Warping Under Translation: Approximation Guided by Space-Filling Curves

Karl Bringmann, Sándor Kisfaludi-Bak, Marvin Künnemann, Dániel Marx, André Nusser

摘要:

动态时间规整(DTW)距离是一种流行的度量各种序列数据的相似性。为了比较$\mathbb{R}^d$中的多边形曲线$π, σ$,它为Fréchet距离提供了一种鲁棒的、对异常值不敏感的替代方法。然而,像Fréchet距离一样,DTW距离在平移下不是不变的。我们是否可以有效地优化任意平移下$π$和$σ$的DTW距离,以比较曲线的形状,而不考虑它们的绝对位置?在这个方向上的工作很少,这可能是由于它的计算复杂性:对于欧几里德范数,这个问题包含作为特殊情况的几何中值问题,它可证明不允许精确的代数算法(即,没有算法只使用加法,乘法和$k$ -th根)。因此,我们研究了非欧几里德范数的精确算法以及欧几里德范数的近似算法:-对于$\mathbb{R}^d$中的$L_1$范数,我们提供了一个$\mathcal{O}(n^{2(d+1)})$时间算法,即,常数$d$的精确多项式时间算法。在这里和下面,$n$限制了曲线的复杂性。- 对于欧几里德规范$\mathbb{R}^2$,我们表明,一个简单的问题的具体见解导致$(1+\varepsilon)$ -近似时间$\mathcal{O}(n^3/\varepsilon^2)$。然后,我们将展示如何获得一个次立方$\widetilde{\mathcal{O}}(n^{2.5}/\varepsilon^2)$时间算法具有显着的新想法,这一次接近众所周知的二次时间障碍计算DTW固定的翻译。从技术上讲,该算法是通过加速重复DTW距离估计使用动态数据结构,以保持最短路径的加权平面有向图。至关重要的是,我们展示了如何使用空间填充曲线遍历一组候选的翻译,这种方式只会导致很少的数据结构更新。

英文摘要:

The Dynamic Time Warping (DTW) distance is a popular measure of similarity for a variety of sequence data. For comparing polygonal curves $π, σ$ in $\mathbb{R}^d$, it provides a robust, outlier-insensitive alternative to the Fréchet distance. However, like the Fréchet distance, the DTW distance is not invariant under translations. Can we efficiently optimize the DTW distance of $π$ and $σ$ under arbitrary translations, to compare the curves' shape irrespective of their absolute location? There are surprisingly few works in this direction, which may be due to its computational intricacy: For the Euclidean norm, this problem contains as a special case the geometric median problem, which provably admits no exact algebraic algorithm (that is, no algorithm using only addition, multiplication, and $k$-th roots). We thus investigate exact algorithms for non-Euclidean norms as well as approximation algorithms for the Euclidean norm: - For the $L_1$ norm in $\mathbb{R}^d$, we provide an $\mathcal{O}(n^{2(d+1)})$-time algorithm, i.e., an exact polynomial-time algorithm for constant $d$. Here and below, $n$ bounds the curves' complexities. - For the Euclidean norm in $\mathbb{R}^2$, we show that a simple problem-specific insight leads to a $(1+\varepsilon)$-approximation in time $\mathcal{O}(n^3/\varepsilon^2)$. We then show how to obtain a subcubic $\widetilde{\mathcal{O}}(n^{2.5}/\varepsilon^2)$ time algorithm with significant new ideas; this time comes close to the well-known quadratic time barrier for computing DTW for fixed translations. Technically, the algorithm is obtained by speeding up repeated DTW distance estimations using a dynamic data structure for maintaining shortest paths in weighted planar digraphs. Crucially, we show how to traverse a candidate set of translations using space-filling curves in a way that incurs only few updates to the data structure.

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

↑