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

一种通用的动态时间规整优化框架

A General Optimization Framework for Dynamic Time Warping

Dave Deriso, Stephen Boyd

摘要:

动态时间扭曲的目标是变换或扭曲时间,以便近似地将两个信号对齐在一起。我们提出的翘曲函数的选择作为一个优化问题的目标中有几个条款。第一项测量时间扭曲信号的未对准。两个额外的正则化项惩罚累积扭曲和时间扭曲的瞬时速率;可以通过将值+inf分配给正则化项来对扭曲施加约束。三个目标项的不同选择产生不同的时间扭曲函数,其权衡信号拟合或对准以及扭曲函数的性质。我们制定的优化问题是一个经典的最优控制问题,初始和终端的限制,和一个状态维度。我们描述了一个有效的一般方法,最大限度地减少了目标的原始和翘曲时间的离散化值,并使用标准的动态规划计算(全球)最优翘曲函数的离散化值。该方案的迭代细化在几次迭代中产生高精度的翘曲函数。我们的方法是作为一个开源Python包GDTW实现的。

英文摘要:

The goal of dynamic time warping is to transform or warp time in order to approximately align two signals together. We pose the choice of warping function as an optimization problem with several terms in the objective. The first term measures the misalignment of the time-warped signals. Two additional regularization terms penalize the cumulative warping and the instantaneous rate of time warping; constraints on the warping can be imposed by assigning the value +inf to the regularization terms. Different choices of the three objective terms yield different time warping functions that trade off signal fit or alignment and properties of the warping function. The optimization problem we formulate is a classical optimal control problem, with initial and terminal constraints, and a state dimension of one. We describe an effective general method that minimizes the objective by discretizing the values of the original and warped time, and using standard dynamic programming to compute the (globally) optimal warping function with the discretized values. Iterated refinement of this scheme yields a high accuracy warping function in just a few iterations. Our method is implemented as an open source Python package GDTW.

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

↑