<!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>Recognition of Flat Objects Based on Dimensionless Marks Based of Their Contours</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Sultan Sadykov</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Yaroslav Kulkov</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>The Murom institute of Vladimir state university</institution>
          ,
          <addr-line>Orlovskaya st., 23, Murom</addr-line>
          ,
          <country country="RU">Russia</country>
        </aff>
      </contrib-group>
      <fpage>68</fpage>
      <lpage>73</lpage>
      <abstract>
        <p>The aim is an experimental research on the flat objects recognition using dimensionless marks of the contours of their binary images and determining the possibility of applying this method in computer vision systems. The basis for the formation of attribute vectors is the characteristics of the image contour. For carrying out a research images of flat objects and details were used. The description of process of generation of test selection for each object is provided. At first the image of each initial object rotates by 360 degrees with a step to 1 degree. Further with use of the received "turned" images options of imposing of one object on another in sight of the camera of system of technical sight on 2000 images for each class are created (i.e. for paired combinations of objects). For each image containing two objects a set of primary parameters created on their contours is calculated. The received parameters are used for calculation of dimensionless marks and forming of a vector of marks from them. Recognition of a class of an unknown object consists in receipt of its contour, calculation of primary parameters and forming of a vector of dimensionless marks. Further mean square deviations of its vector of dimensionless marks from all reference are calculated. The minimum value of a deviation will specify probable belonging to the corresponding class.</p>
      </abstract>
      <kwd-group>
        <kwd>Image recognition</kwd>
        <kwd>vision system</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        One of the ways of increasing the efficiency of production is to automate the process.
This is connected with the use of robotic centers. Currently, these are the automatic
systems of sorting, quality control, and packaging components [
        <xref ref-type="bibr" rid="ref1 ref2 ref3 ref4 ref5">1–5</xref>
        ].
      </p>
      <p>
        Objects recognition assumes an object asmarkment to one of their predefined
types. An operation of sorting components in the development of information
processing algorithms in computer vision systems can be stated as the problem of
image recognition, perceived by the video camera of a system. For this purpose, the
received images are processed and analyzed [
        <xref ref-type="bibr" rid="ref5 ref6">5,6</xref>
        ].
      </p>
      <p>
        Detection and identification of objects is an integral part of human activity. An
object is defined not only as a digital representation of a fragment of the local
twodimensional scene, but its approximate description, as a set of specific properties or
marks. The main purpose of their description - is their use in the process of
establishing of object capability, carried out by comparison. The objective is to identify the
recognition of any object to a particular class by analyzing the vector of values of
calculated marks. The information about the relationship between the values of the
object marks and its belonging to a certain class a recognition algorithm has to learn
from the training set of objects for which the marks of attributes and classes are
known [
        <xref ref-type="bibr" rid="ref5 ref6">5,6</xref>
        ].
2
      </p>
    </sec>
    <sec id="sec-2">
      <title>Methodology</title>
      <p>
        For the study proposed in [
        <xref ref-type="bibr" rid="ref7 ref8">7,8</xref>
        ] algorithm a set of binary images of separate real flat
objects was chosen. It is shown in Fig. 1.
      </p>
      <p>The experiment was conducted on a presentable display access of each of the 10
real flat objects (RFO). To do this, initially generating of a set of rotated images is
performed. For each of the images centroids of objects are calculated and an array of
rotated images of each of the 10 RFO in a step of 1 degree is formed. On the whole,
we get 3600 images.</p>
      <p>Then we make simulation of accidental occurrence of an object in the field of
recognition pattern.</p>
      <p>With the help of random number generators (RNG) with a normal distribution 10
sets of 2,000 images are formed from 360 rotated images of each of the 10 RFO.</p>
      <p>With the second RNG we get a number in the range of 0.364 to 0.720. This
limitation is necessary to minimize the layout of images out of the operating field. 4000
numbers are generated for 2000 implementations of each object. We will assume the
first number RNG the coordinate of the center of gravity on the axis X Xn of an
object, the second number - Yn. Thus, the coordinates of the center of gravity of each of
2000 of the implementations of each of the 10 RFO can be defined. According to
these coordinates 2000 of the implementations of each of the 10 RFO are placed on
the display space.</p>
      <p>Then we calculate the number of dots in each of 2000 of the implementation of
each of the 10 TFO, that is calculate the area of object S0 and perimeter P0.</p>
      <p>
        For each of the obtained object implementation single-point contours are formed
according to the algorithm in [
        <xref ref-type="bibr" rid="ref7 ref8">7,8</xref>
        ].
      </p>
      <p>For each of them the number of dots forming the contour of each of the 2000 of the
implementations of each of the 10 RFO is calculated. Next we define the metric
length of the contour of each of the 2000 of the implementations of each of the 10
RFO.</p>
      <p>For each implementation the value of the curvature at the points of each contour of
the 2000 of the implementations of each of the 10 RFO is determined. According to
the obtained points the reference point of convex and concave sections of the contour
are determined. We determine the number of reference points of convex, concave and
linear plots of contours.</p>
      <p>With formulas (1), (2) and (3) we calculate the total length of the convex, concave
and basic blocks of the entire contour of each object:</p>
      <p>Ltot.conv. = 1/2 [М1 2 b + М3 (а + b)]
Ltot.conc. = 1/2 [М2 2 b + М4 (а + b)]</p>
      <p>Ltot.lin. =1/2 (К 2 а + T 2 b)
where:
a - distance between 4th connected points;
b - distance between D’s connected points;
М1 - the number of contour points with a value of 90;
М2 - the number of contour points with a value of -90;
М3 - the number of contour points with a value of 135;
M4 - the number of contour points with a value of -135;
К - the number of 4 connected contour points;
Т - the number of D connected points of the contour.</p>
      <p>Using calculated parameters, calculates the vectors of dimensionless marks of the
2000 of the implementations of each of the 10 RFO with formulas (4) - (19).
К1 = P0 / S0
К2 = М1 / S0
К3 = М2 / S0
К4 = М3 / S0
К5 = М4 / S0
К6 = К / S0
К7 = Т / S0
К8 = М1 / P0
(1)
(2)
(3)
(4)
(5)
(6)
(7)
(8)
(9)
(10)
(11)
К9 = М2 / P0
К10 = М3 / P0
К11 = М4 / P0
К12 = К / P0
К13 = Т / P0
К14 = L tot.lin. / Lcont
К15 = L tot.conc. / Lcont
К16 = L tot.conv./ Lcont
(12)
(13)
(14)
(15)
(16)
(17)
(18)
(19)</p>
      <p>The example of final marks for the 2000 of the implementations of the 1st RFO is
in Table 1.
After receiving vector marks for all generated realizations the standards for
recognizing each of the 2000 implementations of each of the 10 RFO is carried out in the
dialog mode. In the histogram obtained while generating we choose a vector mark of
the most frequently used options from 360 rotated variants, for example, the 1st RFO,
while the formation of 2000 implementations. For this vector of coefficients of the
standard deviation (20) we calculate Zi from 2000 implementations.</p>
      <p>Zi </p>
      <p>1 n (K j  K jl )2
n  1 j 1
where:
n - number of mars;
l – number of recognizable object (l = 1,2, ..., 2000);
Kj - the value of the j- feature vector of coefficients K of the selected standard;
Kjl - the value of the j-feature vector of coefficients K of the selected
implementation.</p>
      <p>2000 implementaions are calculated Zi. Among them are Zmin sought</p>
      <p>Zmin = min{ Zi }</p>
      <p>Found values Zmin indicate the number of implementations among 2000 images
which vector marks coincide with the vector-mark selected as a reference
implementation. Obviously, with one standard it is impossible to recognize all 2000
implementations of the 1st RFO.</p>
      <p>Secondly, based on the histogram we select as a standard the reference vector of
the next most frequently used options from 360 rotated, for example, the 1st RFO,
while formation of 2000 implementations. We calculate 2000 standard deviation Zi.
Among them Zmin are searched by the formula (21).</p>
      <p>Found values Zmin indicate the numbers of implementations among 2000 images
which vector marks coincide with the vector mark of a standard implementation, etc.
Selecting of standards for the realization of the 1st RFO continues till until all 2000
implementations are recognized.</p>
      <p>Similarly, the choice of standards is carried out for all implementations of all other
9 RFO. The results of standard selection for 2000 implementations of each of the 10
RFO are shown in Table 2.
Thus, this training of the recognition system is completed.</p>
      <p>To check the operation of the system of recognition, an examination of 20000
trained implementations of all 10 RFO on the basis of formulas (20) and (21) is
carried out. The exam consists of comparing the vector marks of all 20000
implementations of all 10 RFO with the selected standards.</p>
      <p>A random object is selected. It features all the above procedures of producing
dimensionless marks of contours. The resultant vector of the unknown RFO is
compared to all standard vectors in Table 2. The type of RFO is determined according to
min {Zmin}.
(20)
(21)</p>
      <p>The exam procedure is repeated for the 2nd unknown object, and so on for all of
20000 realizations of all 10 RFO.
4</p>
    </sec>
    <sec id="sec-3">
      <title>Conclusion</title>
      <p>Object 5 has a simple symmetrical contour. Its rotated images do not differ
substantially among themselves. Therefore, it took only 8 standards for the detection of the
object. The object 10 has a complex shape. This led to the need to use 45 standards
for the full recognition of all implementations of the object. On average, it takes about
28 standards.</p>
      <p>During the research the experimental studies have been conducted on the
recognition of individual testing of flat objects on the basis of non-dimensional marks of their
contours. Experiments were carried out on the basis of presentable selection in 2000
images for selected 10 objects.</p>
      <p>The results showed high efficiency of the proposed non-dimensional marks. The
amount of standards required for the recognition depends on the complexity and
symmetry of the contour of the object. With this set of etalons vectors of coefficients
the detection of unknown objects was 100%.</p>
      <p>Recognition time indicators are obtained for algorithms for test selection circuit
and for determination of the coefficients. The method of guided search was used as an
algorithm for contour detection. This method and algorithm of marking reference
points are the most time-consuming in this system and they can be optimized for use
in a real system in order to reduce the recognition time.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Azhmuhamedov</surname>
            <given-names>I. M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vybornova</surname>
            <given-names>O. N.</given-names>
          </string-name>
          <article-title>Introduction of metric characteristics for the solution of a problem of assessment and risk management</article-title>
          .
          <source>Caspian magazine: management and high technologies 4</source>
          ,
          <fpage>10</fpage>
          -
          <lpage>22</lpage>
          (
          <year>2015</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <given-names>Brumshteyn</given-names>
            <surname>Ju.M.</surname>
          </string-name>
          <article-title>About some models of management of the interconnected risks. News of VOLGGTU, "Urgent Problems of Management, Computer Facilities</article-title>
          and Informatics in
          <source>Technical Systems" series 13</source>
          (
          <issue>177</issue>
          ),
          <fpage>95</fpage>
          -
          <lpage>100</lpage>
          (
          <year>2015</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <given-names>Brumshteyn</given-names>
            <surname>Ju</surname>
          </string-name>
          .M.,
          <string-name>
            <surname>Il'menskij</surname>
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kolesnikov</surname>
            <given-names>I.</given-names>
          </string-name>
          <article-title>Robotechnical systems: questions of development. Intellectual property</article-title>
          .
          <source>Author's right and neighboring rights 4</source>
          ,
          <fpage>49</fpage>
          -
          <lpage>64</lpage>
          (
          <year>2016</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Zhumabaeva</surname>
            <given-names>A.S.</given-names>
          </string-name>
          <article-title>Development of intellectual level of management of a robototekhnicheky complex</article-title>
          .
          <source>Works of the international symposium Reliability and quality</source>
          ,
          <volume>219</volume>
          -
          <fpage>222</fpage>
          (
          <year>2015</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Klevalin</surname>
            <given-names>V.A.</given-names>
          </string-name>
          <article-title>Digital methods of recognition in systems of technical sight of industrial robots</article-title>
          . Mechatronics, automation, management
          <volume>5</volume>
          ,
          <fpage>56</fpage>
          -
          <lpage>58</lpage>
          (
          <year>2008</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Panov</surname>
            <given-names>S.S.</given-names>
          </string-name>
          <article-title>Robotic assembly stands with technical sight and computer control systems</article-title>
          . Assembly in mechanical engineering,
          <source>instrument making 12</source>
          ,
          <fpage>23</fpage>
          -
          <lpage>28</lpage>
          (
          <year>2010</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Sadykov</surname>
            <given-names>S.S.</given-names>
          </string-name>
          <article-title>Formation of the dimensionless coefficients form a closed loop digital</article-title>
          .
          <source>Algorithms, methods and computing</source>
          <volume>4</volume>
          (
          <issue>29</issue>
          ),
          <fpage>91</fpage>
          -
          <lpage>98</lpage>
          (
          <year>2014</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Sadykov</surname>
            <given-names>S.S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kulkov</surname>
            <given-names>Y.</given-names>
          </string-name>
          <string-name>
            <surname>Yu</surname>
          </string-name>
          .
          <article-title>Recognition of Separate Flat Objects Based on Dimensionless Marks of Their Contours by Linear Discriminant Analysis</article-title>
          .
          <source>Procedia Computer Science</source>
          <volume>103</volume>
          ,
          <fpage>248</fpage>
          -
          <lpage>252</lpage>
          (
          <year>2017</year>
          ).
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>