Faster Retrieval with a Two-Pass Dynamic-Time-Warping Lower Bound
Databases
2012-01-16 v2 Computer Vision and Pattern Recognition
Abstract
The Dynamic Time Warping (DTW) is a popular similarity measure between time series. The DTW fails to satisfy the triangle inequality and its computation requires quadratic time. Hence, to find closest neighbors quickly, we use bounding techniques. We can avoid most DTW computations with an inexpensive lower bound (LB Keogh). We compare LB Keogh with a tighter lower bound (LB Improved). We find that LB Improved-based search is faster. As an example, our approach is 2-3 times faster over random-walk and shape time series.
Cite
@article{arxiv.0811.3301,
title = {Faster Retrieval with a Two-Pass Dynamic-Time-Warping Lower Bound},
author = {Daniel Lemire},
journal= {arXiv preprint arXiv:0811.3301},
year = {2012}
}
Comments
Accepted in Pattern Recognition on November 20th, 2008