<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Artificial neural network technology for text recognition</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Anna V. Pyataeva</string-name>
          <email>anna4u@list.ru</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Sergey A. Genza</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Reshetnev Siberian State University of Science and Technology</institution>
          ,
          <addr-line>Krasnoyarsk</addr-line>
          ,
          <country country="RU">Russia</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Siberian Federal University</institution>
          ,
          <addr-line>Krasnoyarsk</addr-line>
          ,
          <country country="RU">Russia</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>The paper shows the use of artificial neural networks for the task of scene text recognition. A comparative analysis of the effectiveness of the use of various neural network architectures was presented. Experimental studies were performed on the MNIST, IIIT 5K, SVT and Synth 90k datasets. Nowadays, a lot of work in the framework of computer technology based on deep learning methods is devoted to the subject of text recognition [1-4]. Irregular text is widely used. However, it is considerably difficult to recognize because of its various shapes and distorted patterns. [5]. Examples of scene text can be photographs of street signs, stills from movies with subtitles, data in robot navigation systems, etc. Among deep learning methods, convolutional neural networks (CNN) are the most studied [6-11]. Often, a popular MNIST dataset, which is a database of handwritten text samples, is used to conduct experimental research in text detection works. In [12], modifications of convolutional neural networks were studied to improve the accuracy of the classification of handwritten numbers. Authors [13] seek to characterize the learning architectures exploited in biological neural networks for training on very few samples, and port these algorithmic structures to a machine learning context. They carried out modeling of the structure of the neural network of smell of moths, then the created computational models are taught to read handwritten numbers. Most methods based on convolutional neural networks extract image features at the last level of the network using a single CNN architecture with an unlimited number of quantization approaches. What limits the use of intermediate layers to identify local features of the image.</p>
      </abstract>
      <kwd-group>
        <kwd>convolutional neural network</kwd>
        <kwd>text recognition</kwd>
        <kwd>MNIST dataset</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <p>calculated, where the summands are the product of the pixel values on the values of the kernel cell that covered the
pixel. The sum is divided by the sum of all elements of the convolution kernel. The resulting value is the new value of
the selected pixel. By applying a convolution operation to each pixel of the image produces an effect that depends on
the selected convolution kernel. In this work, we have constructed CNN for the task of recognizing handwriting in
Arabic numerals and the scene text recognition.
2.1</p>
      <sec id="sec-1-1">
        <title>Text recognition by MNIST</title>
        <p>Neural networks of the following architectures have been developed to recognize handwritten digits.
2.1.1</p>
      </sec>
      <sec id="sec-1-2">
        <title>Architecture 1. Neural network with two full connection layers</title>
        <p>- First fully connected layer, ReLU activation function, 512 neurons;
- Second fully connected layer, Softmax activation function, 10 neurons;
- Cross-entropy loss function.
2.1.2</p>
      </sec>
      <sec id="sec-1-3">
        <title>Architecture 2. Neural network with three full connection layers</title>
        <p>- First fully connected layer, ReLU activation function, 1024 neurons;
- Second fully connected layer, ReLU activation function, 512 neurons;
- Third fully connected layer, Softmax activation function, 10 neurons;
- Cross-entropy loss function.
2.1.4</p>
        <p>
          Architecture 3. Convolutional Neural Network with two Dropout Layers
- First convolution layer, ReLU activation function, convolution kernel 5x5, (28, 28, 32);
- Second convolution layer, ReLU activation function, convolution kernel 5x5, (28, 28, 32);
- First max-pooling layer, kernel 2х2, step 2x2, (
          <xref ref-type="bibr" rid="ref14 ref14">14, 14, 32</xref>
          );
- First Dropout layer, neurons dropout probability is 0.5;
- Third convolution layer, ReLU activation function, convolution kernel 3x3, (
          <xref ref-type="bibr" rid="ref14 ref14">14, 14, 64</xref>
          );
- Fourth convolution layer, ReLU activation function, convolution kernel 3x3, (
          <xref ref-type="bibr" rid="ref14 ref14">14, 14, 64</xref>
          );
- Second max-pooling layer, kernel 2х2, step 2x2, (
          <xref ref-type="bibr" rid="ref7 ref7">7, 7, 64</xref>
          );
- Second Dropout layer, neurons dropout probability is 0.5;
- First fully connected layer, ReLU activation function, 256 neurons;
- Second fully connected layer, Softmax activation function, 10 neurons;
- Cross-entropy loss function.
2.1.4
        </p>
        <p>
          Architecture 3. Convolutional neural network with thee Batch Normalization layers
- First convolution layer, ReLU activation function, convolution kernel 5x5, (28, 28, 32);
- Second convolution layer, ReLU activation function, convolution kernel 5x5, (28, 28, 32);
- First Batch Normalization layer;
- First max-pooling layer, kernel 2х2, step 2x2, (
          <xref ref-type="bibr" rid="ref14 ref14">14, 14, 32</xref>
          );
- Third convolution layer, ReLU activation function, convolution kernel 3x3, (
          <xref ref-type="bibr" rid="ref14 ref14">14, 14, 64</xref>
          );
- Fourth convolution layer, ReLU activation function, convolution kernel 3x3, (
          <xref ref-type="bibr" rid="ref14 ref14">14, 14, 64</xref>
          );
- Second Batch Normalization layer;
- Second max-pooling layer, kernel 2х2, step 2x2, (
          <xref ref-type="bibr" rid="ref7 ref7">7, 7, 64</xref>
          );
- First fully connected layer, ReLU activation function, 256 neurons;
- Third Batch Normalization layer;
- Second fully connected layer, Softmax activation function, 10 neurons;
- Cross-entropy loss function.
        </p>
        <p>The input gray-scale image of size 28x28 pixels (for neural networks without the convolutional layers have to be
reduced to the vector of size 784) were subjected to normalization by aligning interval of the brightness values of the
pixels to the range from 0 to 1. This image was sent to the input of the neural network along with the corresponding
class label. The class label was converted into a unitary code (one-hot encoding) before being fed to the network input
for the correct operation of the Softmax function and the cross-entropy function. Adam was chosen as the optimizer
with a training step of 0.001, the batch size, for which a one-time adjustment of the scales is 128. The network
weights before training are initialized to normally distributed values with a mathematical expectation of 0 and a
standard deviation of 0.1. The bias of the layers is initialized to zero. For extreme pixels in convolutional layers, the
values are automatically filled with zeros to obtain the same dimension at the output of the layer as at the input.</p>
        <p>To solve the problem of scene text recognition, it is proposed to use a combination of a convolutional neural
network, a recurrent neural network (RNN) [16, 17], and Connectionist Temporal Classification (CTC-loss) [3].
Feature extraction using a convolutional neural network is shown in Figure 1.</p>
        <p>The output of the convolutional network is a three-dimensional array that must be converted to a two-dimensional
array, the second dimension of which must be equal to the maximum number of characters in the input image. After
conversion, each column of the matrix is fed to the input of the corresponding LSTM-cell. The recurrent layer is used
to represent the input features as a sequence and the network recognizes the characters exactly in the order in which
they appear in the search text. Each vector is transferred to a fully connected layer and to the Softmax activation
function. The dimension of a fully connected layer is equal to the length of the array of all possible recognizable
characters with the addition of a blank marker. This marker CTC-loss algorithm uses to indicate the absence of a
character in the text, because most of all input sequences of characters will be less in length than the maximum
possible. The softmax function represents the input vector as a probability distribution vector for all possible symbols,
including a blank symbol marker. The principle of the recurrent layer is shown in Figure 2.</p>
        <p>Thus, the output is a matrix with distributed Softmax function by probability columns, where the number of
columns is the maximum possible word length, and the number of rows is the length of the “alphabet” L + 1
(blankmarker). This matrix is input to a decoding algorithm that removes all duplicate characters, and then blank markers.
The final alphabet is the set of all possible characters in a word and a blank marker by Eq.2:</p>
        <p>
          L  L {blank}.
(
          <xref ref-type="bibr" rid="ref2">2</xref>
          )
        </p>
        <p>The probability of the path Y is equal to the product of the probabilities of all activated cells of each column of the
matrix:</p>
        <p>T
p(Y )  t1 yYtt , YL'.</p>
        <p>Example of calculating the probability of the path “ap-pl-ee”:</p>
        <p>p("ap plle)"  y1a y2p  y3 y4p  yl5 y6  ye7 ye8 .</p>
        <p>The decoding algorithm is shown in Figure 3. Many paths always correspond to one word, and to calculate the
probability of a word, it is necessary to calculate the sum of the probabilities for all possible paths.</p>
        <p>The error function is similar to binary cross-entropy, only the word probability is used here as the class probability
by Eq 4.</p>
        <p>CTCloss  ln( p("apple")) .</p>
        <p>For the considered example, in which the alphabet consists of 6 characters, and the maximum number of
characters is 8, the number of possible paths is 68 = 1679616 possible paths. When solving practical problems, the
length of the alphabet and the maximum number of characters are significantly larger. Therefore, dynamic
programming is used to calculate the word probability. The word probability value is used in the back propagation
algorithm.
2.2.1</p>
      </sec>
      <sec id="sec-1-4">
        <title>Architecture 5. Convolutional Recurrent Neural Network with CTC loss</title>
        <p>For scene text recognition developed a neural network combining convolutional, recurrent layers and CTC error
function (CRNN). Details of the CRNN architecture are given below.</p>
        <p>
          - First convolution layer, ReLU activation function, convolution kernel 3x3, (31, 100, 64);
- First max-pooling layer, kernel 2х2, step 2x2, (
          <xref ref-type="bibr" rid="ref16">16, 50, 64</xref>
          );
- Second convolution layer, ReLU activation function, convolution kernel 3x3, (
          <xref ref-type="bibr" rid="ref16">16, 50, 128</xref>
          );
- Second max-pooling layer, kernel 2х2, step 2x2, (
          <xref ref-type="bibr" rid="ref25 ref8">8, 25, 128</xref>
          );
- Third convolution layer, ReLU activation function, convolution kernel 3x3, (
          <xref ref-type="bibr" rid="ref25 ref8">8, 25, 256</xref>
          );
- First Batch Normalization layer;
- Fourth convolution layer, ReLU activation function, convolution kernel 3x3, (
          <xref ref-type="bibr" rid="ref25 ref8">8, 25, 256</xref>
          );
- Third max-pooling layer, kernel 2х2, step 2x2, (
          <xref ref-type="bibr" rid="ref13 ref8">8, 13, 256</xref>
          );
- Fifth convolution layer, ReLU activation function, convolution kernel 3x3, (
          <xref ref-type="bibr" rid="ref13 ref8">8, 13, 512</xref>
          );
- Second Batch Normalization layer;
- Fifth convolution layer, ReLU activation function, convolution kernel 3x3, (
          <xref ref-type="bibr" rid="ref13 ref8">8, 13, 512</xref>
          );
- Sixth convolution layer, ReLU activation function, convolution kernel 3x3, (
          <xref ref-type="bibr" rid="ref13 ref8">8, 13, 512</xref>
          );
- Fourth max-pooling layer, kernel 2х2, step 1x2, (
          <xref ref-type="bibr" rid="ref7 ref8">8, 7, 512</xref>
          );
- Seventh convolution layer, ReLU activation function, convolution kernel 3x3, (
          <xref ref-type="bibr" rid="ref7 ref8">8, 7, 512</xref>
          );
- Reshape- layer, (56, 512);
- First bidirectional-LSTM layer, (256, 256);
- Second bidirectional-LSTM layer, (256, 256);
- First fully connected layer, Softmax activation function;
- CTC – loss layer.
        </p>
        <p>
          As an optimizer, Adam was chosen with a training step of 0.001, the batch size for which there is a one-time
adjustment of weights is 64. The length of the alphabet is 43 characters, the maximum possible length of the word is
16 characters. The network weights before training are initialized to normally distributed values with a mathematical
expectation of 0 and a standard deviation of 0.1. For extreme pixels in convolutional layers, use automatic zero-fill to
get the output layer of the same dimension as the input. The input image was reduced to the size of 31x100 pixels in
grayscale, and then fed to the neural network input along with the corresponding word.
(
          <xref ref-type="bibr" rid="ref2">2</xref>
          )
(
          <xref ref-type="bibr" rid="ref3">3</xref>
          )
(
          <xref ref-type="bibr" rid="ref4">4</xref>
          )
        </p>
      </sec>
    </sec>
    <sec id="sec-2">
      <title>Experimental and results</title>
      <p>Experimental studies were performed on the test set of MNIST and for scene text images separately. For
experimental research, a computer program was developed in the Python programming language using the
Tensorflow [18] framework.</p>
      <p>For experimental studies, the MNIST dataset [19] (Modified National Institute of Standards and Technology) – a
database of samples of handwriting numbers was used. Images from this dataset are processed images from another
dataset - NIST. NIST samples had a dimension of 20x20 and were taken from the U.S. census Bureau with the
addition of test samples written by students of American universities, and then were normalized, smoothed and
reduced to the size of 28x28 pixels. MNIST database contains 60000 training and 10000 test gray-scale images of
size 28x28 Examples of images are shown in Figure 4.</p>
      <p>According to the results of the experiment on the test part of the MNIST data set, the maximum accuracy for the
best epoch was 99.6%. Such precision showed a convolutional neural network with thee Batch Normalization layers
on mini-batchas, this network converges significantly faster than others, while having the highest total precision</p>
      <sec id="sec-2-1">
        <title>Scene text recognition</title>
        <p>In this paper, the dataset Synth 90k, proposed and developed in the article, is used to train neural networks [1].
This dataset is a program-generated image in grayscale, variable width and 31 pixel height. The training part of the
set contains more than 7 million images with 90 thousand unique English words. Image Samples from Synth 90k
dataset are presented in Figure 6.</p>
        <p>Two data sets were used to recognize text using a trained network: IIIT 5K [20] and Street View Text - SVT [21].
The IIIT 5K dataset is localized text in photographs of storefronts, billboards, advertisements, street signs, etc. The
dataset contains 2000 training and 3000 test images. Image Samples from IIIT 5K dataset are presented in Figure 7.</p>
        <p>Images with text on storefronts, billboards, signs of various institutions also prevail in the SVT dataset. This
dataset contains 249 images of graphic scenes and 647 images of localized text. Image Samples from SVT dataset are
presented in Figure 8.</p>
        <p>Training sample was 80%, test 20% of the total number of images. The neural network was trained 1 epoch using
7 224 612 images from the Synth 90k dataset. Used graphics processor NVIDIA GeForce GTX 650, the learning
process took 110 hours. Figure 9 shows the results of an experimental study to solve the scene text recognition
problem using various data sets. The Synth 90k dataset used for training.</p>
        <p>The comparison of the obtained results scene text recognition accuracy with the results of other authors was
implemented using IIIT5K and SVT datasets. The comparative values are placed in Table 2.</p>
        <p>Conclusions
50 words
24.3
64.1
95.5
97.6
99.5
96.7</p>
        <p>IIIT5K
1000
words
57.5</p>
        <p>The paper presents the application of artificial neural network technologies for the problem of text recognition.
Comparison of various neural network architectures to recognition for handwritten digits from the MNIST dataset has
been carried out. The best accuracy was shown by the сonvolutional neural network with three Batch Normalization
layers. A further development of this approach is scene text recognition. Scene text images are characterized by the
absence of clear criteria for distinguishing the background from the text, the heterogeneity of the background, the
high probability of various distortions and noise. Such text can be of variable quality, different font, slope, shape,
thickness and texture. The neural network architecture combining convolutional, recurrent layers and CTC error
function is proposed for recognition of such text. At the stage of experimental research, the effectiveness of the
developed CRNN was compared with the data of other authors. Experimental studies conducted on specialized
datasets confirm the validity of the use of technologies convolution neural networks for text recognition tasks.</p>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <surname>Jaderberg</surname>
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Simonyan</surname>
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vedaldi</surname>
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zisserman</surname>
            <given-names>A</given-names>
          </string-name>
          .
          <article-title>Reading Text in the Wild with Convolutional Neural Networks //</article-title>
          <source>International Journal of Computer Vision</source>
          .
          <year>2016</year>
          . P. 1-
          <fpage>20</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <surname>Graves</surname>
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Fernandez</surname>
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gomez</surname>
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schmidhuber</surname>
            <given-names>J</given-names>
          </string-name>
          .
          <article-title>Connectionist Temporal Classification: Labelling Unsegmented Sequence Data with Recurrent Neural Networks //</article-title>
          <source>ICML '06 Proceedings of the 23rd international conference on Machine learning</source>
          .
          <year>2006</year>
          . P.
          <volume>369</volume>
          -
          <fpage>376</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <surname>Shi</surname>
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bai</surname>
            <given-names>X.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yao</surname>
            <given-names>C.</given-names>
          </string-name>
          <article-title>An End-to-End Trainable Neural Network for Image-based Sequence Recognition and Its Application to Scene Text Recognition //</article-title>
          <source>IEEE Transactions on Pattern Analysis and Machine Intelligence</source>
          .
          <year>2015</year>
          . P.
          <volume>99</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <surname>Bissacco</surname>
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cummins</surname>
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Netzer</surname>
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Neven</surname>
            <given-names>H.</given-names>
          </string-name>
          <string-name>
            <surname>Photoocr</surname>
          </string-name>
          : Reading text in uncontrolled conditions // ICCV.
          <year>2013</year>
          . P.
          <volume>785</volume>
          -
          <fpage>792</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <surname>Luo</surname>
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jin</surname>
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sun Z. MORAN:</surname>
          </string-name>
          <article-title>A Multi-Object Rectified Attention Network for scene text recognition // Pattern Recognition</article-title>
          .
          <year>2019</year>
          . Vol.
          <volume>90</volume>
          . P.
          <volume>109</volume>
          -
          <fpage>118</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <surname>Zheng</surname>
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Iwana</surname>
            <given-names>B.K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Uchida</surname>
            <given-names>S. Mining</given-names>
          </string-name>
          <article-title>the displacement of max-pooling for text recognition // Pattern Recognition</article-title>
          .
          <year>2019</year>
          . Vol.
          <volume>93</volume>
          . P.
          <volume>558</volume>
          -
          <fpage>596</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <surname>Banerjee</surname>
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ling</surname>
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chen</surname>
            <given-names>M.C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hasa</surname>
            <given-names>S.A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Langlotz</surname>
            <given-names>C.P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Moradzadeh</surname>
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chapman</surname>
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Amrhein</surname>
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mong</surname>
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rubin</surname>
            <given-names>D.L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Farri</surname>
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lungren</surname>
            <given-names>M.P.</given-names>
          </string-name>
          <article-title>Comparative effectiveness of convolutional neural network (CNN) and recurrent neural network (RNN) architectures for radiology text</article-title>
          report classification // Artificial Intelligence in Medicine.
          <year>2019</year>
          . Vol.
          <volume>97</volume>
          . P.
          <volume>79</volume>
          -
          <fpage>88</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <surname>Gu</surname>
            <given-names>J.</given-names>
          </string-name>
          , Wang
          <string-name>
            <given-names>Z.</given-names>
            ,
            <surname>Kuen</surname>
          </string-name>
          <string-name>
            <given-names>J.</given-names>
            , Ma L.,
            <surname>Sharoudy</surname>
          </string-name>
          <string-name>
            <given-names>A.</given-names>
            ,
            <surname>Shuai</surname>
          </string-name>
          <string-name>
            <given-names>B.</given-names>
            , Liu t.,
            <surname>Wang</surname>
          </string-name>
          <string-name>
            <given-names>X.</given-names>
            ,
            <surname>Wang</surname>
          </string-name>
          <string-name>
            <given-names>G.</given-names>
            ,
            <surname>Cai</surname>
          </string-name>
          <string-name>
            <surname>J.</surname>
          </string-name>
          ,
          <source>Chen T. Recent Advances in Convolutional Neural Networks // Pattern Recognition</source>
          .
          <year>2018</year>
          . Vol.
          <volume>77</volume>
          .
          <string-name>
            <surname>Issue</surname>
            <given-names>C. P.</given-names>
          </string-name>
          354-
          <fpage>377</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <surname>Parkhi</surname>
            <given-names>O.M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vedaldi</surname>
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zisserman</surname>
            <given-names>A</given-names>
          </string-name>
          .
          <source>Deep face recognition // Proceedings of the British Machine Vision Conference (BMVC)</source>
          .
          <year>2015</year>
          . Vol.
          <volume>1</volume>
          . P.
          <volume>41</volume>
          .
          <fpage>1</fpage>
          -
          <lpage>41</lpage>
          .
          <fpage>12</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <surname>Wang</surname>
            <given-names>H.</given-names>
          </string-name>
          , He
          <string-name>
            <given-names>Z.</given-names>
            ,
            <surname>Huang</surname>
          </string-name>
          <string-name>
            <given-names>Y.</given-names>
            ,
            <surname>Chen</surname>
          </string-name>
          <string-name>
            <surname>D.</surname>
          </string-name>
          , Zhou Z.
          <article-title>Bodhisattva head images modeling style recognition of Dazu Rock Carvings based on deep convolutional network //</article-title>
          <source>Journal of Cultural Heritage</source>
          .
          <year>2017</year>
          . Vol.
          <volume>27</volume>
          . P.
          <volume>60</volume>
          -
          <fpage>71</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <surname>Kinghorn</surname>
            <given-names>P.</given-names>
          </string-name>
          , Zhang L.,
          <string-name>
            <surname>Shao L</surname>
          </string-name>
          .
          <article-title>A Hierarchical and Regional Deep Learning Architecture for Image Description Generation /</article-title>
          / Pattern Recognition Letters // Pattern Recognition Letters.
          <year>2019</year>
          . Vol.
          <volume>119</volume>
          . P.
          <volume>77</volume>
          -
          <fpage>85</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <surname>Alevar-Sandoval R</surname>
          </string-name>
          .F.,
          <string-name>
            <surname>Sanco-Gomer</surname>
            <given-names>J.I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Figueiras-Vidal</surname>
            <given-names>A</given-names>
          </string-name>
          .R.
          <article-title>On improving CNNs performance: The case</article-title>
          of MNIST // Information Fusion.
          <year>2019</year>
          . Vol.
          <volume>52</volume>
          . P.
          <volume>106</volume>
          -
          <fpage>109</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <surname>Delahunt</surname>
            <given-names>C.B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kutz</surname>
            <given-names>J.N.</given-names>
          </string-name>
          <string-name>
            <surname>Putting</surname>
          </string-name>
          <article-title>a bug in ML: The moth olfactory network learns to read MNIST // Neural Networks</article-title>
          .
          <year>2019</year>
          . Vol.
          <volume>188</volume>
          . P.
          <volume>54</volume>
          -
          <fpage>64</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <surname>LeCun</surname>
            <given-names>Y.</given-names>
          </string-name>
          <article-title>Learning processes in an asymmetric threshold network</article-title>
          .
          <source>Disordered Systems and Biological Organization. NATO ASI Series (Series F: Computer and Systems Sciences)</source>
          . Springer, Berlin, Heidelberg.
          <year>1986</year>
          . Vol
          <volume>20</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <surname>LeCun</surname>
            <given-names>Y.</given-names>
          </string-name>
          <article-title>Theoretical framework for back-propagation // In Proceedings of the 1988 Connec-tionist Models Summer School</article-title>
          . Morgan Kaufmann, CMU.
          <year>1988</year>
          . P.
          <volume>21</volume>
          -
          <fpage>28</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <surname>Graves</surname>
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Fernandez</surname>
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gomez</surname>
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schmidhuber</surname>
            <given-names>J</given-names>
          </string-name>
          .
          <article-title>Connectionist Temporal Classification: Labelling Unsegmented Sequence Data with Recurrent Neural Networks //</article-title>
          <source>ICML '06 Proceedings of the 23rd international conference on Machine learning</source>
          .
          <year>2006</year>
          . P.
          <volume>369</volume>
          -
          <fpage>376</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <surname>Hochreiter</surname>
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schmidhuber</surname>
            <given-names>J..</given-names>
          </string-name>
          <string-name>
            <surname>Long</surname>
          </string-name>
          short-term memory // Neural Computation.
          <year>1997</year>
          . P.
          <volume>1735</volume>
          -
          <fpage>1780</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <article-title>An end-to-end open source machine learning platform</article-title>
          . Available at: https://www.tensorflow.org/.
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <article-title>MNIST Database of handwritten digits</article-title>
          . Available at: http://www.gavo.t.u-tokyo.ac.jp/~qiao/database.html.
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <surname>IIIT</surname>
          </string-name>
          5K
          <article-title>-word dataset</article-title>
          . Available at: http://cvit.iiit.ac.in/research/projects/cvit-projects/the-iiit
          <string-name>
            <surname>-</surname>
          </string-name>
          5k
          <string-name>
            <surname>-</surname>
          </string-name>
          word-dataset.
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <given-names>Street</given-names>
            <surname>View</surname>
          </string-name>
          <article-title>Text (SVT) dataset</article-title>
          . Available at: http://vision.ucsd.edu/~kai/svt/.
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [22]
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Babenko</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Belongie</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <article-title>End-to-end scene text recognition //</article-title>
          <source>Proc. Int. Conf. on Comp. Vision</source>
          .
          <year>2011</year>
          . P.
          <volume>1457</volume>
          -
          <fpage>1464</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          [23]
          <string-name>
            <surname>Mishra</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Alahari</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jawahar</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          <article-title>Scene text recognition using higher order language priors //</article-title>
          <source>Proc. British Machine Vision Conference</source>
          .
          <year>2012</year>
          , P.
          <fpage>1</fpage>
          -
          <lpage>11</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          [24]
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wu</surname>
            ,
            <given-names>D.J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Coates</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ng</surname>
            ,
            <given-names>A.Y.</given-names>
          </string-name>
          :
          <article-title>End-to-end text recognition with convolutional neural networks /</article-title>
          / ICPR. 2012 P.
          <fpage>3304</fpage>
          -
          <lpage>3308</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          [25]
          <string-name>
            <surname>Jaderberg</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vedaldi</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zisserman</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <article-title>Deep features for text spotting</article-title>
          // European Conference on
          <source>Computer Vision</source>
          .
          <year>2014</year>
          . P.
          <volume>512</volume>
          -
          <fpage>528</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          [26]
          <string-name>
            <surname>Wang</surname>
            <given-names>Q. Jia W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>He</surname>
            <given-names>X.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lu</surname>
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Blumenstein</surname>
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Huang</surname>
            <given-names>Y. FACLSTM:</given-names>
          </string-name>
          <article-title>ConvLSTM with Focused Attention for Scene Text Recognition // Computer Vision</article-title>
          and Pattern Recognition.
          <year>2019</year>
          . P.
          <volume>4321</volume>
          -
          <fpage>4329</fpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>