Elastic matching in linear time and constant space

  title={Elastic matching in linear time and constant space},
  author={Scott MacLean and George Labahn},
Dynamic time warping (DTW) is well known as an effective method for model-based symbol recognition. Unfortunately, its complexity is quadratic in the number of points present in the symbols to be matched. In this paper, we propose a greedy approximate solution to Tappert’s dynamic program formulation of DTW, and show empirically that it performs as well as the exact solution while requiring only linear time to compute. 
Highly Cited
This paper has 22 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.


Publications citing this paper.
Showing 1-10 of 15 extracted citations

Classification of On-Line Mathematical Symbols with Hybrid Features and Recurrent Neural Networks

2013 12th International Conference on Document Analysis and Recognition • 2013
View 4 Excerpts
Highly Influenced

Offline Features for Classifying Handwritten Math Symbols with Recurrent Neural Networks

2014 22nd International Conference on Pattern Recognition • 2014
View 4 Excerpts
Highly Influenced

A system for recognizing online handwritten mathematical expressions by using improved structural analysis

International Journal on Document Analysis and Recognition (IJDAR) • 2016
View 1 Excerpt

Real time handwriting recognition for mathematic expressions using Hidden Markov Model

2016 International Seminar on Intelligent Technology and Its Applications (ISITIA) • 2016
View 1 Excerpt

Using Off-Line Features and Synthetic Data for On-Line Handwritten Math Symbol Recognition

2014 14th International Conference on Frontiers in Handwriting Recognition • 2014
View 2 Excerpts

Similar Papers

Loading similar papers…