Abstract
Memetic algorithms (MAs) are basically optimization algorithms which fully exploit the problem under consideration. This paper describes the character recognition problem using traditional approach, genetic algorithm approach and memetic algorithm approach. It also describes the basic architecture of MA and elaborates the memetic algorithm based approach to character recognition. The comparison with traditional approach and genetic algorithm approach shows that MA remarkably reduces the error rate. This paper is useful for the beginners who apply nature based computing in character recognition.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Krasnogor, N., Smith, J.: A tutorial for competent memetic algorithms model taxonomy and design issues. IEEE Trans. Evol. Comput. 9(5), 474–488 (2005)
Moscato, P.: On evolution, search, optimization, GAs and martial arts: toward memetic algorithms California Inst. Technol. Pasadena, CA, Tech. Rep. Caltech Concurrent Comput. Prog. Rep. 826 (1989)
He, M.: Hybrid genetic algorithms for telecommunications network back-up routing. BT Technol. J. 18(4), 42–56 (2000)
Vazquez, M., Whitley, L.: A hybrid genetic algorithm for the quadratic assignment problem. In Proceedings Genetic Evolutionary Computation Conference, pp. 135–142 (2000)
Fleurent, C., Ferland, J.: Genetic hybrids for the quadratic assignment problem. In: DIMACS, Series in Discrete Mathematics and Theoretical Computer Science. Providence, RI: American Math. Soc. (1993)
Merz, P.: Memetic algorithms for combinatorial optimization problems: Fitness landscapes and effective search strategies. Ph.D. Dissertation, Parallel Syst. Res. Group, Dept. Elec. Eng. Comput. Sci., Univ. Siegen, Siegen, Germany, (2000)
Morris, G.M., Goodsell, D.S., Halliday, R.S., Huey, R., Hart, W.E., Belew, R.K., Olson, A.J.: Automated docking using a lamarkian genetic algorithm and an empirical binding free energy function. J. Comput. Chem. 14, 1639–1662 (1998)
Ku, K.W., Mak, M.W.: Empirical analysis of the factors that affect the baldwin effect. In: Eiben, A.E., Bäck, T., Schoenauer, M., Schwefel, H.-P. (eds.) PPSN 1998. LNCS, vol. 1498, pp. 481–490. Springer, Heidelberg (1998)
Plamondan, R., Shrihari, S.N.: Online and offline handwriting recognition: a comprehensive survey. IEEE Trans. Pattern Anal. Mach. Intell. 22(1), 63–84 (2000)
Roberto, J.: Rodrigues and antonio carlos gay thome: cursive character recognition – a character segmentation method using projection profile-based technique. In: 6th International Conference on Information System, Analysis and Synthesis – ISAS (2000)
Latesh Malik, P.S.: Deshpande & Sandhya Bhagat: Character recognition using relationship between connected segments and neural network. Wseas Trans. Comput. 5(1), 3 (2006)
Minimum Edit Distance. http://www.merriampark.com/ld.htm
Bazzoli, A., Tettamanzi, A.G.: A memetic algorithm for protein structure prediction in a 3D-Lattice HP model. In: Raidl, G.R., Cagnoni, S., Branke, J., Corne, D.W., Drechsler, R., Jin, Y., Johnson, C.G., Machado, P., Marchiori, E., Rothlauf, F., Smith, G.D., Squillero, G. (eds.) EvoWorkshops 2004. LNCS, vol. 3005, pp. 1–10. Springer, Heidelberg (2004)
Alegre, J.F., Alvarez, A., Casado, S., Pacheco, J.A.: Use of Memetic Algorithms To Solve A Stochastic Location Model, Health Resources For Diabetics In Some Provinces Of Castilla Leon. XIII Jornadas de, ASEPUMA (2005)
Smith, J.: Genetic Algorithms: Simulating Evolution on the Computer. Part 1 (2002)
Altntas, C., Asta, S., Ozcan, E., Yigit, T.: A self-generating memetic algorithm for examination timetabling. In: 10th International Conference of the Practice and Theory of Automated Timetabling, pp. 26–29 (2014)
Ye, T., Wang, T., Lu, Z., Hao, J.-K.: A Multi-parent Memetic Algorithm for the Linear Ordering Problem. arXiv preprint arXiv:1405.4507 (2014)
Martínez-Salazar, I., Molina, J., Caballero, R.: Francisco, Ángel-Bello: memetic algorithms for solving a bi-objective transportation location routing problem. In: Proceedings of the 2014 Industrial and Systems Engineering Research Conference (2014)
Rehman, A., Saba, T.: Off-Line cursive script recognition: current advances, comparisons and remaining problems. Artif. Intell. Rev. 37, 261–288 (2012)
Verma, B., Blumenstein, M.: Pattern Recognition Technologies and Applications: Recent Advances (An Imprint of IGI Global Publications), pp. 1–16. Information Science Reference. Hershey, New York (2008)
Alginahi, Y.: Preprocessing techniques in character recognition, character recognition. In: Minoru M. (ed.), ISBN: 978-953-307-105-3, Techopen Publishers, pp. 1–20 (2010)
Senior, A.W., Robinson, A.J.: An offline cursive handwriting recognition system. IEEE Trans. Pattern Anal. Mach. Intell. 20(3), 309–321 (1998)
Gatos, B., Pratikakis, S.J.: Perantonis: hybrid offline cursive handwriting word recognition. In: 18th International Conference on Pattern Recognition (ICPR 2006), pp. 998–1002 (2006)
Blumenstein, M., Liu, X.Y., Verma, B.: A modified direction feature for cursive character recognition. PR 40(2), 376–388 (2007)
Cheng, C.K., Liu, X.X., Blumenstein, M., Marasamy, V.M.: Enhancing neural confidence based segmentation for cursive handwriting recognition. In: SEAL 04 and 2004 FIRA Robot World Congress (2004)
Bozinovic, R.M., Shrihari, S.N.: Offline cursive script word recognition. IEEE Trans. Pattern Anal. Mach. Intell. 11(1), 68–83 (1989)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Welekar, R., Thakur, N.V. (2015). Memetic Algorithm Used in Character Recognition. In: Panigrahi, B., Suganthan, P., Das, S. (eds) Swarm, Evolutionary, and Memetic Computing. SEMCCO 2014. Lecture Notes in Computer Science(), vol 8947. Springer, Cham. https://doi.org/10.1007/978-3-319-20294-5_55
Download citation
DOI: https://doi.org/10.1007/978-3-319-20294-5_55
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-20293-8
Online ISBN: 978-3-319-20294-5
eBook Packages: Computer ScienceComputer Science (R0)