Binary Dynamic Time Warping in Linear Time

01/04/2021
by   William Kuszmaul, et al.
0

Dynamic time warping distance (DTW) is a widely used distance measure between time series x, y ∈Σ^n. It was shown by Abboud, Backurs, and Williams that in the binary case, where |Σ| = 2, DTW can be computed in time O(n^1.87). We improve this running time O(n). Moreover, if x and y are run-length encoded, then there is an algorithm running in time Õ(k + ℓ), where k and ℓ are the number of runs in x and y, respectively. This improves on the previous best bound of O(kℓ) due to Dupont and Marteau.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/07/2019

Fast Exact Dynamic Time Warping on Run-Length Encoded Time Series

Dynamic Time Warping (DTW) is a well-known similarity measure for time s...
research
12/01/2021

Approximating Length-Restricted Means under Dynamic Time Warping

We study variants of the mean problem under the p-Dynamic Time Warping (...
research
01/04/2022

Polyline Simplification under the Local Fréchet Distance has Subcubic Complexity in 2D

Given a polyline on n vertices, the polyline simplification problem asks...
research
11/17/2021

Addition Machines, Automatic Functions and Open Problems of Floyd and Knuth

Floyd and Knuth investigated in 1990 register machines which can add, su...
research
10/26/2018

An Acceleration Scheme to The Local Directional Pattern

This study seeks to improve the running time of the Local Directional Pa...
research
01/05/2023

Exact and Heuristic Approaches to Speeding Up the MSM Time Series Distance Computation

The computation of the distance of two time series is time-consuming for...
research
02/20/2020

Linear-time Erasure List-decoding of Expander Codes

We give a linear-time erasure list-decoding algorithm for expander codes...

Please sign up or login with your details

Forgot password? Click here to reset