Abstract
This paper proposes a new dynamic time warping (DTW) method, called non-Markovian DTW. In the conventional DTW, the warping function is optimized generally by dynamic programming (DP) subject to some Markovian constraints which restrict the relationship between neighboring time points. In contrast, the non-Markovian DTW can introduce non-Markovian constraints for dealing with the relationship between points with a large time interval. This new and promising ability of DTW is realized by using graph cut as the optimizer of the warping function instead of DP. Specifically, the conventional DTW problem is first converted as an equivalent minimum cut problem on a graph and then edges representing the non-Markovian constraints are added to the graph. An experiment on online character recognition showed the advantage of using non-Markovian constraints during DTW.
Original language | English |
---|---|
Title of host publication | ICPR 2012 - 21st International Conference on Pattern Recognition |
Pages | 2294-2297 |
Number of pages | 4 |
Publication status | Published - Dec 1 2012 |
Event | 21st International Conference on Pattern Recognition, ICPR 2012 - Tsukuba, Japan Duration: Nov 11 2012 → Nov 15 2012 |
Other
Other | 21st International Conference on Pattern Recognition, ICPR 2012 |
---|---|
Country | Japan |
City | Tsukuba |
Period | 11/11/12 → 11/15/12 |
All Science Journal Classification (ASJC) codes
- Computer Vision and Pattern Recognition