Non-Markovian dynamic time warping

Seiichi Uchida, Masahiro Fukutomi, Koichi Ogawara, Yaokai Feng

研究成果: Chapter in Book/Report/Conference proceedingConference contribution

5 被引用数 (Scopus)

抄録

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.

本文言語英語
ホスト出版物のタイトルICPR 2012 - 21st International Conference on Pattern Recognition
ページ2294-2297
ページ数4
出版ステータス出版済み - 12 1 2012
イベント21st International Conference on Pattern Recognition, ICPR 2012 - Tsukuba, 日本
継続期間: 11 11 201211 15 2012

その他

その他21st International Conference on Pattern Recognition, ICPR 2012
Country日本
CityTsukuba
Period11/11/1211/15/12

All Science Journal Classification (ASJC) codes

  • Computer Vision and Pattern Recognition

フィンガープリント 「Non-Markovian dynamic time warping」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル