Work

A simple efficient approximation algorithm for dynamic time warping

Year: 2016

Type: conference-paper

Abstract: Dynamic time warping (DTW) is a widely used curve similarity measure. We present a simple and efficient (1 + ε)- approximation algorithm for DTW between a pair of point sequences, say, P and Q, each of which is sampled from a curve. We prove that the running time of the algorithm is O([EQUATION]n log σ) for a pair of k-packed curves with a total of n points, assuming that the spreads of P and Q are bounded by σ. The spread of a point set is the ratio of the maximum to the minimum pairwise distance, and a curve is called K- packed if the length of its intersection with any disk of radius r is at most Kr. Although an algorithm with similar asymptotic time complexity was presented in [1], our algorithm is considerably simpler and more efficient in practice.

Source: ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (SIGSPATIAL GIS)

DOI: 10.1145/2996913.2996954

Authors: Rex Ying, Jiangwei Pan, Kyle Fox, Pankaj K. Agarwal

Institutions: Stanford University, Duke University

Language: English

Topic: Computational Geometry and Mesh Generation

Subfield: Computer Graphics and Computer-Aided Design

Field: Computer Science

Domain: Physical Sciences

Open Access status: bronze

Funders: National Science Foundation, Army Research Office