论文信息 - Evaluation of dynamic programming algorithms for the recognition of shortforms in Pitman's shorthand

Evaluation of dynamic programming algorithms for the recognition of shortforms in Pitman's shorthand

Abstract This paper describes template matching using dynamic programming to recognise unconstrained Pitman's handwritten shortforms. Four basic dynamic programming recognition algorithms and their variations were studied and their performance compared in terms of recognition performance and computational cost.

Graham Leedham | A. Nair

[1] Frank Fallside,et al. Dynamic Programming in the Recognition of Connected Handwritten Script , 1985, CAIA.

[2] S. Chiba,et al. Dynamic programming algorithm optimization for spoken word recognition , 1978 .

[3] Charles C. Tappert,et al. Cursive Script Recognition by Elastic Matching , 1982, IBM J. Res. Dev..

[4] Graham Leedham,et al. Automatic recognition and transcription of Pitman's handwritten shorthand - An approach to shortforms , 1987, Pattern Recognit..

[5] Roger K. Moore. Systems for isolated and connected word recognition , 1987 .

[6] H. Sakoe,et al. Two-level DP-matching--A dynamic programming-based pattern matching algorithm for connected word recognition , 1979 .

[7] Kuldip K. Paliwal,et al. A modification over Sakoe and Chiba's dynamic time warping algorithm for isolated word recognition☆ , 1982 .

[8] C. Myers,et al. A level building dynamic time warping algorithm for connected word recognition , 1981 .

[9] H. Kucera,et al. Computational analysis of present-day American English , 1967 .

[10] G. White,et al. Speech recognition experiments with linear predication, bandpass filtering, and dynamic programming , 1976 .