Research Projects
| 1. SLIC | 2. Ambiguity Reduction | 3. Localized Semantics |
| 4. Continuous DTW | 5. NNI | 6. Emotion Modeling |
Continuous Dynamic Time Warping
While widely used in the context of speech recognition, Dynamic Time Warping (DTW) is a ubquitous measure across different domain. For example, it can be applied directly to curve matching. One drawback of this measure is that it is defined between sequences of points rather than curves. In this work, we generalize the discrete DTW to continuous domains, and first propose efficient polynomial algorithms to compute continous DTW.We reformulize the prolem which leads to an interesting connection with finding shortest paths in a combinatorial manifold constructed on the input chains. The special manifold also yield a faster approximate algorithm based on dynamic time warping. We demonstrate the quality of this measure in signature verification.
Top image is the matching using discrete DTW and the bottom one is from
continous DTW.
Related Publications
- 1. A. Efrat, Q. Fan, and S. Venkatasubramanian, Curve Matching, Time Warping, and Light Field --- New Algorithms for Computing Similarity Between Curves, Journal of Mathematical Image and Vision (JMIV), 27(3), Apr 2007. [pdf]
