Feature Analysis for Symbol Recognition by Elastic Matching
暂无分享,去创建一个
A technique has been developed for the recognition of unconstrained handwritten discrete symbols based on elastic matching against a set of prototypes generated by individual writers. The incorporation of feature analysis with elastic matching to eliminate unlikely prototypes is presented in this paper and is shown to greatly reduce the required processing time without any deterioration in recognition performance.
[1] T. K. Vintsyuk. Speech discrimination by dynamic programming , 1968 .
[2] N. G. Zagoruyko,et al. Automatic recognition of 200 words , 1970 .
[3] Hiroaki Sakoe,et al. A Dynamic Programming Approach to Continuous Speech Recognition , 1971 .
[4] Charles C. Tappert,et al. Memory and time improvements in a dynamic programming algorithm for matching speech patterns , 1978 .