A linear space algorithm for computing maximal common subsequences
Communications of the ACM
Toward accurate dynamic time warping in linear time and space
Intelligent Data Analysis
Identifying Similar Subsequences in Data Streams
DEXA '08 Proceedings of the 19th international conference on Database and Expert Systems Applications
Efficient multimedia time series data retrieval under uniform scaling and normalisation
ECIR'08 Proceedings of the IR research, 30th European conference on Advances in information retrieval
Automatic identification of application I/O signatures from noisy server-side traces
FAST'14 Proceedings of the 12th USENIX conference on File and Storage Technologies
| Hi-index | 0.00 |
The alignment of noisy and uniformly scaled time series is an important but difficult task. Given two time series, one of which is a uniformly stretched subsequence of the other, we want to determine the stretching factor and the offset of the second time series within the first one. We adapted and enhanced different methods to address this problem: classical FFT-based approaches to determine the offset combined with a naïve search for the stretching factor or its direct computation in the frequency domain, bounded dynamic time warping and a new approach called shotgun analysis, which is inspired by sequencing and reassembling of genomes in bioinformatics. We thoroughly examined the strengths and weaknesses of the different methods on synthetic and real data sets. The FFT-based approaches are very accurate on high quality data, the shotgun approach is especially suitable for data with outliers. Dynamic time warping is a candidate for non-linear stretching or compression. We successfully applied the presented methods to identify steel coils via their thickness profiles.