<!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>Surface recognition of machine parts based on the results of optical scanning</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>M A Bolotov</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>V А Pechenin</string-name>
          <email>vadim.pechenin2011@yandex.ru</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>N V Ruzanov</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>E J Kolchina</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Samara National Research University, Institute of Engines and Power Plants</institution>
          ,
          <addr-line>Moskovskoe Shosse, 34А, Samara, Russia, 443086</addr-line>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Stock company «RKC «Progress»</institution>
          ,
          <addr-line>Zemeca street, 18, Samara, Russia, 443009</addr-line>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2018</year>
      </pub-date>
      <fpage>342</fpage>
      <lpage>349</lpage>
      <abstract>
        <p>To predict the quality parameters of products (in particular, the assembly parameters) mathematical models were implemented in the form of computer models. To ensure the adequacy of calculations, it is necessary to have information about the actual geometry of the parts, which can be obtained using noncontact measurements of parts of the assembly. As a result of measuring parts and components using optical or laser scanner, a large dimension array of measured points is formed. After standard processing (e.g. noise removal, combining the scans, smoothing, creating triangulation mesh), the recognition of individual surfaces of parts becomes necessary. This paper presents a neural network model that allows the recognition of elements based on an array of measured points obtained by scanning.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>The least automated step in the industry is the assembly of single and serial products characterized by
medium and high complexity. These products include aircraft engines. The considered products are
not made in large quantities as cars; they are characterized by a high degree of optionality and
increased requirements for complexity and accuracy. The share of labour-consuming assembly in the
total labour-intensiveness of products is up to 25% and largely determines their quality. There are
several reasons that make it difficult to fully automate the assembly of these products. One of the
significant reasons is the difficulty of determining the parameters of the operations performed by
robots, which are guaranteed to ensure the specified accuracy and quality of products. The assembly of
medium and high complexity products is a unique operation, during which the course of operations is
changed according to the results of measurements and the geometric analysis of the assembled parts.
Measurement of geometry is made by both contactless and contact methods.</p>
      <p>
        To partially automate engine assembly processes, it is necessary to recognize both the individual
parts and the surfaces of the parts along which the assembly will take place. Face recognition is
possible using computer vision approaches [
        <xref ref-type="bibr" rid="ref1 ref2 ref3">1,2,3</xref>
        ]. The aim of this work is to create a model based on
the use of neural networks, designed to recognize the surfaces of engineering parts after their
measurement using an optical or laser scanner.
      </p>
    </sec>
    <sec id="sec-2">
      <title>2. Object of research</title>
      <p>To test the model, a real engine parts simulator was designed and manufactured: spacers in the turbine
of an aircraft engine. A detail drawing is shown in Figure 1. The part contains cylindrical and flat
edges, as well as threaded holes.</p>
      <p>Automated element (surface) recognition of measured parts using neural networks solves two tasks:
1) segmentation of a part’s components into types of surfaces (plane, cylinder, cone, etc.) 2) additional
refinement of the boundaries of triangulation surfaces based on deviations of the facet normal vectors.
To solve the first problem, a convolutional neural network was used.</p>
    </sec>
    <sec id="sec-3">
      <title>3. Neural network model of surface recognition</title>
      <p>
        Convolutional neural networks (CNN) are a very wide class of architectures which main idea is to
reuse parts of the neural network to work with different small, local input areas [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. The main area of
application of convolutional architectures is image processing [
        <xref ref-type="bibr" rid="ref5 ref6">5, 6</xref>
        ].
      </p>
      <p>
        At present, many approaches have been developed for recognizing three-dimensional objects in
works devoted to computer vision. These approaches can be divided into two groups: recognition of
elements, directly working on their own three-dimensional representations of objects, such as
polygonal grids, voxel representations and arrays of points, and approaches based on signs and metrics
that describe the shape of a three-dimensional object, "what it looks like" in the collection 2D
projections [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ].
      </p>
      <p>
        Except for the recent work by Wu et al. [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ], who studied form descriptions from a voxel-based
object representation through three-dimensional convolutional networks, the previous
threedimensional shape descriptions were mostly “manually developed” according to a specific geometric
property of the shape surface or volume. For example, shapes can be represented by histograms or
models with total signs of surfaces consisting of normals and curvatures [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ], distances, angles, areas of
triangles or volumes of tetrahedra calculated for sample points of surfaces [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ], properties of spherical
functions defined in volumetric grids [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ], local shape diameters measured on tightly selected surface
points [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ], and thermal core signatures on polygonal grids [
        <xref ref-type="bibr" rid="ref13 ref14">13, 14</xref>
        ]. The development of controlled
machine learning algorithms on top of such descriptions of three-dimensional figures creates several
problems. First, the size of organized databases with annotated 3D models is rather limited compared
to image data sets. For example, ModelNet contains about 150 thousand objects. In contrast, the
ImageNet database [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ] already includes tens of millions of annotated images. Secondly, the
additional features and metrics of three-dimensional figures tend to be very multidimensional, which
makes the algorithms prone to retraining.
      </p>
      <p>
        One of the latest works on the problems of object classification and the segmentation of individual
parts, in which an array of measured points is used directly at the entrance to the network, is [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ].
Developed by authors from Stanford University, the network is named PointNet, the main idea of the
approach is to memorize the spatial features of each point and then merge all the individual features
into a marked general point cloud. The network is based on a convolutional architecture. The main
disadvantage of the reduced network is that at the input it is necessary to always have the same
number of points for all objects, which in practice is not possible and you will have to resort to an
artificial “distortion” of the data.
      </p>
      <p>
        Based on the literature review and the specifics of the problem being solved, the decision was made
to use an approach based on the use of 2D projections of objects in solving the current problem. In this
approach, a convolutional neural network, U-net [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ], is used for segmentation.
      </p>
      <p>We will reveal the main idea and stages of the developed model for the segmentation of individual
faces. The main idea is to create projections (pictures) for the faceted model of measured data,
segmentation of faces on projections and identification of facets by segmented images. The stages of
the approach are shown in Figure 2.</p>
      <p>1. Loading measured points and creating a triangulation grid—</p>
      <p>loading stl file</p>
      <sec id="sec-3-1">
        <title>2. Formation of file projections</title>
      </sec>
      <sec id="sec-3-2">
        <title>3. Saving projection images</title>
      </sec>
      <sec id="sec-3-3">
        <title>4. Image segmentation using a neural network</title>
      </sec>
      <sec id="sec-3-4">
        <title>5. Identification of image pixels with facets in projection</title>
      </sec>
      <sec id="sec-3-5">
        <title>6. Recreation of the complete model, additional refinement of the surface boundaries in the direction of the normal vectors Figure 2. A flowchart of the face recognition model using projections of measured data. Consider the face recognition steps in more detail.</title>
        <sec id="sec-3-5-1">
          <title>3.1. Loading measured points and creating a triangulation grid—loading stl file</title>
          <p>As noted in the introduction, the model is designed to recognize geometry after measurement using
optical and laser scanners. After measurement using the scanner and preliminary data processing, a file
is created with the coordinates of points united into a facet surface of the *.stl format. The file contains
the following data: Vg×3 (matrix of coordinates of the vertices of the grid stl-model), Fm×3 (matrix of
combinations of three vertices forming the facets of the surfaces), Nm×3 (matrix of coordinates of facet
normals).</p>
        </sec>
        <sec id="sec-3-5-2">
          <title>3.2. Formation of file projections</title>
          <p>
            To enable semantic segmentation of the facets into separate surfaces using deep neural networks, it is
necessary to create projections of 3D surfaces on coordinate planes. To prepare the projections,
Roberts’ algorithm was used [
            <xref ref-type="bibr" rid="ref18">18</xref>
            ].
          </p>
          <p>Roberts’ algorithm is the first known solution to the problem of removing invisible lines. This is a
mathematically elegant method that works in object space. The algorithm primarily removes from
each body the edge or edges that are screened by the body itself. Then each of the visible edges of
each body is compared with each of the remaining bodies to determine which part or parts, if any, are
shielded by these bodies. Therefore, the computational complexity of Roberts’ algorithm grows,
theoretically, with the square of the number of objects.</p>
          <p>The operation of Roberts’ algorithm takes place in two stages:
1. Definition of non-face faces for each body separately.
2. Identify and remove invisible edges.</p>
          <p>To prepare the data, only the first stage of the algorithm was used. The second stage is not
necessary for further decision; it is more complex and requires additional facets.</p>
          <p>When creating projections on coordinate axes, orthogonal projections in the visual plane are
obtained. For example, when projected on the XOY plane, the structure Fm×3 is preserved, and the
matrix of the vertices Vg×3 is converted into Vg×2, having only coordinates along the x- and y-axes.
Bypassing the vertices of the obtained projections of the facets in the same sequence as in the original,
you can divide them into two types: those that are oriented counter-clockwise, which means that we
are looking at the facet from the outside of the body and those that are oriented clockwise, which
means that we are looking at the facet from the inside. The order of the vertices determines the
direction of the normal. Thus, if the component of the normal vector of the projection plane (in this
example, the component along the z-axis) is negative, we look at the facet from the inside. Since the
object is bounded by a closed surface, we cannot observe the faces from the inside—they are invisible.
Thus, it is necessary to exclude the facets identified by the above method from the Fm×3 structure,
obtaining the projection structure Fm1×3, where m1&lt;m.</p>
        </sec>
        <sec id="sec-3-5-3">
          <title>3.3. Saving projection images</title>
          <p>Image saving is performed using STL work libraries (functions of the stltools package by Pau Micó)
and MATLAB graphics saving tools. The sizes of the pictures are saved, as are all projections. Using
the same tools, training projection images are saved, where objects for recognition are highlighted in
different colours (Figures 3 and 4).
(1)</p>
          <p>Nevertheless, segmentation requires clear boundaries, so images stored in the *.png format are
imported into MATLAB (variable loading matrix RGB-colour) and converted to grayscale using the
expression:</p>
          <p>I gray =0, 299 ⋅ R + 0, 587 ⋅ G + 0,114 ⋅ B ,
where I gray is the grayscale image matrix and R, G, B are the matrix components of the RGB system.
Multidimensional matrixes of images are saved to a *.mat file. A total of six projections remain. The
object is placed as if in a cube whose faces are parallel to the planes of the coordinates. The
dimensions of the cube are such that it includes all the measured objects in the sample. Projections are
accordingly made on the faces of the cube: two on the faces parallel to the XOY plane; two parallel to
XOZ and two parallel to YOZ.</p>
        </sec>
        <sec id="sec-3-5-4">
          <title>3.4. Image segmentation using a neural network</title>
          <p>The U-Net network architecture is shown in Figure 5.</p>
          <p>The network architecture is a sequence of layers of convolution and pooling, which first reduce the
spatial resolution of the image, and then increase it by first merging it with the image data and passing
it through other layers of the convolution. Thus, the network serves as a kind of filter.</p>
          <p>The first half of the network contains layers of convolution with the activation function ReLu,
normalization by mini-batch and layers of pooling (sub-sampling) and it is called a compressing path.
The second part is an expanding path.</p>
          <p>The upsampling layer is a reverse pooling layer that expands the feature map, followed by a
convolution, which reduces the number of feature channels. Then comes the concatenation (“pasting”
of linear objects) with an appropriately cut map of features from the compressive path and two
convolutional layers.</p>
          <p>On the last layer, convolution with a 1x1 core is used to bring each 64-component feature vector to
the required number of classes. The activation function on the last layer is “softmax”.</p>
          <p>The network was reproduced in the Python software environment.</p>
        </sec>
        <sec id="sec-3-5-5">
          <title>3.5. Identification of image pixels with facets in projection</title>
          <p>After the image is segmented, its pixels are compared to the coordinates of the corresponding
projection. For matching, pixels are converted to points on the corresponding face of the cube
described in Section 3.3. The values of the image pixels lie in the interval from 0 to 255. Accordingly,
in order to identify the pixels responsible for a certain edge, values of a certain intensity are searched
for in the image matrix. In this case, the search is made with a certain tolerance. The position of the
found pixels in the matrix (row-column) is translated, taking into account the scale, into space
coordinates (two coordinates from the image, the third—the coordinate of the corresponding cube
face). In addition, in Section 3.2, the faces closed by others were not deleted. Therefore, when
matching, a point of an object in an image can fall on two or more projection facets. In this case, the
facet that is closest to the viewpoint is selected.</p>
        </sec>
        <sec id="sec-3-5-6">
          <title>3.6. Recreation of the complete model, additional refinement of the surface boundaries in the direction of the normal vectors</title>
          <p>
            The previous steps were necessary for preliminary automated recognition of only a fraction of the
measured points. After identifying the vertices and facets to different surfaces, they are compared with
the full set of vertices (search by equality of point coordinates). Points close to the geometric centre of
the surface are selected. On the top in the geometric centre, a facet is selected that belongs to a specific
face of the body. At the next stage, the algorithm for searching and refining facets of one face is used.
We briefly describe the steps of the algorithm for searching for facets belonging to a specific face
[
            <xref ref-type="bibr" rid="ref19">19</xref>
            ]: 
1) input parameters are set: Vg×3, Fm×3, Nm×3, p (coordinate vector of a point on the surface whose

facets are to be selected), t ( normal at point p ), and α (angle tolerance to find matching facets).
2) search for the facet that owns point p (intersection point of the beam and the facets).

3) search for all facets for which the normal vector is different from the normal vector t by no
more than a value α (the scalar product of normal vectors is used to check the angles).
          </p>
          <p>Facets are selected, from all the facets found that are suitable in the direction of the normal, that are
associated with the first and among themselves common vertices.</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>4. Recognition results</title>
      <p>To measure the details an optical 3D scanner RANGEVISION Pro2M was used. Figures 6 and 7 show
photographs of the process of measuring the “spacer simulator” part (drawing in Figure 1).
(2)</p>
      <p>
        To assess the quality of segmentation, you can use the modified loss function given in [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ]. It is
proposed to calculate the error in determining the parameters of a rectangle when recognizing faces
and images in a picture using the intersection over union (IoU) metric, which is equal to the ratio of
the area of intersection of the rectangle obtained as a result of detection and the rectangle from the
mark-up to the area of their union.
      </p>
      <p>In our case, we work with body facets, so instead of squares, we can operate on the number of
facets. Therefore, a coefficient δ segm is calculated that is equal to the ratio of the number of facets
N р∩д that are the intersection of the set of facets of the surface, obtained as a result of recognition, and
actually belong to the surface of the facet to the N р∪д set of facets, which is their union:
δ segm = N р∩д / N р∪д .</p>
      <p>Thus, the value of the coefficient lies in the interval [0; 1]. If there are several recognizable
surfaces, then a generalized coefficient can be calculated δ segm for all recognizable body faces.</p>
      <p>The number of measured facets of the part m was 622130. For training the neural network, a
sample of 1000 cases of the stl-model of the considered part, aligned in different ways in space,
corresponding to a total of 6000 projections, was formed. For formation of the training set, a nominal
model of the part was used, which was saved in the *.stl format.</p>
      <p>Recognized flat and cylindrical faces of the “spacer simulator” detail measured with the scanner
using all six projections are shown in Figures 8 and 9.</p>
      <p>Table 1 shows the calculated coefficients δ segm of the measured cylindrical, flat and combined
recognizable faces.</p>
      <sec id="sec-4-1">
        <title>Object of evaluation</title>
        <p>The recognition error of cylindrical faces is higher than flat ones. Although all cylindrical faces
were identified, there were facets belonging to flat faces, as well as some facets from the threaded
holes. The overall ratio exceeded 90%, which is associated with a much larger number of facets of flat
faces compared to cylindrical.</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>5. Conclusion</title>
      <p>
        The model presented in this paper allows you to quickly recognize cylindrical and flat surfaces of parts
using a trained neural network and face facet search algorithm from previously recognized facets. The
developed model is needed for further prediction of the assembly parameters of the product based on
computer modelling [
        <xref ref-type="bibr" rid="ref21">21</xref>
        ]. Using digital prediction will allow robotic assemblers to function without
human intervention.
      </p>
    </sec>
    <sec id="sec-6">
      <title>Acknowledgements</title>
      <p>The work was supported by the Ministry of Education and Science of the Russian Federation in the
framework of the program to improve the competitiveness of the Samara University among the world's
leading research and educational centers for 2013–2020 and partly by the Russian Federation
President's grants (project code СП-262.2019.5). Experimental studies were carried out on the
equipment of the center for the collective use of CAM technologies of the Samara University
(RFMEFI59314X0003).</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <surname>Zakani</surname>
            <given-names>F R</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bouksim</surname>
            <given-names>M</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Arhid</surname>
            <given-names>K</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Aboulfatah</surname>
            <given-names>M</given-names>
          </string-name>
          and
          <string-name>
            <surname>Gadi</surname>
            <given-names>T 2018</given-names>
          </string-name>
          <article-title>Segmentation of 3D meshes combining the artificial neural network classifier and the spectral clustering</article-title>
          <source>Computer Optics</source>
          <volume>42</volume>
          (
          <issue>2</issue>
          )
          <fpage>312</fpage>
          -
          <lpage>319</lpage>
          DOI: 10.18287/
          <fpage>2412</fpage>
          -6179-2018-42-2-
          <fpage>312</fpage>
          -319
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <surname>Blokhino</surname>
            <given-names>Y B</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gorbachev</surname>
            <given-names>V A</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rakutin</surname>
            <given-names>Y O</given-names>
          </string-name>
          <string-name>
            <surname>and Nikitin A D 2018</surname>
          </string-name>
          <article-title>Development of an algorithm for semantic segmentation of real-time aerial photographs</article-title>
          <source>Computer Optics</source>
          <volume>42</volume>
          (
          <issue>1</issue>
          )
          <fpage>141</fpage>
          -
          <lpage>148</lpage>
          DOI: 10.18287/
          <fpage>2412</fpage>
          -6179-2018-42-1-
          <fpage>141</fpage>
          -148
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <surname>Nikitin</surname>
            <given-names>M U</given-names>
          </string-name>
          ,
          <article-title>Konushin V S and Konushin A S 2017 Neural network model for video-based face recognition with frames quality assessment</article-title>
          <source>Computer Optics</source>
          <volume>41</volume>
          (
          <issue>5</issue>
          )
          <fpage>732</fpage>
          -
          <lpage>742</lpage>
          DOI: 10.18287/
          <fpage>2412</fpage>
          -6179-2017-41-5-
          <fpage>732</fpage>
          -742
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <surname>Nikolenko</surname>
            <given-names>S I</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kadurin</surname>
            <given-names>A</given-names>
          </string-name>
          and
          <string-name>
            <surname>Arkhangelskaya</surname>
            <given-names>E 2018</given-names>
          </string-name>
          <article-title>Deep learning</article-title>
          (SPb: Peter)
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <surname>Hubei</surname>
            <given-names>D H</given-names>
          </string-name>
          <year>1988</year>
          Eye, Brain, and
          <string-name>
            <surname>Vision</surname>
          </string-name>
          (New York: Scientific American)
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          <article-title>[6] Webvision: The Organization of the Retina and Visual System URL: http:// webvision</article-title>
          .med.utah.edu/book/
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <surname>Su</surname>
            <given-names>H</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Maji</surname>
            <given-names>S</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kalogerakis</surname>
            <given-names>E</given-names>
          </string-name>
          and
          <string-name>
            <surname>Learned-Miller</surname>
            <given-names>E</given-names>
          </string-name>
          2015 Multi-view
          <source>Convolutional Neural Networks for 3D Shape Recognition ICCV</source>
          <volume>7410471</volume>
          <fpage>945</fpage>
          -
          <lpage>953</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <surname>Wu</surname>
            <given-names>Z</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Song</surname>
            <given-names>S</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Khosla</surname>
            <given-names>A</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yu</surname>
            <given-names>F</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zhang</surname>
            <given-names>L</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tang</surname>
            <given-names>X</given-names>
          </string-name>
          and
          <string-name>
            <surname>Xiao J 2015 3D</surname>
          </string-name>
          <article-title>ShapeNets: A deep representation for volumetric shape modeling</article-title>
          <source>In Proc. CVPR 1-9</source>
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <surname>Horn B K P 1984 Extended</surname>
            <given-names>gaussian</given-names>
          </string-name>
          <source>images Proc. of the IEEE</source>
          <volume>72</volume>
          (
          <issue>12</issue>
          )
          <fpage>1671</fpage>
          -
          <lpage>1686</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <surname>Osada</surname>
            <given-names>R</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Funkhouser</surname>
            <given-names>T</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chazelle</surname>
            <given-names>B</given-names>
          </string-name>
          and
          <string-name>
            <surname>Dobkin</surname>
            <given-names>D</given-names>
          </string-name>
          <source>2002 Shape distributions ACM Transactions on Graphics</source>
          <volume>21</volume>
          (
          <issue>4</issue>
          )
          <fpage>807</fpage>
          -
          <lpage>832</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <surname>Kazhdan</surname>
            <given-names>M</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Funkhouser</surname>
            <given-names>T</given-names>
          </string-name>
          and
          <string-name>
            <surname>Rusinkiewicz</surname>
            <given-names>S 2003</given-names>
          </string-name>
          <article-title>Rotation invariant spherical harmonic representation of 3D shape descriptors</article-title>
          <source>Proceedings of the Eurographics/ACM SIGGRAPH symposium on Geometry processing 156-164</source>
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <surname>Chaudhuri</surname>
            <given-names>S</given-names>
          </string-name>
          and
          <string-name>
            <surname>Koltun</surname>
            <given-names>V</given-names>
          </string-name>
          2010
          <article-title>Data-driven suggestions for creativity support in 3D modeling</article-title>
          <source>ACM Transactions on Graphics</source>
          <volume>29</volume>
          (
          <issue>6</issue>
          )
          <fpage>183</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <surname>Bronstein</surname>
            <given-names>A</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bronstein</surname>
            <given-names>M</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ovsjanikov</surname>
            <given-names>M</given-names>
          </string-name>
          and
          <string-name>
            <surname>Guibas L 2011 Shape Google</surname>
          </string-name>
          <article-title>: Geometric words and expressions for invariant shape retrieval</article-title>
          <source>ACM Transactions on Graphics</source>
          <volume>30</volume>
          (
          <issue>1</issue>
          )
          <fpage>1</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <surname>Kokkinos</surname>
            <given-names>I</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bronstein</surname>
            <given-names>M</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Litman</surname>
            <given-names>R</given-names>
          </string-name>
          and
          <article-title>Bronstein A 2012 Intrinsic shape context descriptors for deformable shapes Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR)</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <surname>Deng</surname>
            <given-names>J</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dong</surname>
            <given-names>W</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Socher</surname>
            <given-names>R</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Li</surname>
            <given-names>L-J</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Li</surname>
            <given-names>K</given-names>
          </string-name>
          and
          <string-name>
            <surname>Fei-Fei L 2009 Imagenet:</surname>
          </string-name>
          <article-title>A large-scale hierarchical image database Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR)</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <surname>Qi</surname>
            <given-names>C R</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Su</surname>
            <given-names>H</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mo</surname>
            <given-names>K</given-names>
          </string-name>
          and
          <string-name>
            <surname>Guibas L J 2016 PointNet:</surname>
          </string-name>
          <article-title>Deep learning on point sets for 3d classification and segmentation ArXiv preprint</article-title>
          arXiv:
          <volume>1612</volume>
          .00593
          <fpage>652</fpage>
          -
          <lpage>660</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <surname>Ronneberger</surname>
            <given-names>O</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Fischer</surname>
            <given-names>P</given-names>
          </string-name>
          and
          <string-name>
            <surname>Brox</surname>
            <given-names>T 2015</given-names>
          </string-name>
          <article-title>U-net: Convolutional networks for biomedical image segmentation</article-title>
          <source>Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</source>
          9351
          <fpage>234</fpage>
          -
          <lpage>241</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <surname>Roberts</surname>
            <given-names>L G</given-names>
          </string-name>
          <year>1965</year>
          <article-title>Machine perception of three-dimensional solids Optical</article-title>
          and
          <string-name>
            <surname>Electro-Optical Information Processing</surname>
          </string-name>
          (Cambridge: MIT Press)
          <fpage>159</fpage>
          -
          <lpage>197</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <surname>Stepanenko</surname>
            <given-names>I S</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pechenin</surname>
            <given-names>V A</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ruzanov</surname>
            <given-names>N V</given-names>
          </string-name>
          and
          <article-title>Khaimovich A I 2018 Technique of increasing the accuracy of GTE parts manufactured by selective laser melting</article-title>
          <source>Journal of Physics: Conference Series</source>
          <volume>1096</volume>
          (
          <issue>1</issue>
          ) 012143 DOI: 10.1088/
          <fpage>1742</fpage>
          -6596/1096/1/012143
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <surname>Yu</surname>
            <given-names>J</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jiang</surname>
            <given-names>Y</given-names>
          </string-name>
          , Cao
          <string-name>
            <given-names>Z</given-names>
            and
            <surname>Huang</surname>
          </string-name>
          <string-name>
            <surname>T 2016</surname>
          </string-name>
          <article-title>UnitBox: An Advanced Object Detection Network INNS</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <surname>Bolotov</surname>
            <given-names>M A</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pechenin</surname>
            <given-names>V A</given-names>
          </string-name>
          and
          <string-name>
            <surname>Murzin S P 2016</surname>
          </string-name>
          <article-title>Method for uncertainty evaluation of the spatial mating of high-precision optical and mechanical parts</article-title>
          <source>Computer Optics</source>
          <volume>40</volume>
          (
          <issue>3</issue>
          )
          <fpage>360</fpage>
          -
          <lpage>369</lpage>
          DOI: 10.18287/
          <fpage>2412</fpage>
          -6179-2016-40-3-
          <fpage>360</fpage>
          -369
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>