<!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>Neural Networks for Recognition of Semiographic Chants</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Andrey Philippovich</string-name>
          <email>aphilippovich@it-claim.ru</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Boynov Maxim</string-name>
          <email>mboynov@it-claim.ru</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Bauman Moscow State Technical University</institution>
          ,
          <addr-line>Moscow</addr-line>
          ,
          <country country="RU">Russia</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>University of mechanical engineering</institution>
          ,
          <addr-line>Moscow</addr-line>
          ,
          <country country="RU">Russia</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>The paper presents research on the problem of recognition of signs applied to the analysis of basic units of ancient Russian chants. For testing, we take two types of deep neural networks: Back Propagation Neural Network (BPNN) and Convolution Neural Network (CNN). We investigate main features of the chant units and the properties of the networks to choose the best structure and algorithm. The results provide an analysis of accuracy for both approaches used in solving this particular task.</p>
      </abstract>
      <kwd-group>
        <kwd>Image Recognition</kwd>
        <kwd>Neural Networks</kwd>
        <kwd>Deep Learning</kwd>
        <kwd>Semiography</kwd>
        <kwd>BPNN</kwd>
        <kwd>CNN</kwd>
        <kwd>Ancient Russian Musical Manuscripts</kwd>
        <kwd>Znamenny Notation</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <p>One of the most important and prominent tasks in the study of ancient Russian
culture is the exploration of melodic content in vocal music manuscripts from the
XII-XVII centuries. The melodies in these books are written using special musical
structures that evolved in Russia over the centuries. The concept «semiography»
is understood to mean the conventionally accepted methods of musical writing
and expression of certain musical sounds and how they are related. Fig. 1 shows
a fragment of a semiographic chant.</p>
      <p>
        Music chants written by Znamenny Notation contain rows of semiographic
signs (znamyas, flags) and rows of words divided by syllables. Every semiographic
sign has special type of marks “Pometa”. These marks indicate the duration
and amplitude of the music [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. The paper presents research on the problem of
recognition of these marks with artificial deep neural networks. The novelty of
the article is to present processing algorithms and train networks on obtained
images after processing algorithms.
      </p>
    </sec>
    <sec id="sec-2">
      <title>Materials and methods</title>
      <sec id="sec-2-1">
        <title>Dataset</title>
        <p>There are seven most common types of pometas (see Table 1). Dataset is
generated by our program and includes 488 images. It was randomly divided into 2
separate sets: training and test. The training set had 70 percents of the
examples and the remaining 30 persents formed test set. Program automatically cuts
pometas from full image. Fig. 2 shows how program handles fragment of image.
At first the program cuts the characters using an algorithm developed by us.
The essence of the algorithm is to extract the image area and calculate standard
deviation3in this area. If the value is greater than the value specified by us on
the next layer of all the pixel values fall, if not then the next layer gets nothing.
After this treatment, there is a noise that is removed by another algorithm is
based on identifying the character contour. If the character contour size more
than a certain value, pixels inside the contour fall to the next layer.</p>
        <p>The table below presents the number of examples of each type in the training
and test sets.</p>
        <p>For our neural networks, we create program to convert images from JPG
format to “MNIST”4 one. MNIST is a simple computer vision dataset on which are</p>
        <sec id="sec-2-1-1">
          <title>3 http://www.odelama.com/data-analysis/How-to-Compute-RGB-Image</title>
          <p>Standard-Deviation-from-Channels-Statistics/</p>
        </sec>
        <sec id="sec-2-1-2">
          <title>4 http://yann.lecun.com/exdb/mnist/</title>
          <p>
            based the recognition problem. The current best error rate on the MNIST
digitnumberrecognition task (&lt;0.3) approaches human performance [
            <xref ref-type="bibr" rid="ref6">6</xref>
            ]. The data is
stored in a very simple file format designed for storing vectors and
multidimensional matrices. All the integers in the files are stored in the “MSB first (high
endian) format” 5 used by most non-Intel processors. Users of Intel processors and
other low-endian machines must flip the bytes of the header. There are four files:
trainingsetimages; trainingsetlabels; testsetimages; testsetlabels. Table 2 and
Table 3 shows structure of these files.
Offset Type Value Description
0000 32 bit integer 0x00000801(2049) magic number(MSB first)
0004 32 bit integer 488/110 number of items
0008 unsigned byte 0...6 label
0009 unsigned byte 0...6 label
... ... ... ...
Offset Type Value Description
0000 32 bit integer 0x00000803(2051) magic number(MSB first)
0004 32 bit integer 488/110 number of images
0008 32 bit integer 28 number of rows
0012 32 bit integer 28 number of columns
0016 unsigned byte 0. . . 255 pixel
0017 unsigned byte 0. . . 255 pixel
          </p>
          <p>... ... ... ...</p>
          <p>Pixels are organized row-wise. For our experiments we have used pixels with
values from 0 to 255. 0 means background (white), 255 means foreground (black).</p>
        </sec>
        <sec id="sec-2-1-3">
          <title>5 https://en.wikipedia.org/wiki/Most_significant_bit</title>
          <p>2.2</p>
        </sec>
      </sec>
      <sec id="sec-2-2">
        <title>Hardware and Software Configurations</title>
        <p>In this article used the computer with 8GB Ram DDR3 on which the OS
Microsoft Windows 8.1 and OS Ubuntu 15.04 is installed. It has a processor Intel
Core i7-970 and videocard Radeon R280x. Also, for a machine learning used
library known as TensorFlow6. Using TensorFlow makes it easy to implement
backpropagation for convolutional neural networks, since it automatically
computes all the mappings involved. It is also quite a bit faster than other libraries,
and this makes it practical to train more complex networks. In particular, one
great feature of TensorFlow is that it can run code on either a CPU or, if
available, a GPU. Running on a GPU provides a substantial speedup and, again,
helps make it practical to train more complex networks. alculations are
performed without using the GPU and computing time is less than 10 minutes.
3</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Back Propagation Neural Network (BPNN)</title>
      <p>The structure of our BPNN7 is described in fig. 3. Our net consists of three
layers: an input layer, a hidden layer and an output layer. The input layer has
784 units, or neurons. Hidden layer has 625 and the output 7 units.</p>
      <p>
        The standard way to model a neuron’s output f as a function of its input x is
with f (x) = tanh(x). In terms of training time with gradient descent, these
saturating nonlinearities are much slower than the non-saturating nonlinearity f(x)
= max(0, x). Following Nair and Hinton [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ], we refer to neurons with this
nonlinearity as Rectified Linear Units (ReLUs). Deep convolutional neural networks
      </p>
      <sec id="sec-3-1">
        <title>6 https://www.tensorflow.org</title>
      </sec>
      <sec id="sec-3-2">
        <title>7 https://en.wikipedia.org/wiki/Backpropagation</title>
        <p>
          with ReLUs train several times faster than their equivalents with tanh units.
Two additional major benefits of ReLUs are sparsity and a reduced likelihood of
vanishing gradient. One major benefit is the reduced likelihood of the gradient
to vanish. This arises when a&gt;0. In this mode, the gradient has a constant value.
In contrast, the gradient of sigmoids becomes increasingly small as the absolute
value of x increases. The constant gradient of ReLUs results in faster learning.
The other benefit of ReLUs is sparsity. Sparsity arises when a&lt;=0. The more
such units that exist in a layer the more sparse the resulting representation.
Sigmoids on the other hand are always likely to generate some non-zero value
resulting in dense representations. Sparse representations seem to be more
beneficial than dense representations. We are not the first to consider alternatives
to traditional neuron models in CNNs. For example, Jarrett et al. [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ] used the
nonlinearity f (x) = jtanh(x)j. As the cost function, was chosen cross-entropy
function. Learning rate of algorithm was 0.001. Convolutional Neural Networks
are very similar to ordinary Neural Networks. They are made up of neurons
that have learnable weights and biases. Each neuron receives some inputs,
performs a dot product and optionally follows it with a non-linearity. The whole
network still express a single differentiable score function: From the raw image
pixels on one end to class scores at the other. And they still have a loss function
(e.g. SVM/Softmax) on the last (fully-connected) layer and all the tips/tricks
we developed for learning regular Neural Networks still apply.8 Structure for our
network we can see in fig. 4. Input layer has size 28x28 pixels and value of each
pixel can take value 0 or 1 after processing the initial image.
First parameter is the number of convolutional layers. The more convolutional
layers the better (within reason, as each convolutional layer reduces the number
        </p>
      </sec>
      <sec id="sec-3-3">
        <title>8 http://cs231n.github.io/convolutional-networks/</title>
        <p>of input features to the fully connected layers. After about two or three layers the
accuracy gain becomes rather small so we need to decide what is more important:
generalization accuracy or training time. All image recognition tasks are different
so the best method is to simply try incrementing the number of convolutional
layers one at a time until we are satisfied by the result.</p>
        <p>Second parameter is the number of hidden layers. The number of required
hidden layers depends on the intrinsic complexity of dataset, this can be
understood by looking at what each layer achieves:
– Zero hidden layers allow the network to model only a linear function. This
is unsuitable for most image recognition tasks.
– One hidden layer allows the network to model an arbitrarily complex
function. This is suitable for nearly all image recognition tasks.
– Theoretically, two hidden layers offer little benefit over a single layer,
however, in practice especially complex tasks may find an additional layer
beneficial. This should be treated with caution, as a second layer can cause
over-fitting. Using more than two hidden layers is almost never beneficial9.</p>
        <p>Third parameter is the number of nodes per hidden layer. There is no formula
for deciding upon the number of nodes, it is different for each task. A rough guide
to go by is to use a number of nodes 2/3 the size of the previous layer, with the
first layer 2/3 the size of the final feature maps. This however is just a rough
guide and depends again on the dataset. Another commonly used option is to
start with an excessive number of nodes, then to remove the unnecessary nodes
through pruning. For better recognize images input layer has padding.</p>
        <p>
          Fourth parameter is the numbers of pooling layers. Pooling layers in CNNs
summarize the outputs of neighboring groups of neurons in the same kernel map.
Traditionally, the neighborhoods summarized by adjacent pooling units do not
overlap (e.g.,[
          <xref ref-type="bibr" rid="ref7 ref8 ref9">8, 7, 9</xref>
          ]). To be more precise, a pooling layer can be thought of as
consisting of a grid of pooling units spaced s pixels apart, each summarizing a
neighborhood of size zz centered at the location of the pooling unit. If we set
s = z, we obtain traditional local pooling as commonly employed in CNNs. If
we set s &lt; z, we obtain overlapping pooling.
3.2
        </p>
        <sec id="sec-3-3-1">
          <title>Dropout</title>
          <p>
            Combining the predictions of many different models is a very successful way to
reduce test errors [
            <xref ref-type="bibr" rid="ref10 ref11">10, 11</xref>
            ], but it appears to be too expensive for big neural
networks that already take several days to train. There is, however, a very
efficient version of model combination that only costs about a factor of two during
training. The recently-introduced technique, called “dropout” [
            <xref ref-type="bibr" rid="ref13">13</xref>
            ], consists of
setting to zero the output of each hidden neuron with probability 0.5. The
neurons which are “dropped out” in this way do not contribute to the forward pass
9
http://stackoverflow.com/questions/24509921/how-do-you-decide-theparameters-of-a-convolutional-neural-network-for-image-cla
and do not participate in backpropagation. So every time an input is presented,
the neural network samples a different architecture, but all these architectures
share weights. This technique reduces complex co-adaptations of neurons, since
a neuron cannot rely on the presence of particular other neurons. It is, therefore,
forced to learn more robust features that are useful in conjunction with many
different random subsets of the other neurons [
            <xref ref-type="bibr" rid="ref12">12</xref>
            ]. We don’t use dropout because
our training time is acceptable.
4
          </p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Results</title>
      <p>As we can see, CNN and BPNN have more answers that are correct but to
obtain this result the network needs more time to train, because they have more
parameters to train. Table 5 shows accuracy per each pometa.</p>
      <p>So as we can see accuracy of pometas "H" and "П" only are different from
one. This can be explained by the fact that they are very similar.
During our research, we have developed two algorithms to processing image and
compared four types of neural networks. We have achieved excellent accuracy
image recognition. So our program itself can define pometas and translate them
into a digital format. Further it is possible to improve and to determine not
only the pometas but also others symbols. This program is easy to understand
because there are not so many parameters to change.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <surname>Philippovich</surname>
            ,
            <given-names>A.Yu.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Danshina</surname>
            ,
            <given-names>M.V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Golubeva</surname>
            ,
            <given-names>I.V.</given-names>
          </string-name>
          <article-title>Editing and representation of ancient Russian semiographic chants on the web</article-title>
          .
          <source>In: Analysis of Images</source>
          , Social Networks and Texts / Ed. by
          <string-name>
            <surname>Dmitry</surname>
            <given-names>I. Ignatov</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>Mikhail</given-names>
            <surname>Yu</surname>
          </string-name>
          . Khachay, Alexander Panchenko et al. - Springer International Publishing,
          <year>2014</year>
          . - Vol.
          <volume>436</volume>
          of Communications in Computer and Information Science. - pp.
          <fpage>66</fpage>
          -
          <lpage>77</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <surname>Philippovich</surname>
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Yu</surname>
            ,
            <given-names>Golubeva I.V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Danshina</surname>
            <given-names>M.V.</given-names>
          </string-name>
          <article-title>Semiotic system of musical texts</article-title>
          <source>In: Supplementary Proceedings of the 3rd International Conference on Analysis of Images, Social Networks and Texts</source>
          (AIST'
          <year>2014</year>
          ). - Vol.
          <volume>1197</volume>
          . - Yekaterinburg, Russia : CEUR-WS.org,
          <year>2014</year>
          . - pp.
          <fpage>28</fpage>
          -
          <lpage>34</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>Vinod</given-names>
            <surname>Nair</surname>
          </string-name>
          and
          <article-title>Geoffrey Hinton Rectified linear units improve restricted Boltzmann machines</article-title>
          . ICML.
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <surname>Devijver</surname>
          </string-name>
          , Pierre A.;
          <article-title>Kittler, Josef Pattern Recognition: A Statistical Approach</article-title>
          . London, GB: Prentice-Hall.
          <year>1982</year>
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <surname>Vylomova</surname>
            ,
            <given-names>E.A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Philippovich</surname>
            ,
            <given-names>A.Yu.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Danshina</surname>
            ,
            <given-names>M.V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Golubeva</surname>
            ,
            <given-names>I.V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Philippovich</surname>
            ,
            <given-names>Yu.N.</given-names>
          </string-name>
          <article-title>Neural models for recognition of basic units of semiographic chants</article-title>
          .
          <source>In: Analysis of Images</source>
          , Social Networks and Texts / Ed. by
          <string-name>
            <surname>Dmitry</surname>
            <given-names>I. Ignatov</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>Mikhail</given-names>
            <surname>Yu</surname>
          </string-name>
          . Khachay, Alexander Panchenko et al. - Springer International Publishing,
          <year>2014</year>
          . - Vol.
          <volume>436</volume>
          of Communications in Computer and Information Science. - pp.
          <fpage>249</fpage>
          -
          <lpage>254</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>D.</given-names>
            <surname>Cire</surname>
          </string-name>
          ¸san, U. Meier, and
          <string-name>
            <given-names>J.</given-names>
            <surname>Schmidhuber</surname>
          </string-name>
          <article-title>. Multi-column deep neural networks for image classification</article-title>
          .
          <source>Arxiv preprint arXiv:1202.2745</source>
          ,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>K.</given-names>
            <surname>Jarrett</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Kavukcuoglu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. A.</given-names>
            <surname>Ranzato</surname>
          </string-name>
          , and
          <string-name>
            <given-names>Y.</given-names>
            <surname>LeCun.</surname>
          </string-name>
          <article-title>What is the best multi-stage architecture for object recognition</article-title>
          ?
          <source>In International Conference on Computer Vision</source>
          , pages
          <fpage>2146</fpage>
          -
          <lpage>2153</lpage>
          . IEEE,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>Y.</given-names>
            <surname>LeCun</surname>
          </string-name>
          , K. Kavukcuoglu, and
          <string-name>
            <given-names>C.</given-names>
            <surname>Farabet</surname>
          </string-name>
          .
          <article-title>Convolutional networks and applications in vision</article-title>
          .
          <source>In Circuits and Systems (ISCAS)</source>
          ,
          <source>Proceedings of 2010 IEEE International Symposium on</source>
          , pages
          <fpage>253</fpage>
          -
          <lpage>256</lpage>
          . IEEE,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>D.</given-names>
            <surname>Cire</surname>
          </string-name>
          ¸san, U. Meier, and
          <string-name>
            <given-names>J.</given-names>
            <surname>Schmidhuber</surname>
          </string-name>
          <article-title>. Multi-column deep neural networks for image classification</article-title>
          .
          <source>Arxiv preprint arXiv:1202.2745</source>
          ,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>R.M.</given-names>
            <surname>Bell</surname>
          </string-name>
          and
          <string-name>
            <given-names>Y.</given-names>
            <surname>Koren</surname>
          </string-name>
          .
          <article-title>Lessons from the netflix prize challenge</article-title>
          .
          <source>ACM SIGKDD Explorations Newsletter</source>
          ,
          <volume>9</volume>
          (
          <issue>2</issue>
          ):
          <fpage>75</fpage>
          -
          <lpage>79</lpage>
          ,
          <year>2007</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>L.</given-names>
            <surname>Breiman</surname>
          </string-name>
          .
          <article-title>Random forests</article-title>
          .
          <source>Machine learning</source>
          ,
          <volume>45</volume>
          (
          <issue>1</issue>
          ):
          <fpage>5</fpage>
          -
          <lpage>32</lpage>
          ,
          <year>2001</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>A.</given-names>
            <surname>Krizhevsky</surname>
          </string-name>
          ,
          <string-name>
            <surname>I.Sutskever</surname>
          </string-name>
          , Geoffrey E.
          <article-title>Hinton ImageNet Classification with Deep Convolutional Neural Networks</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>G.E.</given-names>
            <surname>Hinton</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Srivastava</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Krizhevsky</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Sutskever</surname>
          </string-name>
          , and
          <string-name>
            <given-names>R.R.</given-names>
            <surname>Salakhutdinov</surname>
          </string-name>
          <article-title>Improving neural networks by preventing co-adaptation of feature detectors</article-title>
          .
          <source>arXiv preprint arXiv:1207.0580</source>
          ,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>