<!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>Simply Pattern Recognition as a Tool for Identity Verification</article-title>
      </title-group>
      <contrib-group>
        <aff id="aff0">
          <label>0</label>
          <institution>Karolina Ke ̨sik Institute of Mathematics Silesian University of Technology Kaszubska 23</institution>
          ,
          <addr-line>44-100 Gliwice</addr-line>
          ,
          <country country="PL">Poland</country>
        </aff>
      </contrib-group>
      <fpage>19</fpage>
      <lpage>23</lpage>
      <abstract>
        <p>-The increasing development of mobile and smart technologies caused that voice recognition and even analysis is becoming much more needed in recent years. For this reason, in this paper, the idea of voice recognition is presented. Proposed idea is based on classic approach called pattern matching. What distinguishes the technique is to present a sound sample in the form of a spectrogram (2D image). Then, the features extraction is done not on the sound, but on the image, what allows first to build the pattern, and then the classification. In addition, the matching process is supported by the k-nearest neighbors technique. The entire process has been described, tested and discussed.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>I. INTRODUCTION</title>
      <p>
        The Internet of Things is a concept that has become the
driving force behind technological action. The increasing need
to simplify life, as well its improvement, is mobilized not
only by companies offering various types of equipment, or
software with the smart note, but also by researchers. They
focus on developing particular aspects that are components of
any technique that is later assimilated by the industry, and
hence distributed to our homes. The most important topic
in this topic were widely described in [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ], [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ], [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ]. The
authors focused on emerging issues that are necessary from
the industrial point of view.
      </p>
      <p>
        It is hard to tell which components in large systems are
important. Therefore, all are treated equally and developed at a
similar level. Each software is installed on specific devices and
is a link between the user and hardware. In the case of systems
under the sign smart, various sensors are used to acquire
knowledge about the environment. An example is a motion
sensor or a camera that records an image and then serves to
find some deviation from the norm or the appearance of some
movement. One of video processing idea was presented in
[
        <xref ref-type="bibr" rid="ref17">17</xref>
        ], where the authors described video tamper detection by
the application of multi-scale mutual data. Another sensors
are microphones that record the sound and voice. Sound
recording devices allow to receive voice commands that will
be important especially for people with disabilities. At first,
the analog signal must be converted to discrete one (because of
processing by computers), so processing of the signal is critical
issue. In [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ], [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ], [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ], the idea of using discrete and wavelet
transformation to obtain audio signal in the form ready to
Copyright held by the author(s).
analyzes was shown. Again in [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ], [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ] extraction technique
for a specific parts of signals was shown. The method was
tested on some popular voice distortion like cough. It is useful
in authorization systems when a record is created and for
verification process, only first/last name is required.
      </p>
      <p>
        Of course, these systems to operate data obtained from many
sensors need some algorithm to gather all these information
and process them. If the system works in real time, a lot
of data will come in every second. And this means that
the software will not be able to process all at the same
time, hence the idea is to use parallelization or give certain
weights to incoming data. Queuing service is a stochastic
model according to which it can direct the data handling
from the sensors. An example of such a model is shown in
[
        <xref ref-type="bibr" rid="ref18">18</xref>
        ]. Large amounts of data need fast sorting algorithms not
only for sorting, but for searching a specific information in
database, where all incoming data are stored. One of the latest
achievement in these area are algorithms which are merged
with multi-threaded processor [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ], [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ]. Many of new methods
are based on artificial intelligence like neural networks or
swarm intelligence [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ], [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ], [
        <xref ref-type="bibr" rid="ref22">22</xref>
        ]. All of these mentioned
components are necessary in large systems, but it also need
security against uncontrolled access to data or computational
processes. Important work in these area is presented in [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ],
where almost all aspects and challenges in internet of things
are described and discussed.
      </p>
      <p>In this paper, the idea of identity verification process is
described with background about interpreting audio signal to
a form that allows analysis.</p>
    </sec>
    <sec id="sec-2">
      <title>II. SIGNAL THEORY</title>
      <p>The processed signal should be given in a discrete form.
Especially when the operations are performed by a
computer. In practice, having an analog signal should be changed
to a discrete equivalent. Unfortunately, even such a
version is practically not useful. For this purpose, the signal
must undergo a certain transformation, which will transform
it to the form possible in the analysis. One of the most
known transformation is Fourier’s one. Suppose that s(n) =
(s0; s1; s2; : : : ; sN 1) is a signal. Transformation of such a set
will give (S0; S1; S2; : : : ; SN 1), where Si 2 C and it is done</p>
      <p>N 1 2 ink</p>
      <p>
        Sk = nX=0 sn exp N 0 k N 1: (1)
While the discrete Fourier transform allowed for calculations
on various machines, the operation time was still too long. In
1960s, two American scientists – James W. Cooley and John
W. Tukey presented Fast Fourier Transform [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ], [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ], which is
a technique of calculation transformation using recursion and
division and rule method . Whole idea is based on the division
of functions into even and odd indices in the following way
Sk =
      </p>
      <p>N 1
X sn exp
n=0</p>
      <p>N=2 1
= X s2m exp
2i nk</p>
      <p>N
m=0</p>
      <p>N=2 1
+ X
m=0</p>
      <p>N=2 1
= X s2m exp
m=0</p>
      <p>s2m+1 exp
+ exp
2i k</p>
      <p>N</p>
      <p>N=2 1</p>
      <p>X
m=0
n= 1
s2m+1 exp
2i km</p>
      <p>N=2
;
It is possible to analyze the sound in graphic form, but for this
purpose the signal should be saved in the form of a so-called
short-time transform as
Sfs[n]g(m; f )</p>
      <p>S(m; f ) =
m] exp( jf n):
(3)
Using above equation, the signal can be presented as a graph
of the amplitude spectrum, which is determined as
spectrogramfs(t)g(t; f )
jS(t; f )j2:
(4)
Presenting the calculated values from Eq. 4 on 2D graph, we
have points and their values. There are two axes – OX which
means time and OY representing the frequency. The value of
a given point is represented by the shade of color which is
understood as a intensity. Sample graphs are shown in Fig. 1.</p>
    </sec>
    <sec id="sec-3">
      <title>III. PATTERN RECOGNITION</title>
      <p>Let us consider spectrogram as a set of point (x; y) with
intensity in the range h0; 1i. On the spectrogram, the most
important features will have the brightest shade, so the
intensity value will have the smallest values.</p>
      <p>At the beginning, let us focus on pattern creation process.
The newly hired employee is asked to repeat his/her name
at least 10 times. Each repetition is one recording. Then,
10 spectrograms are taken and used to create pattern based
on these recordings. In ideal world, all samples should look
similar. However, in practice it is not so easy because there
can be worst quality of records, some noises and many other
factors. For each sample, we find the value zmax with the
(2)
Using value, it is possible to create a vector of the most
characteristic points (with all points satisfied condition in Eq.
(5)) in the following form
k =
x0k; y0k; z0k ; x1k; y1k; z1k ; : : : ; xkm; ymk; zmk
; (6)
where k is the number of a specific record, x0k and y0k are the
point with the lowest saturation equal to z0k.</p>
      <p>In this way, k sets will be created. All values are grouped by
the k-nearest neighbors classifier to remove points at a short
distance in each sets. A probability estimator is defined as
p^(kjx) =
1 n</p>
      <p>X I( (x; xi)
K i=1
(x; x(k)))I(yi = k)
k = 1; : : : ; L;
where ( ) is metric, x(k) is k-th as to the distance to the
point from the samples x. And using these, the classifier is
formulated as
d^KNN (x) = arg max p^(kjx):
k</p>
      <p>After analyzing the points, there is a possible that sets will
be have different numbers of elements. To fix it, sets will be
pruned to the number describing the smallest set. Then, all
sets k will create intervals for points in the pattern. Limits
of these intervals are determined as
minfx0kg; maxfx0 g ; minfy0kg; maxfy0 g ;</p>
      <p>k k
mmiinnffzy0kmkgg; ;mmaaxxffzy0kmkg g ;;: :m: ;infmzmkingf;xmkmagx;fmzmkaxgfxkm;g ; (9)
k 2 f1; 2; : : : ; 10g</p>
    </sec>
    <sec id="sec-4">
      <title>IV. EXPERIMENTS</title>
      <p>Proposed method was tested on a small dataset consisting
only 60 samples, from which half of them contained the three
words "James Tiberius Kirk" made by one person who is
identified with this data (so called owner). The remaining
30 samples were created by three different people (so called
counterfeiters), each of them has created 10 samples.</p>
      <p>Using only 10 samples from the owner (selected randomly),
pattern was modeled. Then, all samples in the database were
checked for pattern match. If the compatibility was at least
80%, then it was marked as owner. Otherwise, the sample
was marked as falsification.</p>
      <p>The verification of the effectiveness of the proposed
technique was examined by grouping the samples as T P (true
positive), T N (true negative), F P (false positive), F N (false
negative). For such divided results, accuracy was calculated
as , Dice’s coefficient as , overlap , sensitivity and
specificity according to</p>
      <p>The distribution of correctly and incorrectly classified
samples is presented in Fig. 2, 3, 4, 5, 6. In the case of the owner,
only 10% of correct samples were incorrectly classified. As
the reason, some noise or recording time can be the issue. For
samples made by three different counterfeiters, the average
rate of fraud detection was 80% which is a good result
considering the number of samples. A more detailed analysis
of the measurements is shown in Tab. I, where the average
effectiveness is 85%. Similarity coefficient reached 0:64 which
is quite high value. However, it is worth noting that the
obtained data should be contained within a fairly wide error
range. Similarly with the other coefficients – the probability
of obtaining a negative classification assuming that the sample
is true is 0:33, and the probability of positive verification for
fraud is 0:53. The obtained results indicate a high degree of
effectiveness despite the number of sound samples as well as
the extraction and classification technique itself.</p>
      <p>In this paper, the idea of audio analysis based on the
mechanism of pattern matching with k-nearest neighbors was
presented. It is important to develop more different techniques
for security due to the reduction in the number of calculations,
simplifying the operation as well as increasing the precision of
actions. This technique was implemented and tested on a small
dataset consisting only 60 samples. Half of them belonged to
the one person (called as owner), and the rest of them to three
other people which were a forgery and used for verification
purposes. Due to the noise and different recording times, the
program incorrectly classified 10% of true records. However, it
does not change the fact that the effectiveness of the proposed
idea reached almost 85%. It is worth noting that it was tested
for k = 4, and increasing the number of neighbors resulted in
a decrease in the correctness of classification, which may be
due to the number of samples.</p>
      <p>An important aspect of further research is increasing the
database with a much larger number of recordings, increasing
noises or problems with the voice of the recording person.
It is particularly important to be able to bypass hoarseness
or remove the cough. In the case of accuracy, the use of
other, more complicated classification (like neural networks)
methods may prove to be a much more favorable approach.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>F.</given-names>
            <surname>Beritelli</surname>
          </string-name>
          , G. Capizzi,
          <string-name>
            <given-names>G. L.</given-names>
            <surname>Sciuto</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Napoli</surname>
          </string-name>
          , and
          <string-name>
            <given-names>F.</given-names>
            <surname>Scaglione</surname>
          </string-name>
          .
          <article-title>Automatic heart activity diagnosis based on gram polynomials and probabilistic neural networks</article-title>
          .
          <source>Biomedical Engineering Letters</source>
          ,
          <volume>8</volume>
          (
          <issue>1</issue>
          ):
          <fpage>77</fpage>
          -
          <lpage>85</lpage>
          ,
          <year>2018</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>D.</given-names>
            <surname>Birvinskas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Jusas</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Martisius</surname>
          </string-name>
          , and
          <string-name>
            <given-names>R.</given-names>
            <surname>Damasevicius</surname>
          </string-name>
          .
          <article-title>Eeg dataset reduction and feature extraction using discrete cosine transform</article-title>
          .
          <source>In Computer Modeling and Simulation (EMS)</source>
          ,
          <year>2012</year>
          Sixth UKSim/AMSS European Symposium on, pages
          <fpage>199</fpage>
          -
          <lpage>204</lpage>
          . IEEE,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>W. T.</given-names>
            <surname>Cochran</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. W.</given-names>
            <surname>Cooley</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D. L.</given-names>
            <surname>Favin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H. D.</given-names>
            <surname>Helms</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R. A.</given-names>
            <surname>Kaenel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W. W.</given-names>
            <surname>Lang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Maling</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D. E.</given-names>
            <surname>Nelson</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C. M.</given-names>
            <surname>Rader</surname>
          </string-name>
          , and
          <string-name>
            <given-names>P. D.</given-names>
            <surname>Welch</surname>
          </string-name>
          .
          <article-title>What is the fast fourier transform?</article-title>
          <source>Proceedings of the IEEE</source>
          ,
          <volume>55</volume>
          (
          <issue>10</issue>
          ):
          <fpage>1664</fpage>
          -
          <lpage>1674</lpage>
          ,
          <year>1967</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>J. W.</given-names>
            <surname>Cooley</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P. A.</given-names>
            <surname>Lewis</surname>
          </string-name>
          , and
          <string-name>
            <given-names>P. D.</given-names>
            <surname>Welch</surname>
          </string-name>
          .
          <article-title>The fast fourier transform and its applications</article-title>
          .
          <source>IEEE Transactions on Education</source>
          ,
          <volume>12</volume>
          (
          <issue>1</issue>
          ):
          <fpage>27</fpage>
          -
          <lpage>34</lpage>
          ,
          <year>1969</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>R.</given-names>
            <surname>Damaševicˇius</surname>
          </string-name>
          , C. Napoli, T. Sidekerskiene˙, and
          <string-name>
            <surname>M.</surname>
          </string-name>
          <article-title>Woz´niak. Imf mode demixing in emd for jitter analysis</article-title>
          .
          <source>Journal of Computational Science</source>
          ,
          <volume>22</volume>
          :
          <fpage>240</fpage>
          -
          <lpage>252</lpage>
          ,
          <year>2017</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>J.</given-names>
            <surname>Gubbi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Buyya</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Marusic</surname>
          </string-name>
          , and
          <string-name>
            <given-names>M.</given-names>
            <surname>Palaniswami</surname>
          </string-name>
          .
          <article-title>Internet of things (iot): A vision, architectural elements, and future directions</article-title>
          .
          <source>Future generation computer systems</source>
          ,
          <volume>29</volume>
          (
          <issue>7</issue>
          ):
          <fpage>1645</fpage>
          -
          <lpage>1660</lpage>
          ,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>P. N.</given-names>
            <surname>Mahalle</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P. A.</given-names>
            <surname>Thakre</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N. R.</given-names>
            <surname>Prasad</surname>
          </string-name>
          , and
          <string-name>
            <given-names>R.</given-names>
            <surname>Prasad</surname>
          </string-name>
          .
          <article-title>A fuzzy approach to trust based access control in internet of things</article-title>
          . In Wireless Communications, Vehicular Technology,
          <source>Information Theory and Aerospace &amp; Electronic Systems (VITAE)</source>
          ,
          <year>2013</year>
          3rd International Conference on, pages
          <fpage>1</fpage>
          -
          <lpage>5</lpage>
          . IEEE,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>Z.</given-names>
            <surname>Marszałek</surname>
          </string-name>
          .
          <article-title>Parallelization of fast sort algorithm</article-title>
          .
          <source>In International Conference on Information and Software Technologies</source>
          , pages
          <fpage>408</fpage>
          -
          <lpage>421</lpage>
          . Springer,
          <year>2017</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>Z.</given-names>
            <surname>Marszałek</surname>
          </string-name>
          .
          <article-title>Parallelization of modified merge sort algorithm</article-title>
          .
          <source>Symmetry</source>
          ,
          <volume>9</volume>
          (
          <issue>9</issue>
          ):
          <fpage>176</fpage>
          ,
          <year>2017</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>C.</given-names>
            <surname>Perera</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C. H.</given-names>
            <surname>Liu</surname>
          </string-name>
          , and
          <string-name>
            <given-names>S.</given-names>
            <surname>Jayawardena</surname>
          </string-name>
          .
          <article-title>The emerging internet of things marketplace from an industrial perspective: A survey</article-title>
          .
          <source>IEEE Transactions on Emerging Topics in Computing</source>
          ,
          <volume>3</volume>
          (
          <issue>4</issue>
          ):
          <fpage>585</fpage>
          -
          <lpage>598</lpage>
          ,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>D.</given-names>
            <surname>Polap</surname>
          </string-name>
          .
          <article-title>Extraction of specific data from a sound sample by removing additional distortion</article-title>
          .
          <source>In Computer Science and Information Systems (FedCSIS)</source>
          ,
          <source>2017 Federated Conference on</source>
          , pages
          <fpage>353</fpage>
          -
          <lpage>356</lpage>
          . IEEE,
          <year>2017</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>D.</given-names>
            <surname>Połap</surname>
          </string-name>
          and
          <string-name>
            <surname>M.</surname>
          </string-name>
          <article-title>Woz´niak. Extraction and analysis of voice samples based on short audio files</article-title>
          .
          <source>In International Conference on Information and Software Technologies</source>
          , pages
          <fpage>422</fpage>
          -
          <lpage>431</lpage>
          . Springer,
          <year>2017</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>N.</given-names>
            <surname>Romano</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Scivoletto</surname>
          </string-name>
          , and
          <string-name>
            <given-names>D.</given-names>
            <surname>Polap</surname>
          </string-name>
          .
          <article-title>A real-time audio compression technique based on fast wavelet filtering and encoding</article-title>
          .
          <source>In Computer Science and Information Systems (FedCSIS)</source>
          ,
          <source>2016 Federated Conference on</source>
          , pages
          <fpage>497</fpage>
          -
          <lpage>502</lpage>
          . IEEE,
          <year>2016</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>S.</given-names>
            <surname>Sicari</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Rizzardi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L. A.</given-names>
            <surname>Grieco</surname>
          </string-name>
          ,
          <article-title>and</article-title>
          <string-name>
            <given-names>A.</given-names>
            <surname>Coen-Porisini</surname>
          </string-name>
          .
          <article-title>Security, privacy and trust in internet of things: The road ahead</article-title>
          .
          <source>Computer Networks</source>
          ,
          <volume>76</volume>
          :
          <fpage>146</fpage>
          -
          <lpage>164</lpage>
          ,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>J. T.</given-names>
            <surname>Starczewski</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Pabiasz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Vladymyrska</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Marvuglia</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Napoli</surname>
          </string-name>
          , and
          <string-name>
            <surname>M.</surname>
          </string-name>
          <article-title>Woz´niak. Self organizing maps for 3d face understanding</article-title>
          .
          <source>In International Conference on Artificial Intelligence and Soft Computing</source>
          , pages
          <fpage>210</fpage>
          -
          <lpage>217</lpage>
          . Springer,
          <year>2016</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>M.</given-names>
            <surname>Vasiljevas</surname>
          </string-name>
          , R. Turcˇinas, and R. Damaševicˇius.
          <article-title>Development of emgbased speller</article-title>
          .
          <source>In Proceedings of the XV International Conference on Human Computer Interaction, page 7. ACM</source>
          ,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>W.</given-names>
            <surname>Wei</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Fan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Song</surname>
          </string-name>
          , and
          <string-name>
            <given-names>H.</given-names>
            <surname>Wang</surname>
          </string-name>
          .
          <article-title>Video tamper detection based on multi-scale mutual information</article-title>
          .
          <source>Multimedia Tools and Applications</source>
          , pages
          <fpage>1</fpage>
          -
          <lpage>18</lpage>
          ,
          <year>2017</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>W.</given-names>
            <surname>Wei</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q.</given-names>
            <surname>Xu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Hei</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Shen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Shi</surname>
          </string-name>
          , and
          <string-name>
            <given-names>L.</given-names>
            <surname>Shan</surname>
          </string-name>
          .
          <article-title>Gi/geom/1 queue based on communication model for mesh networks</article-title>
          .
          <source>International Journal of Communication Systems</source>
          ,
          <volume>27</volume>
          (
          <issue>11</issue>
          ):
          <fpage>3013</fpage>
          -
          <lpage>3029</lpage>
          ,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>A.</given-names>
            <surname>Whitmore</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Agarwal</surname>
          </string-name>
          , and
          <string-name>
            <given-names>L. Da</given-names>
            <surname>Xu</surname>
          </string-name>
          .
          <article-title>The internet of things-a survey of topics and trends</article-title>
          .
          <source>Information Systems Frontiers</source>
          ,
          <volume>17</volume>
          (
          <issue>2</issue>
          ):
          <fpage>261</fpage>
          -
          <lpage>274</lpage>
          ,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <given-names>M.</given-names>
            <surname>Woz</surname>
          </string-name>
          <article-title>´niak and</article-title>
          <string-name>
            <given-names>D.</given-names>
            <surname>Połap</surname>
          </string-name>
          .
          <article-title>Adaptive neuro-heuristic hybrid model for fruit peel defects detection</article-title>
          .
          <source>Neural Networks</source>
          ,
          <volume>98</volume>
          :
          <fpage>16</fpage>
          -
          <lpage>33</lpage>
          ,
          <year>2018</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <given-names>M.</given-names>
            <surname>Wozniak</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Polap</surname>
          </string-name>
          , G. Borowik, and
          <string-name>
            <given-names>C.</given-names>
            <surname>Napoli</surname>
          </string-name>
          .
          <article-title>A first attempt to cloud-based user verification in distributed system</article-title>
          .
          <source>In Asia-Pacific Conference on Computer Aided System Engineering (APCASE)</source>
          , pages
          <fpage>226</fpage>
          -
          <lpage>231</lpage>
          . IEEE,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [22]
          <string-name>
            <given-names>M.</given-names>
            <surname>Woz</surname>
          </string-name>
          ´niak,
          <string-name>
            <given-names>D.</given-names>
            <surname>Połap</surname>
          </string-name>
          , L. Kos´mider, and
          <string-name>
            <given-names>T.</given-names>
            <surname>Cłapa</surname>
          </string-name>
          .
          <article-title>Automated fluorescence microscopy image analysis of pseudomonas aeruginosa bacteria in alive and dead stadium</article-title>
          .
          <source>Engineering Applications of Artificial Intelligence</source>
          ,
          <volume>67</volume>
          :
          <fpage>100</fpage>
          -
          <lpage>110</lpage>
          ,
          <year>2018</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>