Realization of information technology of character recognition based on competing cellular automata
DOI:
https://doi.org/10.15587/1729-4061.2017.103550Keywords:
competing cellular automaton, moving cellular automaton, a Moore machine, transition graphAbstract
We examined the possibility of applying cellular automata to solve the problem on recognition of text characters. For this purpose, we introduced the notion of competing cellular automata and developed algorithms of their functioning and interaction. In order to implement the proposed algorithms, we created modeling software. It allowed us to evaluate effectiveness of the cellular-automaton algorithms to conduct experiments on text character recognition using the English alphabet and to demonstrate a number of advantages in comparison with other methods.
We investigated a description of the solution to the problem on selecting the structural attributes in the images of text characters, which directly affect the quality of recognition. In the present work, it is proposed to use a set of cellular automata constructed on the diagrams of states of Moore and Mealy machines for each type of cellular automata, to determine the end points, junctions and cycles in characters. We considered operation of the modeling program.
The advantages of the given technology are the simplicity of rules of interaction, easy parallelization of the process of recognition, the possibility of recognition of distorted and partially overlapping characters. We compared performance quality and efficiency of the commercially available system ABBYY FineReader, which has demonstrated high performance indicators of the developed recognition technologyReferences
- Zhang, P., Bui, T. D., Suen, C. Y. (2007). A novel cascade ensemble classifier system with a high recognition performance on handwritten digits. Pattern Recognition, 40 (12), 3415–3429. doi: 10.1016/j.patcog.2007.03.022
- Lauer, F., Suen, C. Y., Bloch, G. (2007). A trainable feature extractor for handwritten digit recognition. Pattern Recognition, 40 (6), 1816–1824. doi: 10.1016/j.patcog.2006.10.011
- Savas, B., Elden, L. (2007). Handwritten digit classification using higher order singular value decomposition. Pattern Recognition, 40 (3), 993–1003. doi: 10.1016/j.patcog.2006.08.004
- Zheltov, S. Yu. (2010). Obrobka ta analiz zobrazhen' v zadachakh mashynnoho zoru. Moscow: Fizmatknyha, 672.
- Potapov, A. A., Pahomov, A. A., Nikitin, S. A., Gulyaev, Yu. V. (2008). Noveyshie metody obrabotki izobrazheniy. Moscow: Fizmatlit, 496.
- Wolfram, S. (2002). A New Kind of Science. Wolfram Media. Inc., 1197.
- Oliveira, C. C., de Oliveira, P. P. B. (2008). An Approach to Searching for Two-Dimensional Cellular Automata for Recognition of Handwritten Digits. Lecture Notes in Computer Science, 462–471. doi: 10.1007/978-3-540-88636-5_44
- Suyasov, D. I. (2010). Vydelenie strukturnyh priznakov izobrazheniy simvolov na osnove kletochnyh avtomatov s metkami. Programmnye i apparatnye, 4, 39–45.
- Wu, H., Zhou, J., Gong, X., Wen, Y., Li, B. (2011). A new JPEG image watermarking algorithm based on cellular automata. Journal of Information & Computational Science, 8 (12), 2431–2439.
- Belan, S. N. (2011). Specialized cellular structures for image contour analysis. Cybernetics and Systems Analysis, 47 (5), 695–704. doi: 10.1007/s10559-011-9349-8
- Myroniv, I. V., Ostapov, S. E., Myroniv, I. V. (2010). Rozrobka ta doslidzhennya alhorytmu rozpiznavannya symvoliv tekstu na osnovi konkuruyuchykh klitynnykh avtomativ. Naukovyy visnyk Chernivets'koho natsional'noho universytetu imeni Yuriya Fed'kovycha. Seriya: Komp"yuterni systemy ta komponenty, 1 (2), 47–52.
- Zhykharevych, V. V., Ostapov, S. E., Myroniv, I. V. (2016). Analiz metodiv rozpiznavannya symvoliv tekstu. Radioelektronni i komp'yuterni systemy, 5, 137–142.
- Zhykharevych, V. V., Myroniv, I. V., Ostapov, S. E. (2015). Alhorytm rozpiznavannya symvoliv tekstu na osnovi konkuruyuchykh klitynnykh avtomativ. Radioelektronika, Informatyka, Upravlinnya, 4 (35), 31–45.
- Myroniv, I., Zhikharevich, V., Ostapov, S. (2016). Development of the character recognition software on the base cellular authomata. Engineer of XXI Century, 229–240.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2017 Ivan Myroniv, Vladimir Zhikharevich, Sergey Ostapov
This work is licensed under a Creative Commons Attribution 4.0 International License.
The consolidation and conditions for the transfer of copyright (identification of authorship) is carried out in the License Agreement. In particular, the authors reserve the right to the authorship of their manuscript and transfer the first publication of this work to the journal under the terms of the Creative Commons CC BY license. At the same time, they have the right to conclude on their own additional agreements concerning the non-exclusive distribution of the work in the form in which it was published by this journal, but provided that the link to the first publication of the article in this journal is preserved.
A license agreement is a document in which the author warrants that he/she owns all copyright for the work (manuscript, article, etc.).
The authors, signing the License Agreement with TECHNOLOGY CENTER PC, have all rights to the further use of their work, provided that they link to our edition in which the work was published.
According to the terms of the License Agreement, the Publisher TECHNOLOGY CENTER PC does not take away your copyrights and receives permission from the authors to use and dissemination of the publication through the world's scientific resources (own electronic resources, scientometric databases, repositories, libraries, etc.).
In the absence of a signed License Agreement or in the absence of this agreement of identifiers allowing to identify the identity of the author, the editors have no right to work with the manuscript.
It is important to remember that there is another type of agreement between authors and publishers – when copyright is transferred from the authors to the publisher. In this case, the authors lose ownership of their work and may not use it in any way.
