Character recognition is commonly referred to as Optical Character recognition as it deals with the recognition of optically processed characters. With the advent of digital optical scanners, a lot of paper- based books, textbooks, magazines, articles, and documents are being transformed into an electronic version that can be manipulated by a computer. OCR is an instance of off-line character recognition, where the system recognizes the fixed static shape of the character. This paper focuses on character recognition of printed text in Nepali script. This work analyzes the efficiency of Nepalese OCR based on Tesseract engine. The benchmark of this investigation and analysis is to create the dataset of the 69 different fonts with the 2,484 samples of consonants data of Nepali script. The overall accuracy of 96% was obtained in the training phase and 69% in the testing phase.
1. R. Graham, H. McCabe and S. Sheridan, “Pathfinding in Computer Games”, The ITB Journal, vol. 4, no. 2, pp. 57-81, 2003. 2. X. Cui and H. Shi, “A*-based Pathfinding in Modern Computer Games”, IJCSNS International Journal of Computer Science and Network Security, vol. 11, no. 1, pp. 125-130, 2011. 3. N. Barnouti, S. Al-Dabbagh and M. Sahib Naser, “Pathfinding in Strategy Games and Maze Solving Using A* Search Algorithm”, Journal of Computer and Communications, vol. 04, no. 11, pp. 15-25, 2016. 4. J. Pandian, R. Karthik and B. Karthikeyan, “Maze Solving Robot Using Freeduino and LSRB Algorithm”, International Journal of Modern Engineering Research (IJMER), pp. 92-100, 2017. 5. M. Alsubaie. “Algorithms for Maze Solving Robot.” Bachelor thesis, Manchester 62 Metropolitan University, Manchester, 2017 6. M. Chand, M. Goel and S. Rathore, “Maze Solving Algorithms.” Internet: http://citeseerx. ist.psu.edu/viewdoc/download?doi=10.1.1.302.4944&rep=rep1&type=pdf, Mar. 20, 2016 [Aug. 18, 2017]. 7. E. Weissmann , “Amazing Maze: What Science Says About Solving Labyrinths.” Internet: https://news.nationalgeographic.com/news/2014/07/140730-science- mazes-labyrinth-brain-neuroscience/, Jul. 31, 2014 [Aug. 18, 2017]. 8. T. De, “The Inception of Chedda: A detailed design and analysis of Micromouse.”, University of Nevada, Las Vegas, Las Vegas, 2004. 9. M. Tak and S. Datta, “A Comprehensive and Comparative Study of Maze-Solving Techniques by implementing Graph Theory- implementation of Djikstra’s algorithm for solving a maze”, International Journal of Engineering Trends and Technology, vol. 28, no. 2, pp. 61-64, 2015. 10.N. Yew, K. Tiong and S. Yong, “Recursive Path-finding in a Dynamic Maze with Modified Tremaux’s Algorithm”, International Journal of Mathematical, Computational, Physical, Electrical and Computer Engineering, vol. 5, no. 12, pp. 1-1, 2011. 11.B. Gupta and S. Sehgal, “Survey on techniques used in Autonomous Maze Solving Robot”, 2014 5th International Conference - Confluence The Next Generation Information Technology Summit (Confluence), 2014. 12.K. Sharma and C. Munshi, “A Comprehensive and Comparative Study Of Maze- Solving Techniques by Implementing Graph Theory”, IOSR Journal of Computer Engineering (IOSR-JCE), vol. 17, no. 1, pp. 24-29, 2015. 13.P. Norvig and S. Russell, Artificial Intelligence: A Modern Approach, 2nd ed. Upper Saddle River, New Jersey: Prentice Hall, 2003, pp. 94-136. 14.P. Jarušek and R. Pelánek, “Human Problem Solving: Sokoban Case Study”, FI MU Report Series, pp. 4-4, 2010. 15. M. Yoshitaka and M. Yoshihiro. A Study of Shortest Path Algorithms in Maze Images. In SICE Annual Conference, 2011. 16.A. Abahai T., “Optimized AO* Algorithm for and-OR Graph Search”, IOSR Journal of Computer Engineering (IOSR-JCE), vol. 17, no. 4, pp. 124-127, 2015. 17.R. Marín, A. Bugarín, E. Onaindía and J. Santos, Current Topics in Artificial Intelligence, 1st ed. Berlin Heidelberg: Springer-Verlag GmbH., 2006. 18.O. Kathe, V. Turkar, A. Jagtap and G. Gidaye, “Maze solving robot using image 63 processing”, 2015 IEEE Bombay Section Symposium (IBSS), 2015. 19.B. Rahnama, “An image processing approach to solve Labyrinth Discovery robotics problem”, in 36th International Conference on Computer Software and Applications Workshops, Izmir, Turkey, 2012. 20.S. Sonavane and N. Choubey, “Maze solver with Imaging”, Shirpur, India, 2014. 21.B. Chitradevi and P. Srimathi, “An Overview on Image Processing Techniques”, International Journal of Innovative Research in Computer and Communication Engineering, vol. 2, no. 11, pp. 6466-6472, 2014. 22.R. Adhami, P. Meenen and D. Denis Hite, Fundamental Concepts in Electrical and Computer Engineering with Practical Design Problems, 2nd ed. Boca Raton, Florida: Universal Publishers, 2017, p. 497. 23. M. Nagu and N. Shanker, “Image De-Noising By Using Median Filter and Weiner Filter”, International Journal of Innovative Research in Computer and Communication Engineering, vol. 2, no. 9, pp. 5641-5649, 2014. 24. M. Chandrakala, “Quantitative Analysis of Local Adaptive Thresholding Techniques”, International Journal of Innovative Research in Computer and Communication Engineering, vol. 4, no. 5, pp. 8432-8439, 2016. 25. N. Khanyile, J. Tapamo and E. Dube, “A Comparative Study of Fingerprint Thinning algorithms”, in Information Security South Africa Conference, Johannesburg, South Africa, 2011 26.D. Salmon, The Computer Graphics Manual. Springer-Verlag London Limited, 2011, pp. 1001-1004. 27. J. He, Q. Do, A. Downton and J. Kim, “A comparison of binarization methods for historical archive documents”, Eighth International Conference on Document Analysis and Recognition (ICDAR’05), 2005 28. T. Y. Zhang and C. Y. Suen, “A Fast Parallel Algorithm for Thinning Digital Patterns”, Communications of the ACM, Vol. 27, No. 3, 198 29.Q. Acton, Algorithms-Advances in Research and Application. Atlanta, Georgia: ScholarlyEditions, 2013, p. 412.