<!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>Method of Detecting Special Points on Biometric Images based on New Filtering Methods</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Mariia Nazarkevych</string-name>
          <email>mariia.a.nazarkevych@lpnu.ua</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Volodymyr Hrytsyk</string-name>
          <email>volodymyr.v.hrytsyk@lpnu.ua</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Yaroslav Voznyi</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Andrii Marchuk</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Olha Vozna</string-name>
          <email>voznaseniv.olha@gmail.com</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Lviv Polytechnic National University</institution>
          ,
          <addr-line>12 Stepan Bandera str., Lviv, 79013</addr-line>
          ,
          <country country="UA">Ukraine</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Stepan Gzhytskyi National University of Veterinary Medicine and Biotechnologies</institution>
          ,
          <addr-line>50 Pekarska str., Lviv, 79010</addr-line>
          ,
          <country country="UA">Ukraine</country>
        </aff>
      </contrib-group>
      <fpage>243</fpage>
      <lpage>251</lpage>
      <abstract>
        <p>Artificial intelligence in the recognition of biometric images has great advantages of use because it works with big data and provides high speed. One of the common tasks of modern artificial intelligence is image recognition, including biometric image recognition and object detection. It is analyzed that the main approaches to fingerprint recognition are comparisons by special points; correlation comparison; pattern matching; pattern comparison, graph-based comparison. Ateb-Gabor filtering and selection of special points were performed. Experiments were performed with the selection of special points and it was shown that the images are better. Filtration results are based on PSNR and MSE. Visual filtering is shown as research results. Ateb-Gabor filters give a strong reaction at those points of the image where there is a component with local features of frequency in space and orientation. An experiment was performed with Ateb-Gabor and Gabor fingerprint filtering based on the freely available NIST Special Database 302. The results of the experiments showed that as a result of correlation, the images change significantly the higher the values of the parameters m, n, σ is laid down. When creating the biometric protection system, the results of filtration by Ateb Gabor showed good time and characteristics and recognition properties</p>
      </abstract>
      <kwd-group>
        <kwd>1 Image processing</kwd>
        <kwd>filtration</kwd>
        <kwd>biometric images</kwd>
        <kwd>identification</kwd>
        <kwd>filtering</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        Artificial intelligence studies methods of solving problems that require human understanding.
Evolving from research into pattern recognition and computational learning theory in the field of
artificial intelligence, machine learning explores the study and construction of algorithms that can
learn and make predictions from data—such algorithms overcome strictly static program instructions,
making data-driven predictions or decisions by building models with selective inputs [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ].
      </p>
      <p>
        Speaking of today, the field of artificial intelligence is dominated by such areas as working with
big data [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ], machine learning, deep learning related to the development of neural networks, training
with reinforcement.
      </p>
      <p>
        Algorithms are the driving forces behind the development of modern artificial intelligence - they
are certain mathematical models used in computer science [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. Another point is the accumulation of
big data thanks to the power of modern computers. Companies and each of us have begun to
accumulate a lot of data, and they are all food for algorithms that allow us to obtain certain practical
solutions and results based on this data. However, all these studies are possible only with good
computing power. Cheaper CPUs and the availability of computers as such essentially allow everyone
to take certain actions to analyze or work with data.
      </p>
      <p>
        The main engine of modern artificial intelligence is also deep learning and machine learning,
which are based on two main principles - pattern recognition (pattern recognition) and multi-iterative
learning, ie the creation of a mathematical model that is programmed and learned from data [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. which
she receives. The main task of this principle is to find correlations, ie relationships between different
data.
      </p>
      <p>Modern artificial intelligence often works with visual measurements and images. This is
explained, firstly, by cognitive-psychological factors, because the visual channel for people is the
most important in the perception of reality. In addition, we have a biological plane—the area of the
neocortex that is responsible for processing visual information, the most studied by scientists. The
creation of modern artificial neural networks essentially reproduces the work of these visual parts.
Cognitive sciences have significantly influenced the creation of artificial neural networks, and hence
the development of artificial intelligence. Now we see the opposite effect—knowledge of how
artificial neural networks work, allows us to deepen our understanding of the functioning of the
human brain.</p>
      <p>
        One of the typical tasks of modern artificial intelligence is image recognition - for example, face
detection in photographs or posture (pose detection). Another point is the discovery of objects. This
approach is now widely used for self-driving car technology, which has to recognize objects on the
road in real-time [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. Artistic style transfer-ring is a very popular approach when we apply the style
and patterns of paintings by famous artists to certain images. Artificial image creation is the ability of
artificial neural networks to create images at your request, including images of people who never
existed [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]. This technology raises perhaps the most ethical questions and debates in society. Derived
from this is also the emergence of the phenomenon of Deep Fake—the creation of false content,
images, and videos [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]. Such Deep Learning technologies can be used, for example, in various
political configurations - when you need, for example, to denigrate a politician or political force.
      </p>
    </sec>
    <sec id="sec-2">
      <title>2. Methods of Highlighting Special Points on Fingerprints</title>
      <p>
        Among the variety of existing approaches for fingerprint recognition, there are several, the most
commonly used [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]:
 Comparison on special points.
 Correlation comparison.
 Pattern matching.
 Pattern comparison.
 Comparison based on graphs.
      </p>
      <p>
        When comparing by special points, a pattern is formed on which the endpoints and branching
points are highlighted. The scanned image of the print also highlights special dots, which are
compared with the template [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ]. The main advantage of this algorithm is the speed of its operation and
ease of implementation. The disadvantages of the algorithm for comparison at special points include
high requirements for image quality and sensor size.
      </p>
      <p>
        The essence of the method of correlation comparison is that the obtained fingerprint is
superimposed on each standard from the database in turn, after which the difference between them is
calculated by pixels [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ]. The comparison process should include many iterations, in each of which
the image is rotated at a small angle or slightly shifted. Therefore, this method is the slowest and
requires high computing power.
      </p>
      <p>The pattern matching algorithm takes into account not only individual points but also the general
characteristics of the fingerprint, such as the thickness of the strips, their curvature or density. The
advantages of this method are that it can work with a lower quality print. However, this method is not
suitable for many searches in the database.</p>
      <p>
        The method of comparison by pattern uses the structure of the papillary pattern. The resulting
image is divided into many small axes-rows, in each of which the location of the lines is described by
the parameters of the sonic wave. The imprint obtained for comparison is aligned and reduced to the
same type as the template. The main advantages of this algorithm are a fairly high speed and low
requirements for image quality [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ].
      </p>
    </sec>
    <sec id="sec-3">
      <title>3. Development of a Method for Comparing Fingerprints</title>
      <p>
        Comparison of fingerprints is carried out on search of special points on images, a search of the
corresponding reference points on images, the definition of values of attributes of special points on
images [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ]. As a result, we decide that the images are identical if these images have a certain
common set M of the same corresponding singular points [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ].
      </p>
      <p>The built rule should work on new data to be entered into the system, and the number of
corresponding pairs of points is equal to the smaller of the two total numbers of special points in the
images. Therefore, search for the corresponding singular points by selecting from the set M the largest
subset MO and M spatially compatible pairs of singular points, perform the alignment of the singular
points of the first image with the special points of the second image. Subsequently, by coinciding their
reference points and rotating the special points of one of the images around the reference point in this
image, calculate the total number of special points of the two compared images in the overlap of these
images and decide that the two compared images are identical based on the number of corresponding
points found. , as well as the total number of special points in the area of overlap of these two images.</p>
      <p>There is a way that the two images being compared are fingerprints of one finger by calculating
the degree of closeness of these images by the formula:
 =   (1)</p>
      <p>√ 1∙ 2
where identical, k1, k2 respectively, the number of found corresponding points and the total number of
special points of the two images in the area of their overlap, and comparing the calculated degree of
proximity with a predetermined limit value.</p>
      <p>We can say that the images are identical if their reference points on the two compared images are
from the number of special points that correspond to the ends of branches of papillary lines.</p>
      <p>You can also search for singular points by searching for the set M of pairs of corresponding points
by constructing a complete bipartite graph, the left and right vertices of which correspond to special
points of the first and second compared images, and graph arcs—the sum of weighted differences of
vertex attributes connected by this arc. and finding the optimal markup of the vertices of this bipartite
graph.</p>
      <p>You can also define the overlap area of two images that are compared as one that is the overlap of
the convex hulls of the sets of singular points in these images.</p>
      <p>
        From the points obtained in the previous stages, an array of objects with the following parameters
is formed: the coordinates of the point; line type; the angle formed by them. The set of special point
parameters obtained from the scanned fingerprint is compared with the set of reference parameters of
fingerprints of registered RU users. The next step is to determine the deviations in the values of these
parameters. A large deviation threshold will increase the probability of a false match between the
biometric characteristics of two users—FAR (False Acceptance Rate). On the other hand, the small
value of the tolerance is the reason for the increased probability of failure of the legitimate user RU—
FRR (False Rejection Rate) [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ]. The problem of choosing the tolerance threshold is associated with
the deformation and displacement of the finger during scanning, which leads to obtaining different
parameters of the extracted points [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ]. As a result of the research, it was found that it is advisable to
keep information about the combination of three special points. Such a structure—called a triplet, is
shown in Fig. 2.
      </p>
      <p>For each central point n0 (xn0, yn0) and two adjacent n1 (xn1, yn1) and n2 (xn2, yn2) a parameter
vector is formed, see Fig.3.</p>
      <p>
        The algorithm shows the mask training procedure for each browser pair [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ]. We take a rough
search: which is the most effective, but the most effective and complete. Due to the small size of the
training data, we realize this brute force is possible and gives the best result. In particular, we first list
each pair of browsers and then all possible masks (line 4). For each mask, we review the training data
and make sure that we choose a mask that deploys stability between browsers, multiplying the
uniqueness [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ].
      </p>
      <p>
        We will form a fingerprint on the server-side based on hashes on the client-side of the task [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ].
As already mentioned, a fingerprint is a hash that is calculated from the AND operation of the hash
list of all tasks and a mask. The mask is a fingerprint for a single browser and is calculated from two
cross-browser fingerprint masks.
4. Comparison of Selected Special Points using Machine Learning
      </p>
      <p>We have at our disposal (Fig. 4) a finite number of data—a training sample. Each element is
described by a set of features x (“feature vector”). For each vector of parameters x, the answer y is
known.</p>
      <p>The problem of machine learning is that we need to construct a function y = f(x) from the vector of
signs x, which gives the answer y for any possible observation x.</p>
    </sec>
    <sec id="sec-4">
      <title>5. Ateb-Gabor Filtering and Selection of Special Points</title>
      <p>m0.9n1 σ=pi
m0.8n1 σ=pi
m0.7n1 σ=pi
m0.6n1 σ=pi
m0.5n1 σ=pi
m0.4n1 σ=pi
m0.3n1 σ=pi
m1n1σ=pi/4
m1n1σ=pi/3
m1n1σ=pi/2
m1n1σ=2*pi
m1n1σ=3*pi
m1n1σ=4*pi
m1n1σ=4.4*pi
m1n1σ=4.5*pi
m0.9n1 σ=pi
m0.8n1 σ=pi
m0.7n1 σ=pi
m0.6n1 σ=pi
m0.5n1 σ=pi
m1n1σ=pi/4
m1n1σ=pi/3
m1n1σ=pi/2
m1n1σ=2pi
m1n1σ=3pi
m1n1σ=4pi
m1n1σ=4.1pi
m1n1σ=4.2pi
m1n1σ=4.3pi
m1n1σ=3*pi
m1n1σ=4*pi
m1n1σ=4.4*pi
m1n1σ=4.5*pi
m0.5n1 σ=pi
m0.4n1 σ=pi
m0.3n1 σ=pi
m0.2n1 σ=pi
m0.1n1 σ=pi</p>
      <p>Comparison
m1n1σ=pi
m1n1σ=pi
m1n1σ=pi
m1n1σ=pi
m1n1σ=pi
m1n1σ=pi
m1n1σ=pi
m1n1σ=pi
m1n1σ=pi
m1n1σ=pi
m1n1σ=pi
m1n1σ=pi
m1n1σ=pi
m1n1σ=pi
m1n1σ=pi
m1n1 σ=pi
m1n1σ=pi
m1n1σ=pi
m1n1σ=pi
m1n1σ=pi
m1n1σ=pi
m1n1σ=pi
m1n1σ=pi
m1n1σ=pi
m1n1σ=pi
m1n1σ=pi
m1n1σ=pi
m1n1σ=pi
m1n1σ=pi
m1n1σ=pi
m1n1σ=pi
m1n1σ=pi
m1n1σ=pi
m1n1σ=pi
m1n1σ=pi
m1n1σ=pi
m1n1σ=pi
m1n1σ=pi</p>
      <p>Filtration time
Sample 3
1min 56s
1min 56s
1min 56s
1min 49s
1min 47s
1min 52s</p>
      <p>—
1min 40s
1min 46s
1min 30s
1min 40s
1min 43s
1min 36s
1min 36s
1min 36s
Sample 5
1min 36s
1min 55s
1min 34s
1min 34s
1min 40s
1min 34s
1min 34s
2min 02s
1min 25s
1min 24s
1min 24s
1min 25s
1min 24s
1min 30s
Sample 6
1min 31s
1min 34s
1min 33s
1min 42s
1min 42s
1min 48s
1min 38s
1min 48s
1min 38s
37.33
31.71
28.75
26.60
24.98
23.84
—
2.65
2.73
3.27
4.76
4.28
4.50
4.61
4.63
31.49
31.49
28.43
26.37
24.86
12.51
12.52
12.70
22.28
19.54
17.59
17.40
17.22
17.04
38.99
33.20
30.63
28.34
26.42
25.12
24.02
23.04
22.09
10.34
8.78
7.96
7.36
6.92
6.60
—
9.58
9.86
11.83
17.21
15.49
16.26
16.67
16.72
8.72
8.72
7.87
7.87
6.88
3.46
3.47
3.52
6.17
5.41
4.87
4.82
4.76
4.72
10.79
9.19
8.48
7.84
7.31
6.95
6.65
6.37
6.11</p>
      <p>
        The Ateb-Gabor filter [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ] is a product of the Gaussian and periodic Ateb function, which predicts
the improvement of monotonic areas of periodic images. In the case of fingerprints, it is assumed that
the periodicity of the lines and the standard deviation is consistent mainly with the local
characteristics of the image [
        <xref ref-type="bibr" rid="ref21">21</xref>
        ]. Ateb-Gabor filters give a strong reaction at those points of the image
where there is a component with local features of frequency in space and orientation [
        <xref ref-type="bibr" rid="ref22">22</xref>
        ].
      </p>
      <p>A two-dimensional Ateb-Gabor filter is used for image filtering. It is a harmonic function
multiplied by the Gaussian function. The two-dimensional Ateb-Gabor filter has the form
where
x’=x cos θ+ y sin θ
y’=-x sin θ+ y cos θ/</p>
      <p>
        In this equation, λ is the wavelength of the cosine multiplier, θ is in degrees, ψ is the phase shift in
degrees, and φ is the compression ratio [
        <xref ref-type="bibr" rid="ref23">23</xref>
        ], m, n are the parameters of the Ateb function, 2 is the
period of the Ateb function [
        <xref ref-type="bibr" rid="ref24">24</xref>
        ].
      </p>
      <p>An experiment was performed with Ateb-Gabor and Gabor fingerprint filtering based on the freely
available NIST Special Database 302. The results of the experiments showed that as a result of
correlation, the images change significantly the higher the values of the parameters m, n, σ are
embedded.</p>
      <p>Sample 1
Atebm1n1sigmapi1_3</p>
      <p>Atebm1n1sigmapi0_25</p>
      <p>Sample 3</p>
      <p>Atebm1n1sigmapi0_5
3_Atebm1n1sigma4pi
3_Atebm1n1sigmapi_3
3_Atebm1n1sigma4pi
3_Atebm1n1sigmapi_3
3_Atebm1n1sigmapi_4</p>
      <p>3_Atebm1n1sigmapi_2
Sample 5
5_Atebm1n1sigmapi_4
5_Atebm1n1sigmapi_3</p>
      <p>5_Atebm1n1sigmapi_2</p>
      <p>Sample 6
6_Atebm1n1sigma_6
6_Atebm1n1sigma_4
6_Atebm1n1sigma_2</p>
    </sec>
    <sec id="sec-5">
      <title>6. Conclusions</title>
      <p>Artificial intelligence systems for biometric images with deep learning and machine learning,
based on the basic principles of pattern recognition and multi-iteration learning, ie the creation of a
mathematical model that is programmed and learned from the data it receives, are analyzed.</p>
      <p>Comparison of fingerprints is carried out on search of special points on biometric images, a search
of the corresponding reference points on images, the definition of values of attributes of special points
on images.</p>
      <p>The results of the experiments were tested on the freely available NIST Special Database 302. The
filtering results are based on PSNR and MSE. Recognition indicators showed good results.</p>
    </sec>
    <sec id="sec-6">
      <title>7. References</title>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>R.</given-names>
            <surname>Toorajipour</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Sohrabpour</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Nazarpour</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Oghazi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Fischl</surname>
          </string-name>
          ,
          <article-title>Artificial intelligence in supply chain management: A systematic literature review</article-title>
          ,
          <source>Journal of Business Research</source>
          ,
          <volume>122</volume>
          (
          <year>2021</year>
          )
          <fpage>502</fpage>
          -
          <lpage>517</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>J. G.</given-names>
            <surname>Greeno</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H. A.</given-names>
            <surname>Simon</surname>
          </string-name>
          ,
          <article-title>Problem solving and reasoning (No</article-title>
          . UPITT/LRDC/ONR/APS-14),
          <source>Pittsburgh univ pa learning research and development center</source>
          <year>1984</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>A.</given-names>
            <surname>Gomez-Perez</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V. R.</given-names>
            <surname>Benjamins</surname>
          </string-name>
          ,
          <article-title>Applications of ontologies and problem-solving methods</article-title>
          .
          <source>AI Magazine</source>
          <volume>20</volume>
          (
          <year>1999</year>
          )
          <fpage>119</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>W. F.</given-names>
            <surname>Clocksin</surname>
          </string-name>
          ,
          <article-title>Artificial intelligence and the future</article-title>
          .
          <source>Philosophical Transactions of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences</source>
          <volume>361</volume>
          (
          <year>2003</year>
          ).)
          <fpage>1721</fpage>
          -
          <lpage>1748</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>N. M.</given-names>
            <surname>Avouris</surname>
          </string-name>
          , L. Gasser, (Eds.),
          <source>Distributed artificial intelligence: Theory and praxis</source>
          ,
          <source>Springer Science &amp; Business Media</source>
          <volume>5</volume>
          (
          <year>1992</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>V.</given-names>
            <surname>Khavalko</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Tsmots</surname>
          </string-name>
          ,
          <article-title>Image classification and recognition on the base of autoassociative neural network usage</article-title>
          ,
          <source>in: 2nd Ukraine Conference on Electrical and Computer Engineering (UKRCON)</source>
          ,
          <year>2019</year>
          , pp.
          <fpage>1118</fpage>
          -
          <lpage>1121</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>V.</given-names>
            <surname>Hrytsyk</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Grondzal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Bilenkyj</surname>
          </string-name>
          ,
          <article-title>Augmented reality for people with disabilities</article-title>
          ,
          <source>in: Proceedings of the International Conference on Computer Sciences and Information Technologies</source>
          ,
          <string-name>
            <surname>CSIT</surname>
          </string-name>
          <year>2015</year>
          , pp.
          <fpage>188</fpage>
          -
          <lpage>191</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>E.</given-names>
            <surname>Zhu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Guo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Yin</surname>
          </string-name>
          ,
          <article-title>Walking to singular points of fingerprints</article-title>
          .
          <source>Pattern Recognition</source>
          ,
          <volume>56</volume>
          (
          <year>2016</year>
          )
          <fpage>116</fpage>
          -
          <lpage>128</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>J.</given-names>
            <surname>Zhou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Gu</surname>
          </string-name>
          ,
          <article-title>A novel algorithm for detecting singular points from fingerprint images</article-title>
          ,
          <source>IEEE transactions on pattern analysis and machine intelligence</source>
          <volume>31</volume>
          (
          <year>2008</year>
          )
          <fpage>1239</fpage>
          -
          <lpage>1250</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>D.</given-names>
            <surname>Peralta</surname>
          </string-name>
          , I. Triguero,
          <string-name>
            <given-names>S.</given-names>
            <surname>García</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Saeys</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. M.</given-names>
            <surname>Benitez</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Herrera</surname>
          </string-name>
          ,
          <article-title>Distributed incremental fingerprint identification with reduced database penetration rate using a hierarchical classification based on feature fusion and selection</article-title>
          .
          <source>Knowledge-Based Systems</source>
          <volume>126</volume>
          (
          <year>2017</year>
          )
          <fpage>91</fpage>
          -
          <lpage>103</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>A.</given-names>
            <surname>Ross</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Shah</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. K.</given-names>
            <surname>Jain</surname>
          </string-name>
          ,
          <article-title>From template to image: Reconstructing fingerprints from minutiae points</article-title>
          ,
          <source>IEEE transactions on pattern analysis and machine intelligence</source>
          <volume>29</volume>
          (
          <year>2007</year>
          )
          <fpage>544</fpage>
          -
          <lpage>560</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>A. J.</given-names>
            <surname>Jacob</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N. T.</given-names>
            <surname>Bhuvan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. M.</given-names>
            <surname>Thampi</surname>
          </string-name>
          ,
          <article-title>Feature level fusion using multiple fingerprints</article-title>
          ,
          <source>International Journal on Computer Applications</source>
          , Special Issue on Computational Science--New Dimensions &amp;
          <string-name>
            <surname>Perspectives</surname>
          </string-name>
          (
          <year>2011</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>K.</given-names>
            <surname>Nandakumar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. K.</given-names>
            <surname>Jain</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Pankanti</surname>
          </string-name>
          ,
          <article-title>Fingerprint-based fuzzy vault: Implementation and performance</article-title>
          .
          <source>IEEE transactions on information forensics and security 2</source>
          (
          <year>2007</year>
          )
          <fpage>744</fpage>
          -
          <lpage>757</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>M.</given-names>
            <surname>Vatsa</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Singh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Noore</surname>
          </string-name>
          ,
          <article-title>Reducing the false rejection rate of iris recognition using textural and topological features</article-title>
          ,
          <source>Journal of Signal Processing</source>
          <volume>2</volume>
          (
          <year>2005</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>O.</given-names>
            <surname>Riznyk</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Povshuk</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Kynash</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Yurchak</surname>
          </string-name>
          ,
          <article-title>Composing method of anti-interference codes based on non-equidistant structures</article-title>
          ,
          <source>in: XIIIth International Conference on Perspective Technologies and Methods in MEMS Design (MEMSTECH)</source>
          ,
          <year>2017</year>
          , pp.
          <fpage>15</fpage>
          -
          <lpage>17</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>Q. A.</given-names>
            <surname>Hadi</surname>
          </string-name>
          ,
          <article-title>Vein palm recognition model using fusion of features</article-title>
          .
          <source>Telkomnika</source>
          <volume>18</volume>
          (
          <year>2020</year>
          )
          <fpage>2921</fpage>
          -
          <lpage>2927</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>T.</given-names>
            <surname>Nishimura</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H. N.</given-names>
            <surname>Patel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G. A.</given-names>
            <surname>Upadhyay</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H. L.</given-names>
            <surname>Smith</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Ozcan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Tung</surname>
          </string-name>
          ,
          <article-title>Prognostic Value of Cardiac Magnetic Resonance Septal Late Gadolinium Enhancement Patterns for Periaortic Ventricular Tachycardia Ablation: Heterogeneity of the Anteroseptal Substrate in Nonischemic Cardiomyopathy</article-title>
          ,
          <source>Heart Rhythm</source>
          <volume>18</volume>
          (
          <year>2020</year>
          )
          <fpage>579</fpage>
          -
          <lpage>588</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>V.</given-names>
            <surname>Buriachok</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Sokolov</surname>
          </string-name>
          , M. T. Dini,
          <article-title>Research of caller id spoofing launch, detection, and defense</article-title>
          ,
          <source>Cybersecur. Educ. Sci. Tech</source>
          .
          <volume>3</volume>
          (
          <issue>2020</issue>
          )
          <fpage>6</fpage>
          -
          <lpage>16</lpage>
          . doi:
          <volume>10</volume>
          .28925/
          <fpage>2663</fpage>
          -
          <lpage>4023</lpage>
          .
          <year>2020</year>
          .
          <volume>7</volume>
          .616.
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>T.</given-names>
            <surname>Radivilova</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Ageyev</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Kryvinska</surname>
          </string-name>
          , (Eds.),
          <article-title>Data-Centric Business and Applications: ICT Systems-Theory, Radio-</article-title>
          <string-name>
            <surname>Electronics</surname>
          </string-name>
          ,
          <source>Information Technologies and Cybersecurity</source>
          <volume>5</volume>
          (
          <year>2020</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <given-names>M.</given-names>
            <surname>Nazarkevych</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Lotoshynska</surname>
          </string-name>
          , I. Klyujnyk,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Voznyi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Forostyna</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Maslanych</surname>
          </string-name>
          ,
          <article-title>Complexity Evaluation of the Ateb-Gabor Filtration Algorithm in Biometric Security Systems</article-title>
          ,
          <source>in: IEEE 2nd Ukraine Conference on Electrical and Computer Engineering (UKRCON)</source>
          ,
          <year>2019</year>
          , pp.
          <fpage>961</fpage>
          -
          <lpage>964</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <given-names>M.</given-names>
            <surname>Nazarkevych</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Logoyda</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Troyan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Vozniy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Shpak</surname>
          </string-name>
          ,
          <article-title>The Ateb-Gabor Filter for Fingerprinting</article-title>
          ,
          <source>in: International Conference on Computer Science and Information Technology</source>
          ,
          <year>2019</year>
          , pp.
          <fpage>247</fpage>
          -
          <lpage>255</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [22]
          <string-name>
            <given-names>M.</given-names>
            <surname>Nazarkevych</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Lotoshynska</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Brytkovskyi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Dmytruk</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Dordiak</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Pikh</surname>
          </string-name>
          ,
          <article-title>Biometric Identification System with Ateb-Gabor Filtering</article-title>
          , іn: XIth
          <source>International Scientific and Practical Conference on Electronics and Information Technologies (ELIT)</source>
          ,
          <year>2019</year>
          , pp.
          <fpage>15</fpage>
          -
          <lpage>18</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          [23]
          <string-name>
            <given-names>M.</given-names>
            <surname>Logoyda</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Nazarkevych</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Voznyi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Dmytruk</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Smotr</surname>
          </string-name>
          ,
          <source>Identification of Biometric Images using Latent Elements</source>
          ,
          <year>2010</year>
          .
          <article-title>CEUR-WS.org, online CEUR-WS</article-title>
          .ORG/Vol2488/paper8.pdf
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          [24]
          <string-name>
            <given-names>M.</given-names>
            <surname>Nazarkevych</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Voznyi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Dmytryk</surname>
          </string-name>
          ,
          <article-title>Wavelet transformation Ateb-Gabor filters to biometric images</article-title>
          .
          <source>Cybersecur. Educ. Sci. Tech</source>
          .
          <volume>3</volume>
          (
          <year>2020</year>
          )
          <fpage>115</fpage>
          -
          <lpage>130</lpage>
          . doi:
          <volume>10</volume>
          .28925/
          <fpage>2663</fpage>
          -
          <lpage>4023</lpage>
          .
          <year>2020</year>
          .
          <volume>7</volume>
          .616.
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>