Offline handwritten Devanagari word recognition: A segmentation based

Proceedings - International Conference on Pattern Recognition

Volumn , Issue , 2008, Pages

  Shaw, Bikash ^a   Parui, Swapan Kr ^a   Shridhar, Malayappan ^b  

^a INDIAN STATISTICAL INSTITUTE   (India)

^b UNIVERSITY OF MICHIGAN DEARBORN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EDIT DISTANCE; FEATURE VECTORS; OFF-LINE HANDWRITTEN; WORD LEVEL; WORD RECOGNITION;

HIDDEN MARKOV MODELS;

CHARACTER RECOGNITION;

EID: 77957966917     PISSN: 10514651     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (5)

1. T. Okuda, E. Tanaka, and T. Kasai. A method for the correction of garbled words based on the levenshtein matrix. IEEE Trans. Inform. Theory, 25(1):172-178, February 1976.
2. N. Otsu. A threshold selection method from gray-level histograms. IEEE Trans. on Systems, Man, and Cybernetics, 9(1):62-66, March 1979.
3. S. K. Parui and B. Shaw. Offline handwritten devanagari word recognition: An hmm based approach. Proc. PReMI-2007(Springer), LNCS-4815:528-535, December 2007.
4. L. R. Rabiner. A tutorial on hidden markov models and selected applications in speech recognition. Proceedings. of the IEEE., 77(2):257-286, February 1989.
5. R. A. Wagner and M. J. Fischer. The string-to-string correction problem. J. ACM, 21(1):168-173, January 1974.