Fundamentals of Computing Continuous Dynamic Time Warping in 2D under Different Norms
By: Kevin Buchin , Maike Buchin , Jan Erik Swiadek and more
Potential Business Impact:
Finds similar shapes even with messy data.
Continuous Dynamic Time Warping (CDTW) measures the similarity of polygonal curves robustly to outliers and to sampling rates, but the design and analysis of CDTW algorithms face multiple challenges. We show that CDTW cannot be computed exactly under the Euclidean 2-norm using only algebraic operations, and we give an exact algorithm for CDTW under norms approximating the 2-norm. The latter result relies on technical fundamentals that we establish, and which generalise to any norm and to related measures such as the partial Fréchet similarity.
Similar Papers
An Efficient Transport-Based Dissimilarity Measure for Time Series Classification under Warping Distortions
Information Theory
Teaches computers to spot patterns in changing data.
Terrain Sensing with Smartphone Structured Light: 2D Dynamic Time Warping for Grid Pattern Matching
CV and Pattern Recognition
Helps robots see bumpy ground to stay steady.
Generalizations of the Normalized Radon Cumulative Distribution Transform for Limited Data Recognition
Numerical Analysis (Math)
Finds hidden patterns in pictures, even when moved.