<!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>Information-Extreme Learning of On-Board System for Recognition of Ground Vehicles</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Igor N</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Mykyt</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Myron</string-name>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Scientific-research center of missile troops and artillery</institution>
          ,
          <addr-line>Gerasim Kondratyev st. 165, Sumy, 40021</addr-line>
          ,
          <country country="UA">Ukraine</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Sumy State University</institution>
          ,
          <addr-line>Rymskogo-Korsakova st. 2, Sumy, 40007</addr-line>
          <country country="UA">Ukraine</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>The article deals with the task of information synthesis of on-board recognition system of ground vehicles. Machine training of the system is carried out within the framework of information-extreme intellectual technology of data analysis, which is based on maximizing the information ability of the recognition system. The modified Kulbak information measure is used as a criterion for optimizing the parameters of machine learning. The proposed algorithm of machine learning is realized on the example of recognition of monochrome coloring cars on approximately identical chassis.</p>
      </abstract>
      <kwd-group>
        <kwd />
        <kwd>information-extreme machine learning</kwd>
        <kwd>on-board recognition system</kwd>
        <kwd>categorical model</kwd>
        <kwd>training matrix</kwd>
        <kwd>optimization</kwd>
        <kwd>information criterion</kwd>
        <kwd>vehicles</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>The widespread use of unmanned aerial vehicles to monitor the earth's surface makes
it urgent to create autonomous on-board recognition systems (ORSs) for ground
objects, including vehicles of various uses [1, 2]. The main way of solving this
problem is to apply methods of machine learning and the theory of pattern recognition
[3 – 5]. In this case, the functional efficiency of the ORS essentially depends on the
method of processing images of the object being recognized and the method of
machine learning. In addition, when creating the ORS it is necessary to ensure the
invariance of the constructed in the process of machine learning decisive rules to the
arbitrary position of the vehicle in the frame of the area of interest. One of the ways to
solve this problem is to process images of recognition objects in a polar coordinate
system [6, 7]. But within the framework of this approach necessarily there is a need to
solve the problem of determining the polar coordinate system on the ground vehicle.
The overwhelming majority of the methods of the information synthesis of the ORS,
which are taught, is based on the application of neural networks [8, 9]. In this case,
there are complications of scientific and methodological nature, associated with
arbitrary initial conditions for the formation of the input mathematical description, the
intersection in the space of signs of recognition classes, a large measure of the space
of signs and the complexity of retraining.</p>
      <p>One of the promising ways of information synthesis of highly effective ORS is the
application of ideas and methods of the so-called information-extreme intellectual
technology (IEI-technology) of data analysis, which is based on maximizing the
information ability of the recognition system in the process of its machine learning
[10 – 12]. The main idea of the methods in the framework of IEI-technology as in
neural networks is to adapt the input mathematical description of the recognition
system to the maximum functional efficiency of machine learning. But in contrast to
the neural networks built on the results of machine learning in the framework of the
geometric approach, the decisive rules are practically invariant to many of the
dimensionality of the recognition signspace.</p>
      <p>The article discusses, in the framework of the IEI-technology, the formulation of
the problem and the algorithms for the operation of the onboard vehicle recognition
system in machine learning modes of the exam.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Formulation of the problem</title>
      <p>Consider the formalized formulation of the task of information-extreme machine
learning on-board recognition of a land vehicle. Let the alphabet {X mo | m  1, M } of
the recognition classes characterizing the terrestrial vehicles and the input brightness
|| ym(j,)i || of the pixels of the receptor field of the image objects of the recognized
objects be given. In this case, the line {ym(j,i) | i  1, N} of the matrix, where N is the
number of signs of recognition, is a structured vector-realization (hereinafter simply
realization) of the image, and the matrix column is a random educational sample of
{ym(j,)i | j  1, J} with a volume of J .</p>
      <p>In the process of machine learning it is necessary:
in accordance with the concept of IEI-technology, convert the input training matrix
into a binary working matrix || xm(j,)i || , which, through admissible transformations, can
be adapted to the maximum full probability of making the correct classification
decisions;</p>
      <p>
        optimize according to the information criterion the parameters of the machine
learning ORS, which for each class of recognition X mo are given by structured vector
gm  xm , dm ,   ,
(
        <xref ref-type="bibr" rid="ref1">1</xref>
        )
where xm is the averaged binary implementation of the recognition class X mo ; d m is
the radius of the hyperspherical container of the recognition class X o , which is
m
restored in the radial basis of the space of signs;  – parameter, the value of which is
equal to half of the symmetrical field of control tolerances on the signs of recognition;
for determining the optimal geometric parameters of the classes of recognition of
hyperspherical containers, determined by the machine learning process, to construct
decisive rules.
      </p>
      <p>At the same time, the following restrictions are set for the machine learning
parameters:</p>
      <p>– the range of values of the radius of the hyperspherical container of the
recognition class d m , is given by the inequality dm  d (xm  xc ) , where d ( xm  xc ) is the
inter-center coding distance between the reference implementation of class xm of
class X mo and the reference implementation of xc neighboring class X co nearest to it;
 – symbol of the logical operation of adding by module 2;</p>
      <p>– the region of values of parameter  is given by inequality   H / 2 , where H
is the normalized tolerance field on the recognition signs.</p>
      <p>In the functioning of the on-board system in the exam mode, it is necessary to
confirm the high functional efficiency of the machine learning onboard recognition
system.
3</p>
    </sec>
    <sec id="sec-3">
      <title>Categorical models of machine learning</title>
      <p>The categorical model of on-board computer training includes an input mathematical
description of the on-board vehicle recognition system in terrain, which has the form
 B T , G, , Z , K ,Y , X ; 1, 2  ,
where T is the set of moments of the time of obtaining information; G is the space of
the functional states of the recognized object; Ω  the space of signs of recognition; Z
– space of functional states of the recognition system; K – the set of frames of the
electronic map of the area; Y is a sample set that forms the input training matrix; X –
working binary training matrix; 1 :G  T    Z  Y  the operator of the formation
of matrix Y ;  2 :Y  X – s an operator for transforming the input training matrix Y
into a binary matrix X .</p>
      <p>Fig. 1 shows a categorical model of information-extreme learning of recognition
system with optimization of geometric parameters of containers of recognition classes
and system of control tolerances on recognition signs.</p>
      <p>V</p>
      <p>U
 G      K</p>
      <p>D</p>
      <p>Y
2
Ф1
Ф2
1</p>
      <p>X

r</p>
      <p>E
~ M
φ

γ
 |q |
I| S|
ognition classes on the fuzzy partition of the  |M | binary traits of spaces, and the
classification operator  checks the basic statistical hypothesis of the validity of the
class X mo mplementation and thus forms the set of hypotheses I |l| , where l – is the
number of statistical hypotheses. The operator γ, by evaluating the hypotheses
received, forms the set of exact characteristics |q| |, where q  l 2 , and operator 
calculates the set of values of the information criterion E , which is a function of the
exact characteristics. The contour of the model, which is closed by the operator r ,
restores, at each step of the machine learning, the recognition class containers that are
built in the radial basis of the feature space. In this case, the iterative process of
optimizing the geometric parameters of the partition  |M | is carried out by finding the
global maximum of the information criterion in the working (admissible) region of its
function definition. In fig. 1 contour of optimization of control tolerances for
recognition signs is closed through set D – the system of control tolerances for recognition
signs and allows in the training process to change the value of the working binary
training matrix X , adapting it to the maximum functional efficiency of the classifier.
Shown in Fig. 1 categorical model implies, in accordance with the principle of
deferred deci sions, the transition to other types of radial-basic decision rules. For this
purpose, its outer contour contains a set of V types of decisive rules, which are built
using more complex radial-basic separation functions. The training process is
regulated by the operator U : V  G T    Z  K .</p>
      <p>Fig. 2 shows a categorical model of the functioning of the on-board recognition
system in the mode of examination, which tests the functional efficiency of
machinebased learning.
f2</p>
      <p>U E</p>
      <p>x
f1
  G      K
y
Р
 *
 1</p>
      <p> 2
F</p>
      <p>I | M + 1 |
Fig. 2. Category model of functioning of on-board recognition system in the exam mode
In the categorical model (Fig. 2), the operator f1 forms an incoming
implementation of the recognizable object. Operator f2 , obtained on the learning stage, obtains
optimal control tolerances for recognition attributes, converts incoming readmissions
into binary realization x , and operator  reflects the implementation of the
recognizable object on the optimal breakdown of * recognition classes built at the stage of
machine learning. The operator 1 for each vector-realization calculates the values of
constructed at the learning stage of the deciding rules and forms the term-set F , and
the operator 2 by the maximum value of the deciding rule, assigns implementation
to one of the classes of a given alphabet { X mo } . The purpose of the operator UЕ is the
regulation of the exam.
4</p>
    </sec>
    <sec id="sec-4">
      <title>Machine learning</title>
      <p>
        (
        <xref ref-type="bibr" rid="ref2">2</xref>
        )
(
        <xref ref-type="bibr" rid="ref3">3</xref>
        )
The idea of information-extreme machine learning of the pattern recognition system,
as in neural networks in accordance with the work, is to adapt the input mathematical
description to the maximum reliability of classification decisions. In this case, the
transformation of the input a priori fuzzy distribution of image implementations in the
clear is carried out in the process of optimization according to the information
criterion of the learning parameters that affect the exact characteristics of the classification
decisions. Based on the results obtained in the process of machine learning, the
optimal geometric parameters of containers of recognition classes are based on decisive
rules that allow the exam to take promptly reliable classification decisions.
      </p>
      <p>
        Optimization of the parameters of the vector (
        <xref ref-type="bibr" rid="ref1">1</xref>
        ) is carried out by searching at each
step the purposeful change of the radiuses of containers of the classes of recognition
of the global maximum of the alphabet of the classes of recognition of the information
criterion
      </p>
      <p>E* 
1 M</p>
      <p> max Em (d) ,</p>
      <p>M m1 GE Gd
where Em (d ) – information criterion for optimizing the parameters of the training
system to recognize the implementation of class X mo ; d – distance measure of
radiuses of hyperspherical containers of recognition classes; GE  working (admissible)
area of determining the function of information criterion optimization of machine
learning parameters; Gd is the permissible range for changing the radiuses of the
recognition class containers.</p>
      <p>As criteria of optimization of machine learning parameters in the methods of
IEItechnology, modifications of the Kullback information measure and Shannon's
entropy measure are mainly used. For example, the modified Kullback information
measure for two alternatives to the a priori equivalence hypothesis has the form
 2  (m (d )  m (d )) 
Em (d )  1 (m (d )  m (d )) log2   ,
 m (d )  m (d ) 
where m (d) is a mistake of the first kind of acceptance of a classification decision at
every step of machine learning; m (d ) is a mistake of the second kind.</p>
      <p>
        On practice, when calculating the information criterion (
        <xref ref-type="bibr" rid="ref3">3</xref>
        ), when representing the
amount of the training sample, it is necessary to use the estimates of the exact
characteristics
(mk ) (d ) 
      </p>
      <p>K1,m (d )
;
(mk ) (d ) </p>
      <p>K2, m (d )</p>
      <p>,
nmin nmin
where K1,m (d ) is the number of events that indicate the inappropriateness of "their"
implementations of the recognition class X mo ; K2,m (d )  the number of events that
indicate the belonging of "alien" implementations of class X mo , nmin  the minimum
amount of representative sample of study.</p>
      <p>
        The working modification of the Kullback criterion after the corresponding
substitution of the estimates (
        <xref ref-type="bibr" rid="ref4">4</xref>
        ) in expression (
        <xref ref-type="bibr" rid="ref3">3</xref>
        ) takes the form
      </p>
      <p>1  2n 10r  K1(k ) (d )  K2(k) (d )  ,
Em(k ) (d )  {n  [K1(d )  K2 (d )]}log2 
n  K1(k ) (d )  K2(k ) (d ) 10r


where 10r is a sufficiently small number which is entered to avoid division into zero
and in practice it is chosen in the interval 1  r  3 .</p>
      <p>
        According to the categorical model (Fig. 1), the algorithm of ORS informational
and emergency machine learning with optimization of the system of control
tolerances can be represented as a two-cycle procedure for finding the global
maximum of the information criterion (
        <xref ref-type="bibr" rid="ref2">2</xref>
        )
*K  arg{max{ max E(d )}}, (
        <xref ref-type="bibr" rid="ref6">6</xref>
        )
      </p>
      <p>G GE Gd</p>
      <p>
        Let's consider the main stages of implementing the algorithm (
        <xref ref-type="bibr" rid="ref5">5</xref>
        ) of
informationextreme machine learning ORS. The input data is the array of the input learning
matrix for a given alphabet of recognition classes and parameter:
(
        <xref ref-type="bibr" rid="ref5">5</xref>
        )
(
        <xref ref-type="bibr" rid="ref4">4</xref>
        )
1. zeroing the count of the recognition classes: m : 0 ;
2. increment of the count of recognition classes: m : m 1 ;
3. zeroing the counter of the steps of changing the tolerance field parameter: k : 0 ;
4. k : k 1 ;
5. zeroing the counter of steps to change the radius of the container of the
recognition class: d : 0 ;
6. d : d 1 ;
7. calculation of the lower АКН ,i [k ] and upper АКB,i [k ] control tolerances for all
signs, respectively, according to the formulas
      </p>
      <p>
        AKH ,i [k ]  y1,i  [k ] ; AKB,i [k ]  y1,i  [k] ;
(
        <xref ref-type="bibr" rid="ref7">7</xref>
        )
8. formation of the binary training matrix xm(j,i) by the rule
      </p>
      <p>1, if AKH ,i  ym(j,)i  AKB,i ;
xm(j,)i  </p>
      <p>0, if else.
9. calculation for class X mo binary averaging vector хm according to the rule

1, if
xm,i  
1 n</p>
      <p>
         xm(j,i)  m ;
n j1
0, if else ,
where m is the level of selection of the coordinates of the averaged binary vector
of the recognition class X mo , which by default is equal to m  0, 5 ;
10. pairwise decomposition of the set of averaged vectors of recognition classes by
the method of closest neighbors;
11. formation for the breakdown of |m2|  xm , xc  educational matrix;
12. calculation of the information criterion for optimizing the parameters of machine
learning GIS, for example, in the form of modification of the information measure
of Kullback (2.5);
13. if d  d (xm  xc ) , then paragraph 6 is executed, otherwise, paragraph 14;
14. if k  H / 2 , then paragraph 4, is executed, otherwise, paragraph 15;
15. if m  M , then paragraph 2 is executed, otherwise, paragraph 16;
16. calculation of averaged alphabet classes recognition information criterion (
        <xref ref-type="bibr" rid="ref6">6</xref>
        )
optimization of machine learning parameters;
17. determining the optimal value of parameter  by the formula (
        <xref ref-type="bibr" rid="ref5">5</xref>
        );
18. calculation of the formula (
        <xref ref-type="bibr" rid="ref7">7</xref>
        ) of the optimal lower and upper control tolerances
for the diagnostic signs, respectively;
19. STOP.
      </p>
      <p>Based on the results obtained in the process of machine learning, the optimal
geometric parameters of the classes of recognition containers are based on decisive
rules, which, when the recognition system operates directly in the operating mode,
verifies the functional efficiency of machine learning. For hyperspherical containers
of recognition classes, decisive rules have the form</p>
      <p>
        (X mo  |M | )(x( j)  |M | )[if (m  0 ) &amp; (m  max{m}) then x( j)  X mo ], (
        <xref ref-type="bibr" rid="ref8">8</xref>
        )
where x( j) is an implementation that is recognized; the function of ownership of the
container of the recognition class X o .
      </p>
      <p>m</p>
      <p>
        In expression (
        <xref ref-type="bibr" rid="ref8">8</xref>
        ), the membership function for hyperspherical containers is
determined by the formula [10]
      </p>
      <p>d (x( j)  xm ) ;
m  1  d m* (9)
where d m* – obtained in the process of machine learning the optimal radius of the
1. {xm* | m  1, M } is an array of reference binary vector-image implementations that
determine the geometric centers of the corresponding optimal containers of
recognition classes constructed at the stage of machine learning;
2. { d m* } is an array of optimal radiuses constructed at the stage of training of the
corresponding containers;
3. {xs( j) | s  1, SMAX ; j  1, n} is an array of binary vectors-implementations of
identified frames, where SMAX is the number of frames of a reconstructed terrain;
4. {*k,i | i  1, N} is the optimal system of control tolerances for recognition signs,
determined at the stage of training.</p>
      <p>
        According to the categorical model (Fig. 2), the algorithm of the exam within the
framework of the IEI-technology is based on the analysis of the values of the decisive
rules formed at the stage of learning (
        <xref ref-type="bibr" rid="ref8">8</xref>
        ). If for all classes of recognition the maximum
values of the function (9) are negative, then according to the deciding rules (
        <xref ref-type="bibr" rid="ref8">8</xref>
        ) the
object is not identified;
      </p>
      <p>
        The analysis of decisive rules (
        <xref ref-type="bibr" rid="ref8">8</xref>
        ) shows that they differ from other methods for
recognizing low computational complexity, which allows BSC to take classification
decisions in real time.
5
      </p>
    </sec>
    <sec id="sec-5">
      <title>Results of physical modeling</title>
      <p>Approbation of the proposed algorithm for information-extreme machine learning was
carried out on the example of the recognition of three cars that were moving along the
highway (Fig. 3). At the same time, in order to check the functional efficiency of
machine learning ORS cars specially selected monotonous and with approximately
the same contours.</p>
      <p>а
b
c</p>
      <p>The formation of the input training matrix was carried out by processing images of
cars in the polar coordinate system, which allowed to ensure the invariance of the
decision of the rules to the arbitrary position of the object of recognition in the frame
of the zone of interest. As a sign of recognition, the average value of the brightness of
the pixels of the reading range, built around the center of the polar coordinate system,
was taken. At the same time, the definition of the center of the polar coordinate
system on the car was carried out by the class SelectedObject, which, moreover, handles
the image of the object in the polar coordinate system and forms the input training
matrix ORS.</p>
      <p>Fig. 4 shows a screenshot of the result of the Class SelectedObject program, which
shows the center of the polar system on a class X 3o (Fig. 3c) at different levels of
quantization of the brightness of pixels of the area of interest frame.</p>
      <p>To form the implementation of the input training matrix, all pixels of the frame of
the interest zone, which was accepted as the first quadrant of the Cartesian coordinate
system, was numbered. This allowed us to determine polarization centers of cars as
average arithmetic numbers of pixels whose brightness exceeded the corresponding
quantization level. Then the center of the Cartesian coordinate system was transferred
to the found center of the polar system, around which the area of the given radius was
asked. In the given region, the coordinates of the pixels were converted to polar and
formed arrays of pixels with the same radiuses. For each RGB-component image of
the car for recognition, the average brightness value of the pixels of the corresponding
array was taken.</p>
      <p>
        Fig. 5 shows the graph of the dependence of the information criterion recognition
(
        <xref ref-type="bibr" rid="ref5">5</xref>
        ) alpha of the information criterion recognition classes (
        <xref ref-type="bibr" rid="ref5">5</xref>
        ) on parameter  ,
obtained during the machine learning process in accordance with the procedure (
        <xref ref-type="bibr" rid="ref6">6</xref>
        ) at
the quantization level of brightness   50 . In this case, parallel optimization was
carried out, at which, at each step of machine learning, control tolerances changed
simultaneously for all signs of recognition. When calculating the information criterion
(
        <xref ref-type="bibr" rid="ref5">5</xref>
        ) parameters n  40 and r  2 were taken.
d2*  9 and for class X 3o – d3*  11 .
      </p>
      <p>The results of the physical simulation of the on-board recognition system in the
exam mode showed that the full probability of correct recognition of the
vectorrealization of class X1 is Pt  0,84 , class X 2 – Pt  0,80 and class X 3 – Pt  0, 78 .
6</p>
    </sec>
    <sec id="sec-6">
      <title>Conclusion</title>
      <p>
        The method of information-extreme machine learning of the ORS ground vehicle with
optimization of the system of control tolerances on recognition signs is proposed. The
formation of the input mathematical description was carried out on the basis of the
results of processing images of vehicles in the polar coordinate system, which ensured
the invariance of the deciding rules to the arbitrary position of the object of
recognition in the frame of the interest zone. The results of machine learning were not
allowed to construct non-error-based educational matrix deciding rules due to the high
degree of intersection of classes of recognition in the space of signs. Therefore, in
order to increase the functional efficiency of the ORS, it is necessary to increase the
depth of machine learning by optimizing other learning parameters, including the
parameters of image processing of terrestrial objects.
9. Ciresan, D., Meier, U. and Schmidhuber, J., Multi-column deep neural networks for image
classification, Computer Vision and Pattern Recognition (CVPR), 2012 IEEE Conference
on, pp. 3642-3649 (2012)
10. Dovbysh, A.S., Rudenko, M. S. Information-extreme learning algorithm for a system of
recognition of morphological images in diagnosing oncological pathologies. Cybernetics
and Systems Analysis, vol. 50, pp. 157-163 (2014) DOI:10.15587/1729-4061.2016.71930.
11. Dovbysh, A. S., Moskalenko, V. V., Rizhova, A. S. Information-Extreme Method for
Classification of Observations with Categorical Attributes. Cybernetics and Systems
Analysis, vol. 52(
        <xref ref-type="bibr" rid="ref2">2</xref>
        ), 224–231 (2016) DOI:10.1007/s10559-016-9818-1
12. Dovbysh, A., Velikodniy, D., Shelehov, I. Bibyk, M. Information-extreme machine
learning of the control system over the pover unit of a therminal pover main line.
EasternEuropean Journal of Enterprise Technologies, vol. 5/4 (89), pp. 17-24 (2017)
DOI:10.15587/1729-4061.2017.112121.
      </p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Jauregi</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lazkano</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Martinez-Otzeta</surname>
            ,
            <given-names>J.M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sierra</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          :
          <article-title>Visual Approaches for Handle Recognition</article-title>
          . Springer Tracts in Advanced Robotics. vol.
          <volume>44</volume>
          . pp.
          <fpage>313</fpage>
          -
          <lpage>322</lpage>
          (
          <year>2008</year>
          ) DOI:
          <fpage>10</fpage>
          .1007/978-3-
          <fpage>540</fpage>
          -78317-6_
          <fpage>32</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Huang</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lu</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yan</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chen</surname>
            ,
            <given-names>J.:</given-names>
          </string-name>
          <article-title>A new scale invariant feature detector and modified SURF descriptor</article-title>
          .
          <source>Conference: Sixth International Conference on Natural Computation, ICNC</source>
          <year>2010</year>
          , Yantai, Shandong, China,
          <fpage>10</fpage>
          -12
          <source>August</source>
          <year>2010</year>
          , pp.
          <fpage>3734</fpage>
          -
          <lpage>3738</lpage>
          (
          <year>2010</year>
          ) DOI:
          <fpage>10</fpage>
          .1109/ICNC.
          <year>2010</year>
          .
          <volume>5583377</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Hastie</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          :
          <article-title>The Elements of StatisticalLearning: data Mining, Inference and Prodiction</article-title>
          . - 2nd ed. Springer Verlag,
          <year>2009</year>
          , p.
          <volume>746</volume>
          (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Muller</surname>
            ,
            <given-names>K. R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mika</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ratsch</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          :
          <article-title>An introduction to kernelbased learning algorithms</article-title>
          ,
          <source>IEEE Transactions on Neural networks</source>
          . vol.
          <volume>12</volume>
          (
          <issue>2</issue>
          ), pp.
          <fpage>181</fpage>
          -
          <lpage>202</lpage>
          (
          <year>2001</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Subbotin</surname>
            ,
            <given-names>S.:</given-names>
          </string-name>
          <article-title>The neuro-fuzzy network synthesis and simplification on precedents in problems of diagnosis and pattern recognition</article-title>
          .
          <source>Optical Memory and Neural Networks (Information Optics)</source>
          . vol.
          <volume>22</volume>
          (
          <issue>2</issue>
          ), pp.
          <fpage>97</fpage>
          -
          <lpage>103</lpage>
          (
          <year>2013</year>
          ) DOI=
          <fpage>10</fpage>
          .3103/S1060992X13020082
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Dovbysh</surname>
            ,
            <given-names>A.S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Martynenko</surname>
            ,
            <given-names>S. S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kovalenko</surname>
            ,
            <given-names>A. S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Budnyk</surname>
            ,
            <given-names>M. M.</given-names>
          </string-name>
          <article-title>Information-extreme algorithm for recognizing current distribution maps in magnetocardiography</article-title>
          .
          <source>Journal of Automation and Information Sciences</source>
          , vol.
          <volume>43</volume>
          (
          <issue>2</issue>
          ), pp.
          <fpage>63</fpage>
          -
          <lpage>70</lpage>
          (
          <year>2011</year>
          ) DOI:
          <fpage>10</fpage>
          .1615/JAutomatInfScien.v43.
          <year>i2</year>
          .
          <fpage>60</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Simonovskiy</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Piatachenko</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Myronenko</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <article-title>On-board Geographic Information System of Images' Identification</article-title>
          .
          <source>In Proceedings of the VI International Conference «Advanced Information Systems</source>
          and Technologies - AIST-2018», Sumy, May
          <volume>16</volume>
          - 18,
          <year>2018</year>
          , Sumy, Sumy State University, pp.
          <fpage>115</fpage>
          -
          <lpage>118</lpage>
          (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Zheng</surname>
            ,
            <given-names>H.L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Fu</surname>
            ,
            <given-names>J.L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mei</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Luo</surname>
          </string-name>
          , J.B.
          <article-title>Learning Multi-Attention Convolutional Neural Network for Fine-Grained Image Recognition</article-title>
          .
          <source>In Proceedings of the IEEE International Conference on Computer Vision</source>
          , Venice, Italy,
          <fpage>22</fpage>
          -
          <lpage>29</lpage>
          October 2017; pp.
          <fpage>5219</fpage>
          -
          <lpage>5227</lpage>
          (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>