<!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>Efficiency of Stochastic Gradient Identification of Similar Shape Objects in Binary and Grayscale Images</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Radik Magdeev</string-name>
          <email>radiktkd2@yandex.ru</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Aleksander Tashlinsky</string-name>
          <email>tag@ulstu.ru</email>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Galina Safina</string-name>
          <email>safinagl@mgsu.ru</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>LLC “Telecom.ru”</institution>
          ,
          <addr-line>Ulyanovsk</addr-line>
          ,
          <country country="RU">Russia</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>National Research Moscow State, University of Civil Engineering</institution>
          ,
          <addr-line>Moscow</addr-line>
          ,
          <country country="RU">Russia</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>Radio Engineering Department, Ulyanovsk State Technical University</institution>
          ,
          <addr-line>Ulyanovsk</addr-line>
          ,
          <country country="RU">Russia</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2020</year>
      </pub-date>
      <fpage>25</fpage>
      <lpage>28</lpage>
      <abstract>
        <p>-A comparative analysis of efficiency of stochastic gradient identification method on the base of pattern of objects with similar shapes by their grayscale and binary images is carried out. Object identification is understood as the determination of the object image in the studied image with the estimation of its spatial parameters in relation to the reference image. Two types of objects with similar shape are investigated on the base of COIL-20 halftone images and their binary versions. The objects of the first type have a different character of the curvature of the lines describing their contour, and the objects of the second type are close to the curvature characteristics of the contour lines.</p>
      </abstract>
      <kwd-group>
        <kwd>binary image</kwd>
        <kwd>grayscale image</kwd>
        <kwd>recognition</kwd>
        <kwd>pattern recognition</kwd>
        <kwd>stochastic identification</kwd>
        <kwd>parameter estimation</kwd>
        <kwd>convergence</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>I. INTRODUCTION</title>
      <p>
        The problem of pattern recognition, both on separate
images and on video sequences, arises in a variety of areas:
from military affairs and security systems to the digitization
of analog signals. The problem of automating the solution of
this problem remains relevant both from the point of view of
theory and technical implementation [
        <xref ref-type="bibr" rid="ref1 ref2 ref3">1-3</xref>
        ]. Pattern
recognition, as a rule, is considered as assigning on the basis
of the initial data of the object in the image, to a certain class
(group of classes) by comparing the selected essential
features characterizing this class. The main difficulty in this
case is to establish the correspondence between the object
highlighted in the studied image and the given patterns
(images of the object’s standards) based on a finite set of
some properties and attributes. Note that there are several
areas in pattern recognition:
      </p>
      <p>– recognition of many predefined objects, or classes of
objects in the image;</p>
      <p>– object detection, implemented by checking the image
or its part for compliance with certain conditions;
– identification on the image of the object with the
assessment of its parameters and decision making.</p>
      <p>
        In [
        <xref ref-type="bibr" rid="ref4 ref5">4, 5</xref>
        ] it is shown that identifying images of objects by
a pattern can be reduced to searching for a spatial
transformation that minimizes the distance between the
desired image and the pattern in a given metric space, and a
stochastic gradient identification method (SGIM) of objects
on binary images is proposed, which showed good
efficiency in comparison with the correlation-extreme
method [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] and the contour analysis method [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]. This article
discusses the effectiveness of SGIM for grayscale images in
comparison with its usage for binarized images.
      </p>
      <p>
        For concreteness, we will assume that possible
deformations of the identified object with respect to the
pattern can be reduced to a similarity model [
        <xref ref-type="bibr" rid="ref8 ref9">8, 9</xref>
        ], that is,
 , orientation angle  , and shifts h   h x , h y 
the pattern and image of the object can differ in scale factor
T
along the
basic axes О х and Оу , in addition, additive noise. We
used the COIL-20 halftone images including images of 1440
objects [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ]. In this case, binary versions were obtained for
each of the halftone images. A number of examples of
halftone images and their binary versions are shown in
Fig. 1.
      </p>
    </sec>
    <sec id="sec-2">
      <title>II. IDENTIFICATION METHOD DESCRIPTION</title>
      <p>
        In SGIM the identification parameters ˆ , on the basis of
which the decision is made, are searched recursively [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ]:

  
ˆ t  ˆ t  1  Λ t β t 

where β t is the stochastic gradient of the cost function of
identification quality, depending on ˆ t 1 and the iteration
number t  0 , T ; Λ t is the gain matrix [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ]; Т is the
number of iterations. It was shown in [
        <xref ref-type="bibr" rid="ref11 ref13">11, 13</xref>
        ] that it is
advisable to use the brightness correlation coefficient (BCC)
or the mean square of the brightness difference (MSBD) of
the pattern and the studied image as the cost function, which
were used in this work. Hereinafter, a pattern refers to a
reference image of an object. At each iteration, in order to
find the next estimate of the parameter vector
twodimensional local sample of the same samples on the pattern
and the studied image is used. As a rule, this sample has
small size [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ].
      </p>
      <p>
        The effective working range of the estimated parameters
of the SGIM (in which the estimates for a given number of
iterations do not go beyond the required confidence interval)
is limited. If it does not cover the domain of parameters, then
to provide coverage it is required to specify several patterns
with different initial approximations of the parameters. It was
also shown in [
        <xref ref-type="bibr" rid="ref4 ref5">4, 5</xref>
        ] that in order to increase the convergence
rate of estimates and to expand the working range for binary
images it is advisable to use low-pass filtering, for example,
Gaussian, as the pre-processing. The optimal size of the
mask of a Gaussian filter for binary images is 10 % of the
identified object size.
      </p>
      <p>
        It was also shown in [
        <xref ref-type="bibr" rid="ref4 ref5">4, 5</xref>
        ] that in order to increase the
convergence rate of estimates and to expand the working
range for binary images, it is advisable to use low-pass
filtering, for example, Gaussian, as the pre-processing. The
optimal size of the mask of a Gaussian filter for binary
images is 10% of the identified object size.
      </p>
      <p>
        The studies using halftone images from the COIL-20
base have also shown the appropriateness of low-pass
filtering. In this case, the optimal size of the Gaussian filter
mask, which allows expanding the operating range of the
SGIM while maintaining identification accuracy, is from 3 %
to 10 % of the of the object size in the image. We also note
that the approximate implementation of the Gaussian filter
proposed in [
        <xref ref-type="bibr" rid="ref15 ref16">15, 16</xref>
        ] and based on infinite impulse response
is used. The computational complexity of the approach used
does not depend on the size of the filter mask and is
approximately 1 6 L x L y elementary operations, where L x and
L y are the image sizes.
      </p>
      <p>
        The computational complexity of the stochastic gradient
parameter estimation procedure that underlies the SGIM
was studied in [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ] and, in particular, is similar to the
parameters of the similarity model when using MSBD from
 2 2   2 5  Т to  5 2   2 0  Т elementary operations
(depending on the chosen method of finding the
pseudogradient of the objective function), and when using the BCC
from  5 1  9 1  Т to  6 9   4 8  Т elementary operations,
where  is the local sample size at each iteration.
      </p>
      <p>As a characteristic of the SGIM efficiency for binary and
grayscale images, we use the convergence of the standard
deviation (SD) ˆ t of the brightness differences of the
modified pattern and the studied image, which is calculated
at each t -th iteration from a local sample of identifiable
image and pattern samples, t  0 , T . Example of ˆ t
convergence graphs for the left object of Fig. 1 (car) with
the mismatch parameters of the pattern and the studied
T
object:   0 .8 5 ,   3 5 0 , h   h x , h y    6 ,  6 T , is
shown in Fig. 2, where graph (a) corresponds to a halftone
image, and (b) a binary image. The studied images and
corresponding patterns are shown in Fig. 3, and the
convergence graphs of the estimates of individual
identification parameters are shown in Fig. 4, where the
solid line corresponds to the grayscale images and the
dashed line corresponds to binary images. The image sizes
are 128x128 elements, the local sample size is   1 5 .</p>
      <p>It can be seen from the plots that for this object estimates
ˆ T
of the identification parameters ˆ t  ˆ t , ˆ t , ht 
when
processing halftone images and patterns converge slower
(for about 400 iterations) than when processing their
binarized versions (for about 200 iterations). This is
explained by the large size of the low-pass filter during
image preprocessing. Thus, both the rate of convergence of
estimates and the effective working range when using
grayscale and binarized images can vary. This is especially
true for images of objects having a similar shape. hˆ x t
III. IDENTIFICATION OF OBJECTS WITH A SIMILAR SHAPE</p>
      <p>Using the objects of the COIL-20 images, we consider
two types of objects that are similar in shape: the curvatures
of the lines describing the contour of a different nature (the
objects shown in Fig. 5a can serve as an example), and with
similar curvature characteristics of the contour lines (an
example of such objects is shown in Fig. 5b). The indicated
figures also show binary versions of the images of these
objects. Obviously, the studied types of objects are critical in
the processing of binary images.</p>
      <p>
        In the experiment, the identification method proposed in
[
        <xref ref-type="bibr" rid="ref18">18</xref>
        ] was applied and based on three criteria, one of which
uses the correlation coefficient between the studied
(deformed) image of the object and the patterns transformed
using SGIM (we will conventionally call this criterion the
main one). Two other criteria use convergence characteristics
of identification parameters (additional criteria). One
characteristic is the estimation of the mean value of the
standard deviation of the brightness differences of the
modified pattern and the studied image in the steady state of
the process of evaluating the SGIM identification
parameters. This characteristic is in iterations of steady state.
Another characteristic is the standard deviation of values,
also at iterations of the steady state.
      </p>
      <p>The steady state of the identification process is clearly
illustrated in Fig. 2. The decision on identification is made if
all three criteria are fulfilled:</p>
      <p>
        R  R t , mˆt  mtˆi ,  ˆi   tˆi ,
t and  tˆi are threshold values. The threshold
where R t , mˆi
values of the identification criteria for the used image
database were determined by the method [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ]:
      </p>
      <p>The following results are obtained for the first type of
objects. For the binarized images, the correlation coefficient
between the image of the object and the “correct” pattern is
R  0 .9 9 and exceeds the threshold value. For this pair the
additional criteria are also fulfilled:</p>
      <p>However, the correlation coefficient between the image
of the object and similar patterns transformed by the SGIM
also exceeds the identification threshold value ( R  0 , 9 4 ).
At the same time, the numerical values of auxiliary
characteristics do not reach threshold values, although they
are quite close to them ( mˆt  1 1 ,  ˆi  7 .3 ). For grayscale
images, the correlation coefficient between the image of the
object and the “correct” pattern is also 0.99 and exceeds the
threshold value, and the correlation coefficient with similar
patterns ( R  0 .7 ) is significantly lower than the threshold.
Additional criteria for the “correct” pattern are also fulfilled:</p>
      <p>Thus, for this type of object, when binarizing their
images, the decision on identification requires the use of
additional criteria. For grayscale images, a decision on
identification is possible using only the main criterion for
the correlation coefficient, and additional ones can be used
to assess the reliability of the identification.</p>
      <p>An analysis of the usage of SGIM for binary images of
objects of similar shape in the second type showed that all
identification criteria are satisfied, both for the “correct”
pattern and for similar ones. So, for the “correct” pattern
are:</p>
      <p>R  0 .9 9 , mˆt  1 .3 1  mtˆi ,  ˆi  0 .8 9   tˆi
and for similar are:</p>
      <p>R  0 , 9 7 , mˆt  7 .2  mtˆi ,  ˆi  1 .4   tˆi .</p>
      <p>For grayscale images, the correlation coefficient between
the image of the object and the “correct” pattern exceeds the
threshold, but less than in the other cases considered
( R  0 .9 6 ). The values of the additional characteristics are
significantly lower than the threshold:</p>
      <p>m ˆ t  1.81,  ˆ i  1.74.</p>
      <p>For similar pattern, the criterion for the correlation
coefficient is not satisfied ( R  0 .8 3 ) and the values of the
auxiliary characteristics significantly exceed the threshold
( mˆt  2 3 .3 ,  ˆi  1 2 .3 ).</p>
      <p>Thus, for objects of similar shape with similar
characteristics of contour lines curvature, their identification
by the pattern from binarized images is ineffective. When
identifying this type of objects by their grayscale images, it
is advisable to use the additional criteria used in the work.</p>
      <p>It should be noted that the effective operating range of
SGIM for images of this type is significantly reduced. So,
when choosing similarity model parameters as identification
parameters, for the images considered, it is:   0 .8 ... 1 .1 ;
   1 0 0 ...  1 0 0 ; h   5 ...  5 pixels. This is due to the
fact that such images differ mainly in texture, and the
preliminary low-pass filtering procedure smooths the
texture, so the size of the preprocessing filter mask does not
exceed 3 % of the size of the object.</p>
    </sec>
    <sec id="sec-3">
      <title>IV. CONCLUSION</title>
      <p>A comparative analysis showed that the extension of the
SGIM to grayscale images does not impair its performance
in computational complexity, but slightly reduces the
effective operating range and the convergence rate of
identification parameters. This is due to the fact that with the
same reliability of identification of objects, grayscale images
allow a smaller size of the low-pass filter during
preprocessing.</p>
      <p>A study on the basis of COIL-20 images of identifying
objects of similar shape with different curvatures
characterizing the lines of an object’s contour showed that
with close characteristics of the curvature of contour lines,
identification by binarized images is ineffective. When
identifying by grayscale images, it is advisable to increase
the reliability of using, in addition to correlation criteria,
additional ones based on the characteristics of the process of
convergence of identification parameters. For objects of
similar shape with different characteristics of the contour
lines curvature, when binarizing their images, the decision to
identify also requires the use of additional criteria. For
grayscale images, a solution is possible using only the
correlation criterion, and additional ones can be used to
assess the reliability of identification.</p>
      <p>We also note that in order to solve the problem of
identification of objects according to a pattern the criterion
based on correlation and referred in this paper as “basic” is
not significant for identification in many cases.</p>
    </sec>
    <sec id="sec-4">
      <title>ACKNOWLEDGMENT</title>
      <p>The reported study was funded by RFBR &amp; Government
of the Ulyanovsk region according to the research projects №
19-29-09048 and № 19-47-730004.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>S.M.</given-names>
            <surname>Borzov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.A.</given-names>
            <surname>Guryanov</surname>
          </string-name>
          and
          <string-name>
            <surname>O.I. Potaturkin</surname>
          </string-name>
          , “
          <article-title>Study of the classification efficiency of difficult-to-distinguish vegetation types using hyperspectral data,” Computer Optics</article-title>
          , vol.
          <volume>43</volume>
          , no.
          <issue>3</issue>
          , pp.
          <fpage>464</fpage>
          -
          <lpage>473</lpage>
          ,
          <year>2019</year>
          . DOI:
          <volume>10</volume>
          .18287/
          <fpage>2412</fpage>
          -6179-2019-43-3-
          <fpage>464</fpage>
          -473.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>A.V.</given-names>
            <surname>Poltavskii</surname>
          </string-name>
          and
          <string-name>
            <given-names>A.V.</given-names>
            <surname>Grinshkun</surname>
          </string-name>
          , “
          <article-title>Basics of pattern recognition using computer,” Dvoinie Tehnologii</article-title>
          , vol.
          <volume>2</volume>
          , pp.
          <fpage>55</fpage>
          -
          <lpage>66</lpage>
          ,
          <year>2017</year>
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>S.V.</given-names>
            <surname>Kurochkin</surname>
          </string-name>
          , “
          <article-title>Detection of the homotopy type of an object using differential invariants of an approximating map</article-title>
          ,”
          <source>Computer Optics</source>
          , vol.
          <volume>43</volume>
          , no.
          <issue>4</issue>
          , pp.
          <fpage>611</fpage>
          -
          <lpage>617</lpage>
          ,
          <year>2019</year>
          . DOI:
          <volume>10</volume>
          .18287/
          <fpage>2412</fpage>
          -6179-2019- 43-4-
          <fpage>611</fpage>
          -617.
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>R.G.</given-names>
            <surname>Magdeev</surname>
          </string-name>
          and
          <string-name>
            <given-names>A.G.</given-names>
            <surname>Tashlinskii</surname>
          </string-name>
          , “
          <article-title>A comparative analysis of the efficiency of the stochastic gradient approach to the identification of objects in binary images,” Pat. Rec. and</article-title>
          <string-name>
            <surname>Im. Anal.</surname>
          </string-name>
          , vol.
          <volume>24</volume>
          , no.
          <issue>4</issue>
          , pp.
          <fpage>535</fpage>
          -
          <lpage>541</lpage>
          ,
          <year>2014</year>
          . DOI:
          <volume>10</volume>
          .1134/S1054661814040130.
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>R.G.</given-names>
            <surname>Magdeev</surname>
          </string-name>
          and
          <string-name>
            <given-names>A.G.</given-names>
            <surname>Tashlinskii</surname>
          </string-name>
          , “
          <article-title>Efficiency of object identification for binary,” Computer Optics</article-title>
          , vol.
          <volume>43</volume>
          , no.
          <issue>2</issue>
          , pp.
          <fpage>277</fpage>
          -
          <lpage>281</lpage>
          ,
          <year>2019</year>
          . DOI:
          <volume>10</volume>
          .18287/
          <fpage>2412</fpage>
          -6179-2019-43-2-
          <fpage>277</fpage>
          -281.
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>V.A.</given-names>
            <surname>Kovalevsky</surname>
          </string-name>
          , “
          <article-title>Methods of optimal solutions in image recognition</article-title>
          ,” Moscow: Nauka Publisher,
          <year>2003</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>Ya.A.</given-names>
            <surname>Furman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.V.</given-names>
            <surname>Krevetsky</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.K.</given-names>
            <surname>Peredeyev</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.A.</given-names>
            <surname>Rozhentsov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.G.</given-names>
            <surname>Khafizov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>I.L.</given-names>
            <surname>Egoshina</surname>
          </string-name>
          and
          <string-name>
            <given-names>A.L.</given-names>
            <surname>Leukhin</surname>
          </string-name>
          , “
          <article-title>Introduction to contour analysis and its applications to image and signal processing</article-title>
          ,” Moscow: Fizmatlit Publisher,
          <year>2003</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>R.</given-names>
            <surname>Gonzalez</surname>
          </string-name>
          and
          <string-name>
            <given-names>R</given-names>
            <surname>Woods</surname>
          </string-name>
          , “Digital image processing,” Upper Saddle River: New Jersey: Prentice Hall,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>A.G.</given-names>
            <surname>Tashlinskii</surname>
          </string-name>
          , “
          <article-title>Estimation of the parameters of spatial deformations of image sequences,”</article-title>
          <source>Ulyanovsk: UlSTU Publisher</source>
          ,
          <year>2000</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>S.A.</given-names>
            <surname>Nene</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.K.</given-names>
            <surname>Nayar</surname>
          </string-name>
          and
          <string-name>
            <given-names>Y.</given-names>
            <surname>Murase</surname>
          </string-name>
          , “Columbia Object Image Library,” COIL-20 [Online]. URL: http://www.cs.columbia. edu/CAVE/software/softlib/coil-20.php.
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>A.G.</given-names>
            <surname>Tashlinskii</surname>
          </string-name>
          , “
          <source>Pseudogradient Estimation of Digital Images Interframe Geometrical Deformations,” Vision Systems: Segmentation &amp; Pattern Recognition</source>
          , pp.
          <fpage>465</fpage>
          -
          <lpage>494</lpage>
          ,
          <year>2007</year>
          . DOI:
          <volume>10</volume>
          .5772/4975.
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <surname>Ya</surname>
            .
            <given-names>Z.</given-names>
          </string-name>
          <string-name>
            <surname>Tsypkin</surname>
          </string-name>
          , “Information theory of identification,” Moscow: Fizmatlit Publisher,
          <year>1995</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>A.G.</given-names>
            <surname>Tashlinskii</surname>
          </string-name>
          , “
          <article-title>The specifics of pseudogradient estimation of geometric deformations in image sequences,” Pattern Recognition and Image Analysis</article-title>
          , vol.
          <volume>18</volume>
          , no.
          <issue>4</issue>
          , pp.
          <fpage>706</fpage>
          -
          <lpage>711</lpage>
          ,
          <year>2008</year>
          . DOI:
          <volume>10</volume>
          .1134/S1054661808040287.
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>A.G.</given-names>
            <surname>Tashlinskii</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.V.</given-names>
            <surname>Dikarina</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.L.</given-names>
            <surname>Minkina</surname>
          </string-name>
          and
          <string-name>
            <given-names>A.N.</given-names>
            <surname>Repin</surname>
          </string-name>
          , “
          <article-title>Pseudogradient optimization in the estimation of geometric interframe image deformations,” Pattern recognition and image analysis</article-title>
          , vol.
          <volume>18</volume>
          , no.
          <issue>4</issue>
          , pp.
          <fpage>535</fpage>
          -
          <lpage>541</lpage>
          ,
          <year>2008</year>
          . DOI:
          <volume>10</volume>
          .1134/ S1054661814040130.
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <surname>L.J. van Vliet</surname>
          </string-name>
          ,
          <string-name>
            <given-names>I.T.</given-names>
            <surname>Young</surname>
          </string-name>
          and
          <string-name>
            <given-names>P.W.</given-names>
            <surname>Verbeek</surname>
          </string-name>
          , “Van Vliet Recursive Gaussian Derivative Filters,
          <source>” Proc. 14th Int. Conference on Pattern Recognition</source>
          , pp.
          <fpage>509</fpage>
          -
          <lpage>514</lpage>
          ,
          <year>1998</year>
          . DOI:
          <volume>10</volume>
          .1109/ICPR.
          <year>1998</year>
          .
          <volume>711192</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>D.</given-names>
            <surname>Hale</surname>
          </string-name>
          , “RecursiveGaussianfilters” [Online]. URL: https:// inside.mines.edu/~dhale/papers/Hale06RecursiveGaussianFilters.pdf.
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>G.L.</given-names>
            <surname>Fadeeva</surname>
          </string-name>
          , “
          <article-title>Optimization of the pseudo-gradient of the objective function in the estimation of inter-frame geometric deformations of images,” dis</article-title>
          . cand.
          <source>tech. Sciences: 05.13</source>
          .18,
          <string-name>
            <surname>Ulyanovsk</surname>
          </string-name>
          ,
          <year>2007</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>A.G.</given-names>
            <surname>Tashlinskii and R.G</surname>
          </string-name>
          . Magdeev, “
          <article-title>Increasing objects identification accuracy for binary images,” Informatsionnoizmeritel'nyye i upravlyayushchiye sistemy</article-title>
          , vol.
          <volume>12</volume>
          , pp.
          <fpage>24</fpage>
          -
          <lpage>30</lpage>
          ,
          <year>2017</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>