<!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 Machine Learning On-Board Recognition System of Ground Objects with the Adaptation of the Input Mathematical Description</article-title>
      </title-group>
      <pub-date>
        <year>1829</year>
      </pub-date>
      <fpage>0000</fpage>
      <lpage>0003</lpage>
      <abstract>
        <p>The method of machine learning of the on-board unmanned aerial vehicle system for autonomous recognition of natural and infrastructural terrestrial objects with the optimization of the frame size generated by the optical digital image of the region is considered. The problem of information synthesis of the onboard recognition system is being solved in the framework of information-extreme intellectual data analysis technology. As part of the functional approach to modeling the cognitive processes inherent in man in the formation and making of classification decisions, the method of information-extreme machine learning onboard recognition system, which allows to adapt the input mathematical description to the maximum full probability of correct recognition of terrestrial features. In accordance with the proposed categorical model, an algorithm of information-extreme machine learning was developed and programmatically implemented, during which the parameters of the sys-tem functioning according to the modified Kullback information criterion are optimized. Implementation of the proposed machine learning algorithm was carried out on the example of recognition of natural and infrastructural land objects, among which roads were considered as a zone of interest.</p>
      </abstract>
      <kwd-group>
        <kwd />
        <kwd>extreme machine learning</kwd>
        <kwd>onboard recognition system</kwd>
        <kwd>digital image of the region</kwd>
        <kwd>information criterion</kwd>
        <kwd>optimization</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>The main way to increase the functional efficiency of onboard systems of unmanned
aerial vehicles designed for autonomous recognition of ground objects is the
application of ideas and methods of machine learning [1,2]. Thus there is a need to overcome
a number of complications of a scientific and methodological nature, due to the
following main reasons:</p>
      <p>─ arbitrary initial conditions for the optical formation of digital images of
terrestrial objects;</p>
      <p>─ significant intersection of the recognition classes that characterize terrestrial
objects;</p>
      <p>─ the multidimensionality of the feature dictionary and alphabet of recognition
classes;</p>
      <p>─ strict requirements for the efficiency of machine learning and the operation of
onboard recognition system (ORS) directly in working mode.</p>
      <p>Overcoming the above complications depends on both the functionality of the
simulator, close to real conditions, and the method of machine learn-ing ORS. In the
works [3 – 5], the detection of terrestrial objects is carried out according to its
dimensions using descriptive methods or the determination of special (invariant) points by
spline methods of different order. The main disadvantage of such methods is poor
results with the same or approximate geometric parameters of the objects. It is clear
that in order to increase the functional efficiency of machine learning, the ORS needs
to increase the in-formativeness of the recognition feature dictionary by scanning the
entire digital image of the object. But it is important to choose the method of
machine learning ORS, capable of analyzing large amounts of data at high power
alphabet a priori fuzzy recognition classes. The main disadvantage of apply-ing neural
structures is the dependence of their functional efficiency on the many dimensions of
data and the flexibility to retrain [6, 7]. Therefore, a promising area of informational
synthesis of ORS is the application of ma</p>
      <p>chine learning methods built within the functional approach to modeling the
cognitive processes inherent in humans in the formation and decision mak-ing of
classification decisions. This area includes methods developed in the framework of the
socalled information-extreme intellectual technology (IEI technology) data analysis,
which is based on maximizing the information ca-pacity of the recognition system in
the process of machine learning [8, 9]. In the methods of information-extreme
machine learning, practical invariance of the many dimensions of data is ensured by the
construction of decisive rules within the geometric approach. In addition, the decision
rules con-structed in the framework of the geometric approach are characterized by
high efficiency of making classification decisions, which is especially relevant for the
ORS. Extreme machine learning by analogy with human learning is considered as a
process of optimization of parameters that affect its func-tional efficiency. In this
case, the information criterion of optimization as a measure of diversity is considered
as a generalized criterion for the validity of partitioning of the feature space into
recognition classes, since it is func-tional both from a remote measure of proximity and
from the exact charac-teristics of the classification decisions. But the functional
efficiency of infor-mation-extreme machine learning, as well as other methods, is
significantly influenced by the method of forming an input mathematical description of the
recognition system. The paper [10] considered the problem of informa-tion-extreme
machine learning of the onboard system for recognizing terres-trial objects at a given
frame size of the digital image of the observed region. The article proposes a method
of information-extreme machine learning of the ORS with the adaptation of the frame
sizes formed by the optical channel of digital image of the region to the maximum
likelihood of making the right classification decisions.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Formulation of the problem</title>
      <p>
        Let's consider the scheme of algorithm of information-extreme machine learning with
optimization of the size of frames of digital image of the region according to the
procedure (
        <xref ref-type="bibr" rid="ref3">3</xref>
        ): Consider the formalized formulation of the problem of information
synthesis capable to learn ORS with optimization of the size of frames of digital image of
the region. Let the alphabet of the {X mo | m  1, M } classes of recognition characterize
the frames of the image of natural and infrastructural objects. For each recognition
class, a three-dimensional training matrix || ym(j,)i || of the pixel brightness of the
receptor frame of frames is formed, in which a row { ym(j,i) | i  1, N} , where N is the number of
recognition features, is a structured vector of the recognition class features X mo , and
the column of matrix { y m(j,i) | j  1, n} s a random learning sample of the i -th values n. In
accordance with the concept of IEI technology, the input training matrix Y is
transformed into a working binary matrix X , which is changed by optimal coding of
recognition features by the level of control tolerances in the process of machine learning.
Therefore, in the binary Hamming space is given a vector of parameters of operation
that affect the functional efficiency of machine learning ORS to recognize the vectors
of features of recognition class X mo :
gm  xm , dm , , r ,
(
        <xref ref-type="bibr" rid="ref1">1</xref>
        )
where xm is a vector averaged over the ensemble of realizations, the apex of
which defines the center of the hyperspherical container of recognition class X mo and
the size of which is determined by the number of recognition features; dm is the
radius of the hyperspherical container of recognition class X mo , dm  d{xm  xc ) , where
d (xm  xc ) is the inter-center distance between vector xm and vector xc of the
nearest neighboring class X co ;  is a parameter whose value is equal to half the
symmetric field of control tolerances for recognition features,   H / 2 , where H is the
normalized tolerance field for recognition features; r is the side of a square frame of
a digital image of a region.
      </p>
      <p>
        It is necessary to optimize the parameters of the vector (
        <xref ref-type="bibr" rid="ref1">1</xref>
        ) in the process of
machine learning of the ORS, which provide the maximum value of the information
optimization criterion in the working (allowable) region of determining its function:
E* 
1 M
      </p>
      <p>
         max E m(k ) ,
M m1GE {k}
(
        <xref ref-type="bibr" rid="ref2">2</xref>
        )
where E(k) is the value of the information criterion for optimization of vector
pam
rameters calculated at the k -th кроці step of machine learning (
        <xref ref-type="bibr" rid="ref1">1</xref>
        ); GE  work area of
calculation of information criterion; {k} – set of learning steps.
      </p>
      <p>When operating the ORS in exam mode, it is necessary to check the functional
effectiveness of machine learning.</p>
      <p>
        Thus, the problem of information synthesis capable of learning ORS is to optimize
the parameters of its machine learning by approaching the global maximum of
information criterion (
        <xref ref-type="bibr" rid="ref2">2</xref>
        ) to its maximum limit value.
3
      </p>
      <p>Mathematical model of machine learning
Within the functional approach to the modeling of cognitive processes, a categorical
model of information-extreme machine learning is constructed in the form of an
oriented graph. The input mathematical description of the categorical model is presented
as a structure</p>
      <p>I B G,T ,, Z, K,Y , X ; f1, f2  ,
where G is the set of factors that influence the ORS; T is the set of moments in
which information is received;   recognition features space; Z – the space of
states of the system, (alphabet of recognition classes); K – multiple frames of digital
image of the region; Y  the input training matrix of the pixel brightness of the image
frame; X – working binary learning matrix; f1 is the operator of forming the input
training matrix Y ; f2 is the operator of converting the matrix Y into a working binary
matrix X .</p>
      <p>
        A categorical model of information-extreme machine learning of the ORS with the
optimization of the coordinates of the structured vector (
        <xref ref-type="bibr" rid="ref1">1</xref>
        ) is shown in Fig. 1.
      </p>
      <p>In Fig. 1 Cartesian product G  T    Z  K sets the test universe, which is the
source of information. The thermal set E of the information criterion values is
common to all contours of machine learning parameter optimization. Operator
 : E  ~|M| builds at each step of learning partition ~|M| , which is displayed by
operator  on the distribution of binary feature vectors. Next, operator  : X  I |S| ,
where I |S| is the set of S</p>
      <p>hypotheses, tests the main statistical hypothesis
1 : xm(j,i)  X mo . The operator  determines the set |Q| of the precision characteristics
of the classification solutions, where Q  S 2 , and the operator  calculates the set of
values E of the information optimization criterion, which is a functional of the
precision characteristics. The loop of optimization of control tolerances for recognition
features is closed through a term set of D elements which is the value of the system
of control tolerances for recognition features. An optimization loop that includes a
term set of R values of the sides of a square image frame optimizes the area of the
frame. The operator r1 resizes the frame, and the operator r2 resizes the space of the
recognition features. The operator u governs the process of machine learning.
4</p>
      <p>Information-extreme machine learning algorithm</p>
      <p>According to the categorical model (Fig. 1), the information-extreme algorithm of
machine learning of the ORS with optimization of the frame size of the digital image
of the region will be presented in the form of an iterative procedure for finding the
global maximum of alphabet-averaged classes of recognition of the information
criterion in the working (allowable) area of determining its
r *  arg max{max{ max E</p>
      <p>
        Gr G |GE {r}
(r)
(
        <xref ref-type="bibr" rid="ref3">3</xref>
        )
where r* is the optimal side size of the square frame of the digital image; E (r) 
the information criterion for optimization of vector parameters calculated on the r -th
step of machine learning averaged by the alphabet of recognition classes (
        <xref ref-type="bibr" rid="ref1">1</xref>
        ); G is a
valid value range for parameter δ of the tolerance field.
      </p>
      <p>The input to the machine learning algorithm is a training matrix in the form of a
three-dimensional array of feature vectors {ym(j,)i} and a system of fields of normalized
tolerances {H ,i} for recognition traits that specifies the range of values of the
corresponding control tolerances.</p>
      <p>
        The main stages of information-extreme machine learning of the ORS are:
1. definition for a given alphabet of recognition classes {X mo } of base class X1o ,
relative to which a system of control tolerances for recognition features is specified;
2. optimization by the information criterion (
        <xref ref-type="bibr" rid="ref2">2</xref>
        ) of the parameters of machine
learning of the ORS, which are included in the structure (
        <xref ref-type="bibr" rid="ref1">1</xref>
        );
      </p>
      <p>3. construction of decisive rules for optimal geometric parameters of containers
of recognition classes, which were restored in the process of machine learning in the
radial basis of the binary space of recognition features;
4. check the functional efficiency of machine learning ORS in exam mode.
The definition of base class X1o is made according to the scheme:
1. the counter of base recognition classes is reset: b : 0 ;
2. the counter of base recognition classes is initialized: b : b 1;
3. the counter of the recognition classes is reset: m : 0 ;
4. m : m  1;
5. the counter of steps of changing the radii of containers of recognition classes is
reset: k : 0 ;
6. the averaged ym vector is defined for array {ym(j,i)} ;
7. if b  b  1 and m  m  1 , then ym : yb , that is, vector ym is taken as the
base and the point 8 is fulfilled, otherwise – the point 9;</p>
      <p>8. are calculated for each i -th sign of vector yb lower AHK ,i[b] and upper
ABK ,i[b] control tolerances by the formulas</p>
      <p>AÂK ,i[b]  yb,i   ,
9. where yb,i is the value of the i-th sign of the average vector of class yb
recognition X mo ;</p>
      <p>
        10. formed a three-dimensional array of binary learning matrix {xm(j,i) } , elements of
which are calculated by the rule
xm(j,i)  1, if AHK,i[b]  ymj ,i  ABK,i[b];
0, if else.
(
        <xref ref-type="bibr" rid="ref4">4</xref>
        )
11. for array {xm(j,i) } is determined by the average binary vector xm ;
12. if m  M , then item 4, is fulfilled, otherwise – item 12;
13. for the set of vectors {xm}, a code distance matrix is constructed and pairs of
nearest neighbors for which hyperspherical containers of recognition classes are
restored in the process of machine learning;
14. m : m  1;
15. the counter of steps of change of radius of containers of recognition classes is
initialized: k : k 1;
      </p>
      <p>
        16. the information criterion E m(k ) of optimization of machine learning parameters
is calculated according to the learning matrices of class X mo and its closest neighbor,
for example, in the form of a modified Kullback information measure:
E (k )  1
m n
 2n  K1(,km)  K2(.km)  10 p 

{n  [K1(,km)  K2(,km), ]}log2  K1(,km)  K2(k,m)  10 p  ,
(
        <xref ref-type="bibr" rid="ref5">5</xref>
        )
where K1(,km) is the number of events in which “their” recognition attribute vectors did
not belong to class X mo ; K 2(,km) is the number of events in which “alien” feature
vectors belonged to class X mo ; n is the number of feature vectors in the learning matrix
of each recognition class; 10 p is a sufficiently small number that is entered to avoid
division by zero (in practice, p is selected from the interval 1  p  3 .
17. if k  d (xm  xc ) , then item 14 is fulfilled, otherwise – item 17;
18. in the work area GE is determined by the maximum value Em*(k) information
criterion (
        <xref ref-type="bibr" rid="ref5">5</xref>
        );
19. if b  M , then item 2 is fulfilled, otherwise – item 19;
*
*
20. according to formula (
        <xref ref-type="bibr" rid="ref2">2</xref>
        ) the average maximum value E
lated (
        <xref ref-type="bibr" rid="ref5">5</xref>
        );
of criterion is
calcu21. the recognition class for which the value of criterion E (
        <xref ref-type="bibr" rid="ref5">5</xref>
        ) is maximum is
taken as the base;
22. STOP.
      </p>
      <p>
        After determining the base class, the ORS machine learning procedure (
        <xref ref-type="bibr" rid="ref3">3</xref>
        ) is
started with the optimization of the control tolerance system for the features of recognition
and frame size. The main functions of the inner cycle of procedure (
        <xref ref-type="bibr" rid="ref3">3</xref>
        ) are:
─ mation criterion (
        <xref ref-type="bibr" rid="ref5">5</xref>
        ) at each step of machine learning with values of control
tolerance field  and frame size of region image set in corresponding external cycles;
─ search for the global maximum of the information criterion for optimization of
machine learning parameters in the working (valid) area of determining its function;
─ determination of the geometric parameters of recognition classes optimal in the
information understanding.
      </p>
      <p>
        The input for the implementation of procedure (
        <xref ref-type="bibr" rid="ref3">3</xref>
        ) is the alphabet of recognition
classes {X mo } , in which class X1o is the base, the corresponding three-dimensional
array of the training matrix {ym(j,)i} , parameter H , which determines the system of
normalized tolerances for recognition features and the maximum permissible size rmax
side square frames of digital image of the region .
      </p>
      <p>
        Consider the scheme of the algorithm of information-extreme machine learning
with optimization of the frame size of the digital image of the region by the procedure
(
        <xref ref-type="bibr" rid="ref3">3</xref>
        ):
1. resetting the step counter of resizing frames in the region image: r : 0 ;
2. r :r  1 ;
3. reset the counter of recognition classes: m : 0 ;
5. resetting the training frame resizing step counter: r : 0 ;
6. r : r  1 ;
7. resetting the step counter to change the tolerance field parameter:  : 0;
8.  :   1; ;
9. calculation of the lower and upper {AB,i} control tolerances for recognition
signs according to the rules
      </p>
      <p>
        AH,i  y1, i  ; AB,i  y1, i   ,
(
        <xref ref-type="bibr" rid="ref6">6</xref>
        )
10. where y1,i is the i -th sign of the averaged vector y1 of the base recognition
class X1o ;
      </p>
      <p>
        11. resetting the counter of the steps of changing the radius of the hyperspherical
container: k : 0 ;
12. k : k 1;
13. formed a three-dimensional array of binary learning matrix, the elements of
which are calculated by the rule (
        <xref ref-type="bibr" rid="ref4">4</xref>
        );
      </p>
      <p>14. the formation of an array of averaged vectors of signs {xm} whose elements are
determined by the rule

1, if
xm,i  
0, if
1 n xm(j,i)  m ;
n j1
else,
15. where m is the quantization level of the coordinates of binary vector xm ,
which by default is 0,5.</p>
      <p>
        16. splitting the set of vectors {xm } into pairs of nearest “neighbors”
|m2|  xm , xc  , where xc is the averaged vector of the nearest neighbor class Xco ;
17. the information criterion (
        <xref ref-type="bibr" rid="ref2">2</xref>
        ) is calculated;
18. if k  N , then item 11 is executed, otherwise – item 17;
19. if   H , then item 8 is executed, otherwise – item 18;
20. the maximum value of the criterion in the workspace of determining its
function is determined, where the first and second reliability are greater than 0.5;
21. if m  M 1 , then item 4, otherwise – item 20;
22. if r  rmax , then item 6 is executed, otherwise – item 21;
23. determines the global maximum of average information criterion E* in the
work area of determining its function;
24. determine the optimal values of parameter * , lower AH ,i and upper AB*,i
con*
trol tolerances for all recognition features and size r* side square frames of the digital
image of the region;
25. STOP.
      </p>
      <p>
        According to the optimal geometric parameters of the containers of recognition
classes obtained in the process of machine learning, productive decision rules were
constructed in the form
(X mo |M| )(x( j) |M| )[if (m  0 ) &amp; (m  max{m )
{m}
then x( j)  X mo else x( j)  X mo ],
(
        <xref ref-type="bibr" rid="ref7">7</xref>
        )
where x( j) is a recognizable vector; m is a function of belonging to vector x( j) of a
recognition class container X mo .
      </p>
      <p>
        In expression (
        <xref ref-type="bibr" rid="ref7">7</xref>
        ), the membership function for a hyperspherical container of
recognition class X mo is determined by the formula [3]
m  1
d(xm*  x( j) )
d m*
,
where xm* , dm* – the optimal parameters of machine learning: averaged feature vector
and radius of hyperspherical container recognition class X mo respectively.
      </p>
      <p>
        Thus, in the exam, it is determined by decisive rules (
        <xref ref-type="bibr" rid="ref7">7</xref>
        ) that the recognizable
feature vector belongs to one of the classes in the given alphabet. At the same time, the
decisive rules, built within the geometric approach, are characterized by low
computational complexity, which provides high efficiency of making classification decisions
in the operation of ORS in the operating mode.
5
      </p>
    </sec>
    <sec id="sec-3">
      <title>Simulation results</title>
      <p>An algorithm of information-extreme machine learning of ORS is implemented with
the purpose of optimizing the image of the region in understanding the information,
the receptor field of which is shown in Fig. 2 [11].</p>
      <p>The input training matrix was formed by processing the image frames shown in
Figure 3 in the polar coordinate system according to [12]. As recognition classes, the
frames of the sections shown in Fig. 2 images of the region: class X1o – highway;
class X 2o – liquid forest; class X3o – plowing field; class X 4o – sown field.</p>
      <p>The selected frames are shown in Fig. 3.</p>
      <p>а
b
c
d</p>
      <p>In the previous stage of machine learning, the results of the implementation of the
above algorithm were identified as the base class of recognition X1o – highway.
Therefore, the system of control tolerances was determined relative to the averaged
vector of features of recognition class X1o .</p>
      <p>
        In the process of machine learning ORS according to procedure (
        <xref ref-type="bibr" rid="ref3">3</xref>
        ), the value of
parameter r increased from one to 71 pixels of the receptor field of the video card.
      </p>
      <p>Table 1 shows results of machine learning using side of the square frame
optimization.
frame size of the image value is equal to r*  47 pixels with a maximum value of
*
E  0,70 information criterion.</p>
      <p>
        Fig. 4 shows a graph of the averaged normalized information criterion (
        <xref ref-type="bibr" rid="ref5">5</xref>
        ) from
parameter of control tolerances system  using optimal side of the square frame
1,0 Ē
0,8
0,6
0,4
0,2
0,0
10
20
30
40
50
60
70
δ
Fig. 4. Graph of information criterion dependence on parameter of control tolerances system
      </p>
      <p>Fig. 4 shows a dark area on the graph of the working (admissible) area of
determining the function of the information criterion of optimization, in which the first and
second reliability exceed respectively the errors of the first and second kind.</p>
      <p>
        The analysis of Fig. 4 shows that, in the process of machine learning, the optimal
value of parameter of control tolerances system is equal to *  50 (scale of pixel’s
brightness) with a maximum value of E*  0,70 information criterion. Fig. 5 shows
graphs of information criterion (
        <xref ref-type="bibr" rid="ref5">5</xref>
        ) dependence on the radii of containers of
recognition classes the optimal values of which allow us to construct the decisive rules (
        <xref ref-type="bibr" rid="ref7">7</xref>
        ).
5
10
15
25
30
5
10
15
20
25
30
35
1,0 E 1
0,8
0,6
0,4
0,2
0,0
1,0 E 3
0,8
0,6
0,4
0,2
0,0
i
20
а
c
1,0 E 2
0,8
0,6
0,4
0,2
      </p>
      <p>The analysis of Fig. 5 shows that the optimum values of the radii of the containers
of the recognition classes are: for the class X1o – d1*  26 (hereinafter in code units);
for class X 2o – d2*  6 ; for class X 3o – d3*  5 and class X 4o – d4*  1 .</p>
      <p>
        Fig. 6 shows a digitized image (Fig. 3), obtained by the results of the identification
of frames by the decisive rules (
        <xref ref-type="bibr" rid="ref7">7</xref>
        ) with the optimal frame size of the pixel image. The
numbers in the frames correspond to the numbers of the recognition classes.
      </p>
      <p>Visual analysis of Fig. 6 shows that highways that are of interest for vehicle
recognition are identified with a sufficiently high accuracy when the frame size is
optimal.
6</p>
      <p>Conclusion
1. Within the framework of functional approach to modeling of cognitive processes
of formation and decision-making of classification decisions, a catheter model is
proposed, which is considered as a generalized structural diagram of the algorithm of
information-extreme machine learning of the image recognition system
2. On the basis of the proposed categorical model, an algorithm of
informationextreme machine learning of the onboard recognition system was developed with
optimization according to the information criterion of the frame size of the digital
image of the region. The algorithm allows for a given flight altitude of an unmanned
aerial vehicle complex to determine quickly and with high accuracy the area of
interest in which the wanted land object may be located.
3. Since the decisive rules are not infallible by the learning matrix, to increase the
functional efficiency of ORS, it is necessary to increase the depth of machine
learning by optimizing other parameters of operation, including the parameters of the
formation of the input mathematical description.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <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="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Duda</surname>
            ,
            <given-names>R.O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hart</surname>
            ,
            <given-names>P.E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Stork</surname>
            ,
            <given-names>D.G.</given-names>
          </string-name>
          : Pattern Classification: second ed. John Wiley &amp; Sons, New York (
          <year>2001</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <given-names>Jauregi</given-names>
            <surname>Iztueta</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            ,
            <surname>Lazkano</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            ,
            <surname>Martinez-Otzeta</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.M.</given-names>
            ,
            <surname>Sierra</surname>
          </string-name>
          ,
          <string-name>
            <surname>B.</surname>
          </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>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <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>In: Proceedings Sixth International Conference on Natural Computation (ICNC</source>
          <year>2010</year>
          ), Yantai, Shandong, China, pp.
          <fpage>3734</fpage>
          -
          <lpage>3738</lpage>
          (
          <year>2010</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Moskalenko</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Moskalenko</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Korobov</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Boiko</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Martynenko</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Borovenskyi</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          :
          <article-title>Model and Training Methods of Autonomous Navigation System for Compact Drones</article-title>
          .
          <source>In: Proceedings Second International Conference on Data Stream Mining &amp; Processing (DSMP)</source>
          , Lviv, IEEE, pp.
          <fpage>503</fpage>
          -
          <lpage>508</lpage>
          (
          <year>2018</year>
          ). doi:
          <volume>10</volume>
          .1109/DSMP.
          <year>2018</year>
          .8478521
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Artale</surname>
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Collotta</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Milazzo</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          , et al.:
          <article-title>Real-Time System based on a Neural Network and PID Flight Control</article-title>
          .
          <source>Appl. Math. Inf. Sci.</source>
          , vol.
          <volume>10</volume>
          (
          <issue>2</issue>
          )., pp.
          <fpage>395</fpage>
          -
          <lpage>402</lpage>
          (
          <year>2016</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Jafari</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Xu</surname>
          </string-name>
          ., H.:
          <article-title>Intelligent Control for Unmanned Aerial Systems with System Uncertainties and Disturbances Using Artificial Neural Network</article-title>
          .
          <source>Drones</source>
          , vol.
          <volume>3</volume>
          , pp.
          <fpage>24</fpage>
          -
          <lpage>36</lpage>
          (
          <year>2018</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <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:
          <volume>10</volume>
          .3103/s1060992x13020082
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <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:
          <volume>10</volume>
          .1615/JAutomatInfScien.v43.
          <year>i2</year>
          .
          <fpage>60</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Dovbysh</surname>
          </string-name>
          , А.S.,
          <string-name>
            <surname>Moskalenko</surname>
            ,
            <given-names>V.V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rizhova</surname>
            ,
            <given-names>A.S.</given-names>
          </string-name>
          :
          <article-title>Information-Extreme Method for Classification of Observations with Categorical Attributes</article-title>
          .
          <source>Cibernetica and Systems Analysis</source>
          , vol.
          <volume>52</volume>
          (
          <issue>2</issue>
          ), pp.
          <fpage>45</fpage>
          -
          <lpage>52</lpage>
          (
          <year>2016</year>
          ).
          <source>doi: 10.1007/s10559-016-9818-1</source>
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <article-title>The world's most detailed globe</article-title>
          , https://www.google.com.ua/intl/en/earth/
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Naumenko</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Myronenko</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Piatachenko</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          :
          <article-title>Information-extreme learning of on-board system for recognition of ground vehicle</article-title>
          .
          <source>CEUR Workshop Proceedings</source>
          , p.
          <fpage>121</fpage>
          -
          <lpage>132</lpage>
          (
          <year>2019</year>
          ).
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>