<!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>About One Principle to Identification of Shape of Object</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Ivan M. Gostev</string-name>
          <email>igostev@hse.ru</email>
          <xref ref-type="aff" rid="aff2">2</xref>
          <xref ref-type="aff" rid="aff3">3</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Leonid A. Sevastyanov</string-name>
          <email>sevast@gmail.com</email>
          <xref ref-type="aff" rid="aff1">1</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Vladimir S. Melezhik</string-name>
          <email>melezhik@theor.jinr.ru</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Bogoliubov Laboratory of Theoretical Physics Joint Institute for Nuclear Research 6 Joliot-Curie St, Dubna</institution>
          ,
          <addr-line>Moscow region, 141980, Russian Federation</addr-line>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Department of Applied Probability and Informatics Peoples' Friendship University of Russia (RUDN University)</institution>
          <addr-line>6 Miklukho-Maklaya St, Moscow, 117198, Russian Federation</addr-line>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>In: K. E. Samouylov, L. A. Sevastianov, D. S. Kulyabov (eds.): Selected Papers of the 12</institution>
        </aff>
        <aff id="aff3">
          <label>3</label>
          <institution>National Research University “Higher School of Economics” 20</institution>
          ,
          <addr-line>Myasnickaya str, Moscow, Russia, 101000</addr-line>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2018</year>
      </pub-date>
      <fpage>32</fpage>
      <lpage>40</lpage>
      <abstract>
        <p>Process of recognition of the shape of graphic objects consists of several stages. At the ifrst stage as a result of processing images allocate some set of characteristic properties of some object, and on the second, make identification of object by means of comparison of these properties with properties of the sample. Presence of noise on real images often leads to disturbance of quantity and values in a set of such characteristic properties. In job methods of preliminary processing of images for receiving of set characteristic properties of objects and present methods of the identification are stated, allowing identifying the shape of graphic objects in conditions when the part of a set of characteristic properties of object concerning the sample is absent or is deformed by noise. Feature of the ofered methods is their invariance to afine to transformations of the shape of object, and also high speed of identification, not dependent on complexity of identified object.</p>
      </abstract>
      <kwd-group>
        <kwd>and phrases</kwd>
        <kwd>Image Processing</kwd>
        <kwd>Pattern Recognition</kwd>
        <kwd>Computer Geometry</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        The decision of task of identification of shape of graphic objects essentially difers
from other problems of recognition by that first, images entering on an input of the
recognized device can include noise and have geometrical distortions. And secondly,
process of recognition of the shape of object as a rule is based on some characteristic
hardly formalized properties with which is necessary to receive from the image. And if
the first part – processing of the image now is well studied, the second part – process
of recognition is represented very complex task which decision can be subdivided into
two stages. At the first stage it is necessary to define native characteristic properties of
recognized object, and – on the second to develop a method allowing to these properties
to make comparison of some sample and recognized object. Complexity of the second
stage of process of identification consists of in necessity to operate hardly formalized
and verbally not expressed characteristics of the shape of graphic objects [
        <xref ref-type="bibr" rid="ref1 ref2">1, 2</xref>
        ].
      </p>
      <p>
        Recently the big attention is given one of directions of recognition at which as a result
of primary image processing the contour of some object is allocated [
        <xref ref-type="bibr" rid="ref3 ref4 ref5 ref6">3–6</xref>
        ]. This contour
further is transformed in the set of the points representing some closed curve [
        <xref ref-type="bibr" rid="ref7 ref8 ref9">7–9</xref>
        ]. As
the description of such contour values of function of curvature are used [
        <xref ref-type="bibr" rid="ref10 ref11 ref12 ref13 ref14 ref15 ref16 ref17">10–17</xref>
        ], and
as characteristic properties the points having it the maximal values are used [
        <xref ref-type="bibr" rid="ref18 ref19 ref20 ref21">18–21</xref>
        ],
see also [
        <xref ref-type="bibr" rid="ref22 ref23">22, 23</xref>
        ]. Despite of great number of variants of the decision of such problem,
stability of its decision is absent, as at the real image always presenting noise which lead
to distortion of contour of curve and, hence to change of its curvature. And it in turn
results or in smoothing some extremum (that is to removal), or to occurrence of new
points with the high curvature, not being characteristic properties of object.
      </p>
      <p>Thus, if to reject the first part of a problem of recognition – image processing and to
investigate the second part then a problem of identification to be used in the formulation
of development of the methods, allowing to identify the form of objects at partially
deformed contour. Analyzing above listed sources, it is obviously, that these methods
are reduced in general to robust to receiving of function of curvature by some tabular
defined of curve and do not mention methods of identification of the shape of object.
The purpose of the present job is the statement of the modified methods of formalization
of characteristic properties of shape of objects and representation of methods of their
identification.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Image Processing Stage</title>
      <p>
        Now for image processing there are well studied methods of primary processing and
receiving of the closed contours in the form of the verbal description [
        <xref ref-type="bibr" rid="ref2 ref3">2, 3</xref>
        ], not only in
details stated in the literature, but also realized in widely applied packages, such as
Matlab and LabVIEW. Using these packages for preliminary processing of the image and
receiving of contours, it is possible to concentrate attention to methods of construction
of the formal description of shape of object and development of methods of identification
on their basis.
      </p>
      <p>
        On fig. 1 the result of processing of a silhouette of the plane (at the left above)
with small noise level is shown. For reception of a contour of object (at the left above)
the following sequence of Matlab functions from package Image Processing has been
used: loading of the image; for removal of noise using a filtration; and method Contour
Following [
        <xref ref-type="bibr" rid="ref24">24</xref>
        ] for receiving of a contour of object.
      </p>
      <p>
        For identification of the shape of object as initial data the contour of the object has
been used received as a result of preliminary processing the image. It consisting from set
of points ( &gt;&gt; 1) — 123..., closed parameterized flat curve () = ((), ()),
1 ≤  ≤ . For construction of characteristic properties of object method Arch Height
for the first time published in 1992 [
        <xref ref-type="bibr" rid="ref25">25</xref>
        ], and in further repeatedly modified, for example
in [
        <xref ref-type="bibr" rid="ref26">26</xref>
        ] is used. The initial idea of this method consist in calculation Euclid of distance
, between a point of a curve –  and a chord as shown in fig. 2 which is proportional
to value of the module of curvature in this point.
      </p>
      <p>As a result of moving of the chord along the contour the function of curvature
represented on fig. 1 (below) turns out. As characteristic properties of such curve we
shall use a array of values of the greatest an extremum, which are received with use
of function findpeaks() from set Signal Processing Toolbox of package Matlab. For
cutting of of small extremum was using value of some threshold calculated on the basis
of a mathematical expectation and a variance of function of curvature. As a result of
this operation we shall receive a array of points of coordinates in which contour has the
maximal curvature, as shown numbered points on fig. 1.</p>
      <p>3.</p>
    </sec>
    <sec id="sec-3">
      <title>Process of Identification</title>
      <p>For realization of process of identification of object in accounting of invariance to
group of afine transformations it is necessary to consider some factors. Namely, at
presence of noise, change of scale of a contour, and also its turn it is available a variation
of values of extreme points as aside increases, and reduction. In the first case it means
occurrence of new points in a array, and in the second their cutting of. Thus, for
identification of the shape of real object, is complicated because of variations of quantity
of points of extreme in arrays of the sample and current object.</p>
      <p>
        The method has been developed for the decision of the problem identification shape
of object independently of its position on the image (shift), quantities of points of its
contour (scale) and a angle of its turn. The method is similar to metrics of geometrical
correlation [
        <xref ref-type="bibr" rid="ref27">27</xref>
        ] and consists in performance of following operations.
      </p>
      <p>
        First, we shall transform coordinates received on antecedent a step of a array of
extreme points from Cartesian in polar, using as the center of coordinates of polar
system the centre of gravity of object. However in diference from methods of geometrical
correlation [
        <xref ref-type="bibr" rid="ref27 ref28 ref29">27–29</xref>
        ], the present method is based only on use of a array of points of
extreme. Besides as preliminary operation of identification we normalize arrays of object
and the sample concerning their maximal value. Due to these operations, we receive
invariance to shift and scale object and the sample.
      </p>
      <p>Secondly for a statement of a method of identification, we formalize record of set of
points abscises the sample on which we shall make identification in next form.</p>
      <p>Definition 1. We shall write down set of points of extreme of function of the sample
 () as  = { = 0 &lt; 1 &lt; ... &lt;  = } where  – angles of turn of values of  () in
polar coordinates, and set of points of identified object as ℎ = { =  0 &lt;  1 &lt; ... &lt;
  = } for function of object ℎ( ). Let as the quantity of points of the sample will be
more than object, that is  &gt; , otherwise we interchange the position object with the
standard.</p>
      <p>For construction of the metrics of identification we shall add m points to set of the
sample in the following way:</p>
      <p>* = {0, 1, ..., , (+1 =  + 1 − 0), ..., (+ =  +  − 0)} .</p>
      <p>That is we shall add in the end of a array its initial fragment from m points.</p>
      <p>Definition 2. For some set of points  = { = 0 &lt; 1 &lt; ... &lt;  = } we shall
define its mirror set as  = { = 0 =  &gt; 1 = − 1 &gt; ... &gt;  = 0 = }.</p>
      <p>Definition 3. We shall write down two-dimensional function of a diference between
 () and ℎ() as  , =  (+ ) − ℎ( ),  = 0, ( − ),  = 0, ,  ∈ ℎ,  ∈  .</p>
      <p>Definition 4. We shall write down discrete function of an absolute error:
  =</p>
      <p>1
 + 1

=0
∑︁ | , | ,  = 0, ( − ).
  =</p>
      <p>1
 + 1

=0
∑︁ |  −  , | ,  = 0, ( − ).
 1 =
⎧
⎨1, ( 1 &lt; 1) ∨ ( 1 &lt; 1),
⎩0, ( 1 ≥ 1) ∧ ( 1 ≥ 1).</p>
      <p>And discrete function relative error:</p>
      <p>Definition 5. We shall write down function of recognition for identification of
curves at incomplete data on the basis of correlation on incomplete data #1 (CID1) as
(1)
Where  1 = min   the metrics of correlation on incomplete data #1 and  1 the

metrics of correlation on incomplete data #1, calculated on a mirror data set and 1 –
the classification’s tolerance. Equality  1 = 1 means successful classification object in
relation to the sample, thus value  corresponds to a corner of turn of object concerning
the sample.</p>
      <p>Definition 6. We shall write down function of recognition for identification of
curves at incomplete data on the basis of correlation on incomplete data #2 (CID2) as
 2 =
⎧
⎨1, ( 2 &lt; 2) ∨ ( 2 &lt; 2),
⎩0, ( 2 ≥ 2) ∧ ( 2 ≥ 2).</p>
      <p>Where  2 = min   the metrics of correlation on incomplete data #2 and  2

the metrics of correlation on incomplete data #2, calculated on a mirror data set and
2 – the classification’s tolerance. Equality  2 = 1 means successful classification of
object in relation to the sample, and value  corresponds to a corner of turn of object
concerning the sample.</p>
      <p>Let’s consider examples of identification of simple objects on the basis of the
introduced methods. So on fig. 3-4 the object of type “cross” and its deformed value is
represented. The metrics calculated under the formula (1) for these objects is equal
0.0796, and for object “cross” silhouette of plane on fig. 1 – is equal 0.24, that is three
times it is more. Statistical researches of values of metrics between objects various
shapes (sample-nonsample) and one shape, but subjected afine to transformations; difer
at the average three times. Establishing the classification’s tolerance in the middle of an
interval between mathematical expectations of metrics of type the sample-sample and
the sample-nonsample, we shall receive the best results of recognition.
4.</p>
    </sec>
    <sec id="sec-4">
      <title>Discussion</title>
      <p>Development represented methods of identification on the basis of metrics of
correlation on incomplete data pursues some the purposes.</p>
      <p>
        First, to present a simple method of identification of the shape of the objects,
possessing considerably smaller calculated efort, in comparison with the methods based
on geometrical correlation [
        <xref ref-type="bibr" rid="ref27 ref28 ref29">27–29</xref>
        ]. Here it is necessary to note, that the ofered methods
practically non dependent from complexity of the shape of identified objects as suppose
change of "precision of representation” of shape of object due to a choice of a level of
cutting of of extremum of function of curvature and by that accuracy of representation
of the shape of object.
      </p>
      <p>Secondly, in the name of the considered metrics the property supposing absent or
presence of additional extremum arising at function of curvature because of presence
of noise on the input image is incorporated. So, for example, for a figure “krestDm2”,
shown on fig. 5-6 and having on two extreme it is less, value of the metrics between the
given figure and object "cross" has increased approximately from 0.05 till, that makes
less than 1%.</p>
      <p>Calculation of the metrics between identical objects, but with is artificial the entered
distortions, for example as on fig. 5-6. At the left in figure object with two smoothed
corners and absent points of extreme, and on the right on the contrary with additional
corners. Values of the calculated metrics equally 0.05, that allows to compare the shape
of the deformed objects stable.</p>
      <p>Thirdly, carried out researches show, that the given metrics work not only at presence
afine transformations of identified objects, but also is much wider. So for example
objects, represented on fig. 3-4 only it is informally possible to ranking identical shape
of objects, so not exist groups of the transformations converting one these objects to
another. Nevertheless their human eye will identify as the same object.</p>
      <p>The presented methods can be applied in various areas of computer vision and a
robotics, medicine, geology and cartography.</p>
    </sec>
    <sec id="sec-5">
      <title>Acknowledgments</title>
      <p>The publication has been prepared with the support of the “RUDN University
Program 5-100” and funded by RFBR according to the research project No. 18-07-00567.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <given-names>F. Y.</given-names>
            <surname>Shih</surname>
          </string-name>
          ,
          <article-title>Image processing and pattern recognition: fundamentals and techniques</article-title>
          , Published by John Wiley &amp; Sons, New Jersey,
          <year>2010</year>
          (
          <year>2010</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <given-names>F.</given-names>
            <surname>Cao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.-L.</given-names>
            <surname>Lisani</surname>
          </string-name>
          ,
          <string-name>
            <surname>J.-M. Morel</surname>
            , P. Mus'e,
            <given-names>F.</given-names>
          </string-name>
          <string-name>
            <surname>Sur</surname>
          </string-name>
          ,
          <source>A Theory of Shape Identification</source>
          , Springer-Verlag, New York,
          <year>2008</year>
          (
          <year>2008</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <given-names>T. P.</given-names>
            <surname>Nguyen</surname>
          </string-name>
          ,
          <string-name>
            <surname>I.</surname>
          </string-name>
          <article-title>Debled-Rennesson, On the local properties of digital curves</article-title>
          ,
          <source>International Journal of Shape Modeling</source>
          <volume>14</volume>
          (
          <issue>2</issue>
          ) (
          <year>2008</year>
          )
          <fpage>105</fpage>
          -
          <lpage>125</lpage>
          (dec
          <year>2008</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <given-names>T. P.</given-names>
            <surname>Nguyen</surname>
          </string-name>
          ,
          <string-name>
            <surname>I.</surname>
          </string-name>
          <article-title>Debled-Rennesson, A discrete geometry approach for dominant point detection</article-title>
          ,
          <source>Pattern Recognition</source>
          <volume>44</volume>
          (
          <year>2011</year>
          )
          <fpage>32</fpage>
          -
          <lpage>44</lpage>
          (
          <year>2011</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5. I.
          <string-name>
            <surname>Debled-Rennesson</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          <string-name>
            <surname>Feschet</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Rouyer-Degli</surname>
          </string-name>
          ,
          <article-title>Optimal Blurred Segments Decomposition of Noisy Shapes in Linear Times</article-title>
          ,
          <source>Comp. &amp; Graphics</source>
          <volume>30</volume>
          (
          <year>2006</year>
          )
          <fpage>30</fpage>
          -
          <lpage>36</lpage>
          (
          <year>2006</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <given-names>P.</given-names>
            <surname>Bhowmick</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B. B.</given-names>
            <surname>Bhattacharya</surname>
          </string-name>
          ,
          <article-title>Fast Polygonal Approximation of Digital Curves Using Relaxed Straightness Properties</article-title>
          ,
          <source>IEEE Trans. on PAMI 29 (9)</source>
          (
          <year>2007</year>
          )
          <fpage>1590</fpage>
          -
          <lpage>1602</lpage>
          (
          <year>2007</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <given-names>I. E.</given-names>
            <surname>Sobel</surname>
          </string-name>
          ,
          <article-title>Neighborhood Coding of Binary Images for Fast Contour Following</article-title>
          and General Binary Array Processing,
          <source>Computer Graphics and Image Processing</source>
          <volume>8</volume>
          (
          <issue>8</issue>
          ) (
          <year>1978</year>
          )
          <fpage>127</fpage>
          -
          <lpage>135</lpage>
          (aug
          <year>1978</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <given-names>T.</given-names>
            <surname>Pavlidis</surname>
          </string-name>
          ,
          <article-title>Algorithms for Graphics and Image Processing</article-title>
          , Computer Science Press, Rockville, Maryland,
          <year>1982</year>
          (
          <year>1982</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>I. Anderson</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Bezdek</surname>
          </string-name>
          ,
          <article-title>Curvature and Tangential Deflection of Discrete Arcs: A Theory Based on the Commutator of Scatter Matrix Pairs and Its Application to Vertex Detec-tion in Planar Shape Data</article-title>
          ,
          <source>IEEE Trans. on PAMI PAMI-6</source>
          (
          <issue>1</issue>
          ) (
          <year>1984</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10. S. Hermann,
          <string-name>
            <given-names>R.</given-names>
            <surname>Klette</surname>
          </string-name>
          ,
          <article-title>A comparative study on 2d curvature estimators</article-title>
          ,
          <source>in: Proceeding International conference on computing: Theory and applications</source>
          ,
          <source>2007</source>
          (
          <year>2007</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <given-names>D.</given-names>
            <surname>Chetverikov</surname>
          </string-name>
          ,
          <article-title>A simple and eficient algorithm for detection of high curvature points in planar curves</article-title>
          ,
          <source>in: CAIP 03</source>
          ,
          <year>2003</year>
          , pp.
          <fpage>746</fpage>
          -
          <lpage>753</lpage>
          (
          <year>2003</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <given-names>B.</given-names>
            <surname>Kerautret</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.-O.</given-names>
            <surname>Lachaud</surname>
          </string-name>
          ,
          <article-title>Curvature Estimation along Noisy Digital Contours by Approximate Global Optimization</article-title>
          ,
          <source>Pattern Recognition</source>
          <volume>42</volume>
          (
          <issue>10</issue>
          ) (
          <year>2009</year>
          )
          <fpage>2265</fpage>
          -
          <lpage>2278</lpage>
          (
          <year>2009</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <given-names>R.</given-names>
            <surname>Deriche</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Faugeras</surname>
          </string-name>
          , 2-
          <string-name>
            <given-names>D</given-names>
            <surname>Curve Matching</surname>
          </string-name>
          <article-title>Using High Curvature Points: Applications to Stereo Vision</article-title>
          , in
          <source>: Proceedings of the 10th International Conference on Pattern Recognition</source>
          , IEEE Press, Vol.
          <volume>1</volume>
          ,
          <issue>1990</issue>
          , pp.
          <fpage>240</fpage>
          -
          <lpage>242</lpage>
          (
          <year>1990</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>M. Worring</surname>
            ,
            <given-names>A. W. M.</given-names>
          </string-name>
          <string-name>
            <surname>Smeulders</surname>
          </string-name>
          , Digital Curvature Estimation,
          <source>CVGIP: Image Understanding</source>
          <volume>58</volume>
          (
          <issue>3</issue>
          ) (
          <year>1993</year>
          )
          <fpage>366</fpage>
          -
          <lpage>382</lpage>
          (
          <year>1993</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Digital Curvature Estimation Worring</surname>
          </string-name>
          , Marcel.
          <source>CVGIP: Image Understanding</source>
          , Vol.
          <volume>58</volume>
          of 3, iSSN:
          <fpage>1077</fpage>
          -
          <lpage>3142</lpage>
          Online ISSN:
          <fpage>1557</fpage>
          -
          <lpage>7635</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16. V.
          <article-title>Kovalevsky, Curvature in digital 2D images</article-title>
          ,
          <source>International Journal of Pattern Recognition and Artificial Intelligence</source>
          <volume>15</volume>
          (
          <issue>7</issue>
          ) (
          <year>2001</year>
          )
          <fpage>1183</fpage>
          -
          <lpage>1200</lpage>
          (nov
          <year>2001</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <given-names>B.</given-names>
            <surname>Kerautret</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. O.</given-names>
            <surname>Lachaud</surname>
          </string-name>
          ,
          <article-title>Curvature estimation along noisy digital contours by approximate global optimization</article-title>
          ,
          <source>Pattern Recognit (42)</source>
          (
          <year>2009</year>
          )
          <fpage>2265</fpage>
          -
          <lpage>2278</lpage>
          (
          <year>2009</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <surname>C. Harris</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Stephens</surname>
          </string-name>
          ,
          <article-title>A combined corner and edge detector</article-title>
          ,
          <source>in: Proceedings of the Fourth Alvey Vision Conference</source>
          , Vol.
          <volume>15</volume>
          ,
          <year>1988</year>
          , pp.
          <fpage>147</fpage>
          -
          <lpage>151</lpage>
          (
          <year>1988</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19.
          <string-name>
            <surname>Xiao</surname>
          </string-name>
          , Chen He and Yung,
          <string-name>
            <surname>Nelson</surname>
            <given-names>H. C.</given-names>
          </string-name>
          ,
          <article-title>Corner detector based on global and local curvature properties</article-title>
          ,
          <source>Optical Engineering</source>
          <volume>47</volume>
          (
          <issue>5</issue>
          ),
          <year>2008</year>
          (
          <year>2008</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          20.
          <string-name>
            <given-names>F.</given-names>
            <surname>Feschet</surname>
          </string-name>
          , L. Tougne,
          <article-title>Optimal time computation of the tangent of a discrete curve: Ap-plication to the curvature</article-title>
          , in: Bertrand,
          <string-name>
            <given-names>G.</given-names>
            ,
            <surname>Couprie</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Perroton</surname>
          </string-name>
          ,
          <string-name>
            <surname>L. (eds.) DGCI</surname>
          </string-name>
          <year>1999</year>
          .
          <article-title>LNCS</article-title>
          , Vol.
          <volume>1568</volume>
          , Springer, Heidelberg,
          <year>1999</year>
          , pp.
          <fpage>31</fpage>
          -
          <lpage>40</lpage>
          (
          <year>1999</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          21.
          <string-name>
            <given-names>A.</given-names>
            <surname>Masood</surname>
          </string-name>
          ,
          <article-title>Dominant point detection by reverse polygonization of digital curves</article-title>
          ,
          <source>Image and Vision Computing</source>
          (
          <volume>26</volume>
          ) (
          <year>2008</year>
          )
          <fpage>702</fpage>
          -
          <lpage>715</lpage>
          (
          <year>2008</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          22.
          <string-name>
            <given-names>V.</given-names>
            <surname>Begishev</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Kovalchukov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Samuylov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Ometov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Moltchanov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Gaidamaka</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Andreev</surname>
          </string-name>
          ,
          <article-title>An analytical approach to SINR estimation in adjacent rectangular cells</article-title>
          ,
          <source>Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</source>
          <volume>9247</volume>
          (
          <year>2015</year>
          )
          <fpage>446</fpage>
          -
          <lpage>458</lpage>
          (
          <year>2015</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          23.
          <string-name>
            <given-names>A.</given-names>
            <surname>Samuylov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Moltchanov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Gaidamaka</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Andreev</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Koucheryavy</surname>
          </string-name>
          , Random Triangle:
          <article-title>A Baseline Model for Interference Analysis in Heterogeneous Networks</article-title>
          ,
          <source>IEEE Transactions on Vehicular Technology</source>
          <volume>65</volume>
          (
          <issue>8</issue>
          ) (
          <year>2016</year>
          )
          <fpage>6778</fpage>
          -
          <lpage>6782</lpage>
          (
          <year>2016</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          24.
          <string-name>
            <given-names>R.</given-names>
            <surname>Thakur</surname>
          </string-name>
          , Contour Following in Binary Images. URL http://www.mathworks.com/matlabcentral/fileexchange/ 23056-contour
          <article-title>-following-in-binary-images</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          25.
          <string-name>
            <given-names>Y.</given-names>
            <surname>Lin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Dou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <article-title>Contour shape description based on an arch height function</article-title>
          ,
          <source>Pattern Recognition</source>
          <volume>25</volume>
          (
          <year>1992</year>
          )
          <fpage>17</fpage>
          -
          <lpage>23</lpage>
          (
          <year>1992</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          26.
          <string-name>
            <surname>M. Majed</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          <string-name>
            <surname>Reinhard</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Pepe</surname>
          </string-name>
          ,
          <article-title>Corner Detection and Curve Partitioning Using Arc-Chord Distance, in: Combinatorial Image Analysis</article-title>
          , Vol.
          <volume>3322</volume>
          of Lecture Notes in Computer Science,
          <year>2004</year>
          , pp.
          <fpage>512</fpage>
          -
          <lpage>521</lpage>
          (
          <year>2004</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          27.
          <string-name>
            <surname>I. M. Gostev</surname>
          </string-name>
          ,
          <article-title>On the Identification of Unclosed Curves, Pattern Recognition and Image Analysis</article-title>
          .
          <source>(Advances in Mathematical Theory and Ap-plications) 23</source>
          (
          <issue>2</issue>
          ) (
          <year>2013</year>
          )
          <fpage>217</fpage>
          -
          <lpage>225</lpage>
          (
          <year>2013</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          28.
          <string-name>
            <surname>I. M. Gostev</surname>
          </string-name>
          ,
          <source>Recognition of graphic patterns: Part I, Journal of Computer and Systems Sciences International</source>
          <volume>43</volume>
          (
          <issue>1</issue>
          ) (
          <year>2004</year>
          )
          <fpage>129</fpage>
          -
          <lpage>135</lpage>
          (
          <year>2004</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref29">
        <mixed-citation>
          29.
          <string-name>
            <surname>I. M. Gostev</surname>
          </string-name>
          ,
          <article-title>Contour Fragment-Based Identification of Graphical Objects</article-title>
          ,
          <source>Journal of Computer and Systems Sciences International</source>
          <volume>44</volume>
          (
          <issue>1</issue>
          ) (
          <year>2005</year>
          )
          <fpage>135</fpage>
          -
          <lpage>142</lpage>
          (
          <year>2005</year>
          ).
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>