ttp://iaeme.com/Home/journal/IJCET 176 editor@iaeme.com h International Journal of Computer Engineering & Technology (IJCET) Volume 9, Issue 4, July-August 2018, pp. 176 186, Article ID: IJCET_09_04_0 – 19 Available online at ttp://iaeme.com/Home/issue/IJCET?Volume=9&Issue=4 h Journal Impact Factor (2 6 9.3590(Calculated by GISI) www.jifactor.com 01 ): ISSN Print: 0976-6367 and ISSN Online: 0976 6375 – © IAEME Publication HANDWRITTEN ENGLISH WORD RECOGNITION USING HMM, BAUM-WELCH AND GENETIC ALGORITHM Atma Prakash Singh Department of CSE Maharishi University of Information and Technology, Luck now Ravindra Nath Department of CSE, University Institute of Engineering and Technology, CSJMU, Kanpur Santosh Kumar Department of CSE Maharishi University of Information and Technology, Luck now ABSTRACT We face one problem in in the field of image processing and pattern recognition of computer science, a challenge of correct detection or recognition of the handwritten word. Word recognition talk about the identification of the word which is written by a human being. Most of the researchers are trying to solve recognition problems. We also try to give one solution in this paper to handwritten word recognition, we consider English alphabets of both type and also consider numeric numbers as (A-Z, a-z or 0-9). In this paper we use three approaches Hidden Markov Model (HMM), Baum-Welch and Genetic Algorithm (GA) to identify features of each character and compare with its testing set of characters. we also use stages of handwritten word recognition system that are: read a scanned image of hand written word as “HELLO CAN”. We take “CAN” word image, now we converting this CAN word image into binary matrix form (0 and 1), resizing each character of word into the character binary matrix into size of (n x m where n and m may be same), and thinning of an image to get a clear skeleton of each character. Then in this paper identify each character using three algorithms namely: Forward Algorithm, Baum Welch and Genetic Algorithm. The results obtained from each of the algorithm are compared separately and at the end the accuracy of these algorithms are compared separately. Key words: HMM (Hidden Markov Model), GA (Genetic Algorithm), Baum Welch Method (BWM), Handwritten Character Recognition (HC). Cite this Article: Atma Prakash Singh, Ravindra Nath, Santosh Kumar, Handwritten English Word Recognition Using HMM, Baum-Welch and Genetic Algorithm. International Journal of Computer Engineering and Technology, 9(4), 2018, pp. 176- 186. ttp://iaeme.com/Home/issue/IJCET?Volume=9&Issue=4 h