<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.1 20151215//EN" "http://jats.nlm.nih.gov/publishing/1.1/JATS-journalpublishing1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" article-type="research-article" dtd-version="1.1">
<front>
<journal-meta>
<journal-id journal-id-type="pmc">CSSE</journal-id>
<journal-id journal-id-type="nlm-ta">CSSE</journal-id>
<journal-id journal-id-type="publisher-id">CSSE</journal-id>
<journal-title-group>
<journal-title>Computer Systems Science &#x0026; Engineering</journal-title>
</journal-title-group>
<issn pub-type="ppub">0267-6192</issn>
<publisher>
<publisher-name>Tech Science Press</publisher-name>
<publisher-loc>USA</publisher-loc>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="publisher-id">25672</article-id>
<article-id pub-id-type="doi">10.32604/csse.2023.025672</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Article</subject>
</subj-group>
</article-categories>
<title-group>
<article-title>Implicit Continuous User Authentication for Mobile Devices based on Deep Reinforcement Learning</article-title><alt-title alt-title-type="left-running-head">Implicit Continuous User Authentication for Mobile Devices Based on Deep Reinforcement Learning</alt-title><alt-title alt-title-type="right-running-head">Implicit Continuous User Authentication for Mobile Devices Based on Deep Reinforcement Learning</alt-title>
</title-group>
<contrib-group content-type="authors">
<contrib id="author-1" contrib-type="author" corresp="yes">
<name name-style="western"><surname>Jose</surname><given-names>Christy James</given-names></name>
<xref ref-type="aff" rid="aff-1">1</xref><email>christy@gecidukki.ac.in</email>
</contrib>
<contrib id="author-2" contrib-type="author">
<name name-style="western"><surname>Rajasree</surname><given-names>M. S.</given-names></name>
<xref ref-type="aff" rid="aff-2">2</xref>
</contrib>
<aff id="aff-1"><label>1</label><institution>Government Engineering College</institution>, <addr-line>Idukki, 685603</addr-line>, <country>India</country></aff>
<aff id="aff-2"><label>2</label><institution>APJ Abdul Kalam Technological University</institution>, <addr-line>Thiruvananthapuram, 695016</addr-line>, <country>India</country></aff>
</contrib-group><author-notes><corresp id="cor1"><label>&#x002A;</label>Corresponding Author: Christy James Jose. Email: <email>christy@gecidukki.ac.in</email></corresp></author-notes>
<pub-date pub-type="epub" date-type="pub" iso-8601-date="2022-06-07"><day>07</day>
<month>06</month>
<year>2022</year></pub-date>
<volume>44</volume>
<issue>2</issue>
<fpage>1357</fpage>
<lpage>1372</lpage>
<history>
<date date-type="received"><day>01</day><month>12</month><year>2021</year></date>
<date date-type="accepted"><day>21</day><month>2</month><year>2022</year></date>
</history>
<permissions>
<copyright-statement>&#x00A9; 2023 Jose and Rajasree</copyright-statement>
<copyright-year>2023</copyright-year>
<copyright-holder>Jose and Rajasree</copyright-holder>
<license xlink:href="https://creativecommons.org/licenses/by/4.0/">
<license-p>This work is licensed under a <ext-link ext-link-type="uri" xlink:type="simple" xlink:href="https://creativecommons.org/licenses/by/4.0/">Creative Commons Attribution 4.0 International License</ext-link>, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.</license-p>
</license>
</permissions>
<self-uri content-type="pdf" xlink:href="TSP_CSSE_25672.pdf"></self-uri>
<abstract>
<p>The predominant method for smart phone accessing is confined to methods directing the authentication by means of Point-of-Entry that heavily depend on physiological biometrics like, fingerprint or face. Implicit continuous authentication initiating to be loftier to conventional authentication mechanisms by continuously confirming users&#x2019; identities on continuing basis and mark the instant at which an illegitimate hacker grasps dominance of the session. However, divergent issues remain unaddressed. This research aims to investigate the power of Deep Reinforcement Learning technique to implicit continuous authentication for mobile devices using a method called, Gaussian Weighted Cauchy Kriging-based Continuous Czekanowski&#x2019;s (GWCK-CC). First, a Gaussian Weighted Non-local Mean Filter Preprocessing model is applied for reducing the noise present in the raw input face images. Cauchy Kriging Regression function is employed to reduce the dimensionality. Finally, Continuous Czekanowski&#x2019;s Classification is utilized for proficient classification between the genuine user and attacker. By this way, the proposed GWCK-CC method achieves accurate authentication with minimum error rate and time. Experimental assessment of the proposed GWCK-CC method and existing methods are carried out with different factors by using UMDAA-02 Face Dataset. The results confirm that the proposed GWCK-CC method enhances authentication accuracy, by 9&#x0025;, reduces the authentication time, and error rate by 44&#x0025;, and 43&#x0025; as compared to the existing methods.</p>
</abstract>
<kwd-group kwd-group-type="author">
<kwd>Deep reinforcement learning</kwd>
<kwd>gaussian weighted</kwd>
<kwd>non-local</kwd>
<kwd>mean filter</kwd>
<kwd>cauchy kriging regression</kwd>
<kwd>continuous czekanowski&#x2019;s</kwd>
<kwd>implicit continuous authentication</kwd>
<kwd>mobile devices</kwd>
</kwd-group>
</article-meta>
</front>
<body>
<sec id="s1">
<label>1</label>
<title>Introduction</title>
<p>The use of passwords and keys permits users in accessing the personal information by means of safeguarding against unauthorized attempts. However, research studies conducted on this domain have shown that users frequently select passwords that are easy to remember or combination of weak passwords to safeguard their data, despite passwords being easy to predict. Moreover, with the swift evolutions in mobile devices stimulate the users to utilize these devices in regular monitoring and storing the delicate health data. So, to bridge the gap between authentication and usability, there has been a transformation towards biometric authentication models employing certain biological features, like, fingerprints and face, behavioral features like keystroke, swipe patterns and so on. In addition, implicit continuous authentication, specifically on mobile devices, is gaining more awareness in recent years. As against user authentication performed only at the entry point when the device is locked, authentication methods regulate whether biometric traits correspond to a user in a continuous manner. In this manner, users can monitor in a continuous manner and hence do not require to persistently perturb concerning security and privacy despite devices are lost.</p>
<p>A novel gait-based continuous authentication method applying multimodal learning called, GaitCode [<xref ref-type="bibr" rid="ref-1">1</xref>] on cooperatively recorded accelerometer and ground contact force data from smart wearable devices was proposed in [<xref ref-type="bibr" rid="ref-1">1</xref>]. Despite improvement observed in error rate and false acceptance rate, the authentication accuracy, time and error rate involved in the overall implicit continuous authentication process was not focused. To address this issue in this work, by applying filter function for temporal data as preprocessing results in continuous denoised images, therefore improving the authentication time and accuracy. Also, Cauchy distribution function is used to reduce the error rate by scaling the different face images for validation.</p>
<p>An Extremal Openset Rejection (EOR), comprising of a two-fold mechanism involving identification and a verification step distinctly based on sparse representation was proposed in [<xref ref-type="bibr" rid="ref-2">2</xref>]. Despite improvement found in verification accuracy, the sensitivity and specificity involved in continuous monitoring was not focused. To address this issue in this work, Continuous Czekanowski&#x2019;s Classification performed with the aid of continuous function ensures improved sensitivity and specificity.</p>
<sec id="s1_1">
<label>1.1</label>
<title>Objective</title><list list-type="bullet"><list-item>
<p>To develop a novel GWCK-CC method to guarantee implicit continuous authentication for mobile devices.</p></list-item><list-item>
<p>Eradication of noise to achieve denoising of images using Gaussian Weighted Non-local Mean Filter Preprocessing model.</p></list-item><list-item>
<p>Extraction of the important features with minimization in dimensionality, utilizing Cauchy Kriging Regression Feature Extraction model.</p></list-item><list-item>
<p>To enhance the classification accuracy among normal users and hackers with lesser time, employing Continuous Czekanowski&#x2019;s Classification.</p></list-item></list>
</sec>
<sec id="s1_2">
<label>1.2</label>
<title>Organization of Paper</title>
<p>The structure of the paper is organized as follows. Related work is provided in Section 2. In Section 3, the design of the proposed method, Gaussian Weighted Cauchy Kriging-based Continuous Czekanowski&#x2019;s (GWCK-CC) implicit continuous authentication on mobile devices along with the algorithm is presented. Evaluation of the algorithms with the detailed experimental setup is provided in Section 4. In 5 detailed discussions is given with the aid of table and graph. Finally, the concluding remarks are provided in Section 6.</p>
</sec>
</sec>
<sec id="s2">
<label>2</label>
<title>Related Works</title>
<p>In today&#x2019;s world with the advancement in technology, the modern smart phone has become a vital part of every person&#x2019;s life. Security concerns have thus elevated with the increasing utilization of smart phone owing to the huge availability and accessibility of personal files, and banking and business information. Also, continuous authentication is not an easy task and several research works has been conducted in this area.</p>
<sec id="s2_1">
<label>2.1</label>
<title>Biometric-based Authentication</title>
<p>Biometric solution employing feature fusion approach integrating both handcrafted and non-handcrafted features was proposed in [<xref ref-type="bibr" rid="ref-3">3</xref>]. But, it failed to improve the performance by using UBIPr, Color FERET and Ethnic Ocular databases. A behavior-based authentication using swipe was utilized in [<xref ref-type="bibr" rid="ref-4">4</xref>] with the objective of authenticating the user in a continuous manner. On the other hand, activity patterns were employed in [<xref ref-type="bibr" rid="ref-5">5</xref>] using random forest, support vector and Bayes for analyzing continuous authentication of smart phone users.</p>
<p>More than 140 papers pertaining to recent behavioral continuous authentication methods were investigated in [<xref ref-type="bibr" rid="ref-6">6</xref>]. In [<xref ref-type="bibr" rid="ref-7">7</xref>], an in depth analysis of whether continuous authentication is possible or not for mobile banking application was investigated. However, the reliability and practicability was not focused. Also, larger dataset was not considered. To address on this aspect, one class SVM was designed in [<xref ref-type="bibr" rid="ref-8">8</xref>] for ensuring context aware implicit authentication.</p>
</sec>
<sec id="s2_2">
<label>2.2</label>
<title>Continuous Authentication on Mobile Devices</title>
<p>A hierarchical implicit authentication mechanism using binary support vector machine with radial basis function for ensuring accuracy was proposed in [<xref ref-type="bibr" rid="ref-9">9</xref>]. In [<xref ref-type="bibr" rid="ref-10">10</xref>], an intelligent add-on for smart phones to validate continuous authentication of users was proposed. Data augmentation method called, Kernel Ridge Regression with Truncated Gaussian Radial Basis Function was designed in [<xref ref-type="bibr" rid="ref-11">11</xref>]. But, the time was reduced by using small dataset.</p>
<p>In [<xref ref-type="bibr" rid="ref-12">12</xref>] a novel biosignal authentication mechanism ensuring continuous, seamless, and secure user authentication was provided by means of coupling. Yet another continuous authentication using blockchain for IoT environment called, CAB-IoT was proposed in [<xref ref-type="bibr" rid="ref-13">13</xref>]. However, the accuracy aspect was not focused with AT&#x0026;T Database of faces. To address this issue, a periodical authentication mechanism employing Deep Auto Encoder and Softmax Regression (DAE-SR) for ensuring accuracy was proposed in [<xref ref-type="bibr" rid="ref-14">14</xref>].</p>
</sec>
<sec id="s2_3">
<label>2.3</label>
<title>Continuous User Authentication Progress and Challenges</title>
<p>A review of non-intrusive active user authentication using biometrics to investigate the merits and demerits of authentication system was investigated in [<xref ref-type="bibr" rid="ref-15">15</xref>]. An overview of numerous continuous authentication systems on mobile devices was analyzed in [<xref ref-type="bibr" rid="ref-16">16</xref>]. Sensitive information was retained in mobile devices and to ensure privacy and security deep-learning based authentication system via user pattern was proposed in [<xref ref-type="bibr" rid="ref-17">17</xref>]. With this the false acceptance rate were said to be minimized drastically.</p>
<p>Yet another patch-based CNN model via user-disjoint and cross-factor protocols was designed in [<xref ref-type="bibr" rid="ref-18">18</xref>] for detecting face&#x2019;s representation in a continuous fashion to consider RECOD-MPAD and OULU-NPU dataset. A survey of numerous types and methods of authentication to specifically secure the smart phone access was proposed in [<xref ref-type="bibr" rid="ref-19">19</xref>]. Machine Learning techniques were introduced in [<xref ref-type="bibr" rid="ref-20">20</xref>] to preserve cyberspace attacks. Dissimilar machine learning (ML) techniques were developed in [<xref ref-type="bibr" rid="ref-21">21</xref>] to minimize the time complexity. Continuous authentication systems were developed in [<xref ref-type="bibr" rid="ref-22">22</xref>] for enhancing the security and privacy. A novel technique termed implicit imitation was introduced in [<xref ref-type="bibr" rid="ref-23">23</xref>] to accelerate reinforcement learning. Machine learning techniques were designed in [<xref ref-type="bibr" rid="ref-24">24</xref>] for identifying the several cyber threats. Reinforcement learning was investigated in [<xref ref-type="bibr" rid="ref-25">25</xref>] by using continuous control applications.</p>
<p>Based on the aforementioned materials and methods, in this work, Gaussian Weighted Cauchy Kriging-based Continuous Czekanowski&#x2019;s (GWCK-CC) for implicit continuous authentication on mobile devices is proposed. The detailed description of the proposed GWCK-CC method is presented in the following sections.</p>
</sec>
</sec>
<sec id="s3">
<label>3</label>
<title>Methodology</title>
<p>Conventional authentication method authenticates the validity of an entity or system analytically at the inception of the communication session and determines either it is authenticated or not. Hence, they are said to be susceptible to security menaces that take dominance of the active sessions involved. Hence, there necessitates an intense requirement to handle this issue continuously authenticating the identity of users in the course of the whole session. <xref ref-type="fig" rid="fig-1">Fig. 1</xref> given below shows the block diagram of Gaussian Weighted Cauchy Kriging-based Continuous Czekanowski&#x2019;s (GWCK-CC) method towards implicit continuous authentication for mobile devices.</p>
<fig id="fig-1">
<label>Figure 1</label>
<caption>
<title>Block diagram of Gaussian Weighted Cauchy Kriging-based Continuous Czekanowski&#x2019;s (GWCK-CC)</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CSSE_25672-fig-1.png"/>
</fig>
<p>In this work, GWCK-CC method is proposed to enhance the performance of implicit continuous user authentication. The proposed GWCK-CC method is split into three layers. They are input layer, three hidden layers and finally the output layer. First, face images acquired from UMDAA-02 Face Dataset [<xref ref-type="bibr" rid="ref-26">26</xref>] are provided as input to the input layer. Followed by which the input face images are transferred to the first hidden layer &#x2018;HL1&#x2019;. Preprocessing of continuous faces images using Gaussian Weighted Non-local Mean Filter is employed that in turn improves the face quality image. After that, the preprocessed output or the denoised continuous images is given to the second hidden layer &#x2018;HL2&#x2019; to perform feature extraction using Cauchy Kriging Regression. These continuous extracted feature results are sent to the third hidden layer &#x2018;HL3&#x2019;. With the continuous extracted features, input face images are classified using Continuous Czekanowski&#x2019;s Dice Index. Finally, the classified output results are generated in the output layer. <xref ref-type="fig" rid="fig-2">Fig. 2</xref> shows the structure of GWCK-CC.</p>
<fig id="fig-2">
<label>Figure 2</label>
<caption>
<title>Structure of GWCK-CC</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CSSE_25672-fig-2.png"/>
</fig>
<p>As shown in the above figure, the data collection module in the input layer acquires all users&#x2019; sensor data from UMDAA-02 Face Dataset [<xref ref-type="bibr" rid="ref-26">26</xref>] via twelve distinct sensors for implicit continuous authentication. In the proposed GWCK-CC method, the data collection module in the input layer gets the user&#x2019;s each single minute gesture during operation on their smart phones, and records the swift and instant readings of the twelve sensors when the screen is on. In the data collection phase, the data collection module captures users&#x2019; behavioral patterns with smart phone usage are constructed into smart phones by twelve sensors. The collected face data from mobile devices are stored in a secured buffer for data preprocessing.</p>
<sec id="s3_1">
<label>3.1</label>
<title>Gaussian Weighted Non-local Mean Filter Preprocessing Model</title>
<p>Sensor data collected from smart phones necessitates preprocessing phase for feasible handling of noise and temporal calibration for series inception. The targeted sensory data consist readings of twelve distinct sensors, which are front facing camera &#x2018;FFC&#x2019;, touch screen &#x2018;TS&#x2019;, gyroscope &#x2018;G&#x2019;, accelerometer &#x2018;A&#x2019;, magnetometer &#x2018;M&#x2019;, light sensor &#x2018;LS&#x2019;, GPS &#x2018;GPS&#x2019;, Bluetooth &#x2018;B&#x2019;, WiFi &#x2018;WiFi&#x2019;, proximity sensor &#x2018;ProS&#x2019;, temperature sensor &#x2018;TempS&#x2019; and pressure sensor &#x2018;PreS&#x2019; respectively. Let us denote the collected data reading as &#x2018;<inline-formula id="ieqn-1">
<mml:math id="mml-ieqn-1"><mml:msubsup><mml:mrow><mml:mi mathvariant="normal">P</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">i</mml:mi></mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi mathvariant="normal">t</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msubsup><mml:mo>&#x2208;</mml:mo><mml:msup><mml:mrow><mml:mi mathvariant="normal">R</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">d</mml:mi></mml:mrow></mml:msup></mml:math>
</inline-formula>&#x2019;, refers to collected pixel data &#x2018;P&#x2019; for user &#x2018;i&#x2019; at time &#x2018;t&#x2019; for a total dimension &#x2018;d&#x2009;&#x003D;&#x2009;12&#x2019; (i.e., from 23 distinct sensors). The pixel data reading over a period of time is then represented by a vector as given below.<disp-formula id="eqn-1"><label>(1)</label>
<mml:math id="mml-eqn-1" display="block"><mml:mrow><mml:mi mathvariant="normal">P</mml:mi><mml:mi mathvariant="normal">V</mml:mi></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mo fence="false" stretchy="false">{</mml:mo><mml:msub><mml:mrow><mml:mi mathvariant="normal">P</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="normal">F</mml:mi><mml:mi mathvariant="normal">F</mml:mi><mml:mi mathvariant="normal">C</mml:mi></mml:mrow></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:msub><mml:mrow><mml:mi mathvariant="normal">P</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="normal">T</mml:mi><mml:mi mathvariant="normal">S</mml:mi></mml:mrow></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:msub><mml:mrow><mml:mi mathvariant="normal">P</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">G</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:msub><mml:mrow><mml:mi mathvariant="normal">P</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">A</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:msub><mml:mrow><mml:mi mathvariant="normal">P</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">M</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:msub><mml:mrow><mml:mi mathvariant="normal">P</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="normal">L</mml:mi><mml:mi mathvariant="normal">S</mml:mi></mml:mrow></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:msub><mml:mrow><mml:mi mathvariant="normal">P</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="normal">G</mml:mi><mml:mi mathvariant="normal">P</mml:mi><mml:mi mathvariant="normal">S</mml:mi></mml:mrow></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:msub><mml:mrow><mml:mi mathvariant="normal">P</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">B</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:msub><mml:mrow><mml:mi mathvariant="normal">P</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="normal">W</mml:mi><mml:mi mathvariant="normal">i</mml:mi><mml:mi mathvariant="normal">F</mml:mi><mml:mi mathvariant="normal">i</mml:mi></mml:mrow></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:msub><mml:mrow><mml:mi mathvariant="normal">P</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="normal">P</mml:mi><mml:mi mathvariant="normal">r</mml:mi><mml:mi mathvariant="normal">o</mml:mi><mml:mi mathvariant="normal">S</mml:mi></mml:mrow></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:msub><mml:mrow><mml:mi mathvariant="normal">P</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="normal">T</mml:mi><mml:mi mathvariant="normal">e</mml:mi><mml:mi mathvariant="normal">m</mml:mi><mml:mi mathvariant="normal">p</mml:mi><mml:mi mathvariant="normal">S</mml:mi></mml:mrow></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:msub><mml:mrow><mml:mi mathvariant="normal">P</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="normal">P</mml:mi><mml:mi mathvariant="normal">r</mml:mi><mml:mi mathvariant="normal">e</mml:mi><mml:mi mathvariant="normal">S</mml:mi></mml:mrow></mml:mrow></mml:msub><mml:mo fence="false" stretchy="false">}</mml:mo></mml:mrow></mml:math>
</disp-formula></p>
<p>Next, with the acquired input images, preprocessing is performed in the first hidden layer by employing Gaussian Weighted Non-local Mean Filter model to improve the face quality images. The preprocessing model converts the collected time domain data for implicit continuous authentication into temporal stream of data that are used as inputs. <xref ref-type="fig" rid="fig-3">Fig. 3</xref> shows the structure of&#x2013;Gaussian Weighted Non-local Mean Filter model.</p>
<fig id="fig-3">
<label>Figure 3</label>
<caption>
<title>Structure of gaussian weighted non-local mean filter preprocessing</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CSSE_25672-fig-3.png"/>
</fig>
<p>As shown in the above figure, the basic principle of the Gaussian Weighted Non-local Mean Filter is to restore the noisy pixel gray-value data &#x2018;PD(i)&#x2019; of pixel data &#x2018;i&#x2019; with a weighted mean of the mean of pixel gray-values of all the pixels on the image. This is mathematically expressed as given below.<disp-formula id="eqn-2"><label>(2)</label>
<mml:math id="mml-eqn-2" display="block"><mml:mrow><mml:mi mathvariant="normal">P</mml:mi><mml:mi mathvariant="normal">D</mml:mi></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi mathvariant="normal">i</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:munder><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="normal">j</mml:mi></mml:mrow><mml:mo>&#x2208;</mml:mo><mml:mrow><mml:mi mathvariant="normal">S</mml:mi><mml:mi mathvariant="normal">W</mml:mi><mml:mi mathvariant="normal">S</mml:mi></mml:mrow></mml:mrow></mml:munder><mml:mo>&#x2061;</mml:mo><mml:msub><mml:mrow><mml:mi mathvariant="normal">W</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="normal">i</mml:mi><mml:mi mathvariant="normal">j</mml:mi></mml:mrow></mml:mrow></mml:msub><mml:mrow><mml:mi mathvariant="normal">P</mml:mi><mml:mi mathvariant="normal">D</mml:mi></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi mathvariant="normal">j</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:math>
</disp-formula></p>
<p>From the above <xref ref-type="disp-formula" rid="eqn-2">Eq. (2)</xref>, &#x2018;j&#x2009;&#x2208;&#x2009;SWS&#x2019; refers to the search window size (i.e., &#x2018;(2n&#x2009;&#x002B;&#x2009;1)&#x002A;(2n&#x2009;&#x002B;&#x2009;1)&#x2019;), with weight of two pixels &#x2018;i&#x2019; and &#x2018;j&#x2019; denoted as &#x2018;W<sub>ij</sub>&#x2019;. The weight is mathematically expressed as given below.<disp-formula id="eqn-3"><label>(3)</label>
<mml:math id="mml-eqn-3" display="block"><mml:msub><mml:mrow><mml:mi mathvariant="normal">W</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="normal">i</mml:mi><mml:mi mathvariant="normal">j</mml:mi></mml:mrow></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mn>1</mml:mn><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">Z</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">i</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mfrac></mml:mrow><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy="false">[</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="normal">V</mml:mi></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">N</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mi mathvariant="normal">V</mml:mi></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">N</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">j</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo stretchy="false">]</mml:mo></mml:mrow><mml:mn>2</mml:mn></mml:msup></mml:mrow><mml:mrow><mml:msup><mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x03B1;</mml:mi></mml:mrow></mml:mrow><mml:mn>2</mml:mn></mml:msup></mml:mrow></mml:mfrac></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy="false">[</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="normal">P</mml:mi></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">N</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mi mathvariant="normal">P</mml:mi></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">N</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">j</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo stretchy="false">]</mml:mo></mml:mrow><mml:mn>2</mml:mn></mml:msup></mml:mrow><mml:mrow><mml:msup><mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x03B2;</mml:mi></mml:mrow></mml:mrow><mml:mn>2</mml:mn></mml:msup></mml:mrow></mml:mfrac></mml:mrow></mml:mstyle></mml:mstyle></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:mstyle></mml:math>
</disp-formula></p>
<p>From the above <xref ref-type="disp-formula" rid="eqn-3">Eq. (3)</xref>, the weight function is represented as vector &#x2018;V&#x2019; of pixel gray-value data from the neighborhood &#x2018;N<sub>i</sub>&#x2019; centered at &#x2018;i&#x2019; with probability pixel gray-value data from the neighborhood &#x2018;P(N<sub>i</sub>)&#x2019; along with two filtering parameters &#x2018;&#x03B1;&#x2019;, &#x2018;&#x03B2;&#x2019; with respect to normalizing term &#x2018;Z<sub>i</sub>&#x2019;. The first filtering parameter &#x2018;&#x03B1;&#x2019; determines the non-local means averaging weight, the value of which is chosen within &#x2018;<inline-formula id="ieqn-2">
<mml:math id="mml-ieqn-2"><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mn>0.75</mml:mn><mml:mrow><mml:mspace width="thickmathspace" /><mml:mi mathvariant="normal">t</mml:mi><mml:mi mathvariant="normal">o</mml:mi><mml:mspace width="thickmathspace" /></mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:math>
</inline-formula>&#x2019; for high visual quality. The second filtering parameter &#x2018;&#x03B2;&#x2019; determines the level of and is assigned to be between &#x2018;<inline-formula id="ieqn-3">
<mml:math id="mml-ieqn-3"><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mn>50</mml:mn><mml:mrow><mml:mspace width="thickmathspace" /><mml:mi mathvariant="normal">t</mml:mi><mml:mi mathvariant="normal">o</mml:mi><mml:mspace width="thickmathspace" /></mml:mrow><mml:mn>100</mml:mn></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:math>
</inline-formula>&#x2019; that provides a fine-grained balance between background leveling and pixel enhancement in denoised images.</p>
<p>The first term &#x2018;<inline-formula id="ieqn-4">
<mml:math id="mml-ieqn-4"><mml:mrow><mml:mfrac><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy="false">[</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="normal">V</mml:mi></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">N</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mi mathvariant="normal">V</mml:mi></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">N</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">j</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo stretchy="false">]</mml:mo></mml:mrow><mml:mn>2</mml:mn></mml:msup></mml:mrow><mml:mrow><mml:msup><mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x03B1;</mml:mi></mml:mrow></mml:mrow><mml:mn>2</mml:mn></mml:msup></mml:mrow></mml:mfrac></mml:mrow></mml:math>
</inline-formula>&#x2019; hence refers to the Euclidean distance of pixel gray-value data between two neighborhoods &#x2018;N<sub>i</sub>&#x2019; and &#x2018;N<sub>j</sub>&#x2019; within the searching window &#x2018;SW&#x2019;. In a similar manner, the second term refers to the Euclidean distance of pixel gray-value data probabilities between two same neighborhoods &#x2018;N<sub>i</sub>&#x2019; and &#x2018;N<sub>j</sub>&#x2019; acquired from the probability image. With this the preprocessed data is acquired that in turn improve the quality of face image for further processing.</p>
</sec>
<sec id="s3_2">
<label>3.2</label>
<title>Cauchy Kriging Regression Feature Extraction Model</title>
<p>In our work, feature extraction is performed with the purpose of dimensionality reduction. The preprocessed set of data is reduced to more manageable groups for further processing. With this, the new set of extracted features possesses distinct values upon comparison with the original preprocessed feature values. In our work, Cauchy Kriging Regression Feature Extraction is employed to extract the pertinent features for performing continuous authentication with lesser the error rate. <xref ref-type="fig" rid="fig-4">Fig. 4</xref> given below shows the structure of Cauchy Kriging Regression Feature Extraction model.</p>
<fig id="fig-4">
<label>Figure 4</label>
<caption>
<title>Structure of cauchy kriging regression feature extraction</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CSSE_25672-fig-4.png"/>
</fig>
<p>As shown in the above figure, let us consider the preprocessed sampling images or the denoised continuous images &#x2018;<inline-formula id="ieqn-5">
<mml:math id="mml-ieqn-5"><mml:mrow><mml:mi mathvariant="normal">S</mml:mi><mml:mi mathvariant="normal">I</mml:mi></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mi mathvariant="normal">S</mml:mi></mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">I</mml:mi></mml:mrow><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mrow><mml:mspace width="thickmathspace" /><mml:mi mathvariant="normal">S</mml:mi></mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">I</mml:mi></mml:mrow><mml:mn>2</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mrow><mml:mi mathvariant="normal">S</mml:mi></mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">I</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">n</mml:mi></mml:mrow></mml:msub></mml:math>
</inline-formula>&#x2019; as input for extracting the pertinent features. Then, the denoised continuous sampling images obtained at different time interval are mathematically formulated as given below.<disp-formula id="eqn-4"><label>(4)</label>
<mml:math id="mml-eqn-4" display="block"><mml:mrow><mml:mi mathvariant="normal">S</mml:mi></mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">I</mml:mi></mml:mrow><mml:mn>1</mml:mn></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mo fence="false" stretchy="false">{</mml:mo><mml:msub><mml:mrow><mml:mi mathvariant="normal">a</mml:mi></mml:mrow><mml:mrow><mml:mn>11</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:msub><mml:mrow><mml:mi mathvariant="normal">a</mml:mi></mml:mrow><mml:mrow><mml:mn>12</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:msub><mml:mrow><mml:mi mathvariant="normal">a</mml:mi></mml:mrow><mml:mrow><mml:mn>13</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:msub><mml:mrow><mml:mi mathvariant="normal">a</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn><mml:mrow><mml:mi mathvariant="normal">n</mml:mi></mml:mrow></mml:mrow></mml:msub><mml:mo fence="false" stretchy="false">}</mml:mo></mml:mrow><mml:mo>;</mml:mo><mml:mspace width="thickmathspace" /><mml:mrow><mml:mspace width="thickmathspace" /><mml:mi mathvariant="normal">S</mml:mi></mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">I</mml:mi></mml:mrow><mml:mn>2</mml:mn></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mo fence="false" stretchy="false">{</mml:mo><mml:msub><mml:mrow><mml:mi mathvariant="normal">a</mml:mi></mml:mrow><mml:mrow><mml:mn>21</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:msub><mml:mrow><mml:mi mathvariant="normal">a</mml:mi></mml:mrow><mml:mrow><mml:mn>22</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:msub><mml:mrow><mml:mi mathvariant="normal">a</mml:mi></mml:mrow><mml:mrow><mml:mn>23</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:msub><mml:mrow><mml:mi mathvariant="normal">a</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn><mml:mrow><mml:mi mathvariant="normal">n</mml:mi></mml:mrow></mml:mrow></mml:msub><mml:mo fence="false" stretchy="false">}</mml:mo></mml:mrow><mml:mo>&#x2026;</mml:mo><mml:mo>;</mml:mo><mml:mspace width="thickmathspace" /><mml:mrow><mml:mspace width="thickmathspace" /><mml:mi mathvariant="normal">S</mml:mi></mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">I</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">m</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mo fence="false" stretchy="false">{</mml:mo><mml:msub><mml:mrow><mml:mi mathvariant="normal">a</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="normal">m</mml:mi></mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:msub><mml:mrow><mml:mi mathvariant="normal">a</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="normal">m</mml:mi></mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:msub><mml:mrow><mml:mi mathvariant="normal">a</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="normal">m</mml:mi></mml:mrow><mml:mn>3</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:msub><mml:mrow><mml:mi mathvariant="normal">a</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="normal">m</mml:mi><mml:mi mathvariant="normal">n</mml:mi></mml:mrow></mml:mrow></mml:msub><mml:mo fence="false" stretchy="false">}</mml:mo></mml:mrow></mml:math>
</disp-formula></p>
<p>The above distinct preprocessed denoised continuous sample images as input for reducing the error rate. Regression Kriging &#x2018;Z(SI)&#x2019; modeled as sum of deterministic sample image &#x2018;Det(SI)&#x2019; and stochastic sample image &#x2018;Stoc(SI)&#x2019; is formulated as given below.<disp-formula id="eqn-5"><label>(5)</label>
<mml:math id="mml-eqn-5" display="block"><mml:mrow><mml:mi mathvariant="normal">Z</mml:mi></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="normal">S</mml:mi><mml:mi mathvariant="normal">I</mml:mi></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mrow><mml:mi mathvariant="normal">D</mml:mi><mml:mi mathvariant="normal">e</mml:mi><mml:mi mathvariant="normal">t</mml:mi></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="normal">S</mml:mi><mml:mi mathvariant="normal">I</mml:mi></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:mrow><mml:mi mathvariant="normal">S</mml:mi><mml:mi mathvariant="normal">t</mml:mi><mml:mi mathvariant="normal">o</mml:mi><mml:mi mathvariant="normal">c</mml:mi></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="normal">S</mml:mi><mml:mi mathvariant="normal">I</mml:mi></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:math>
</disp-formula></p>
<p>From the above <xref ref-type="disp-formula" rid="eqn-5">Eq. (5)</xref>, both deterministic and stochastic sample images are employed for regression owing to the reason that while performing continuous authentication, both inherent randomness and deterministic. Next, by combining the deterministic and stochastic sample images, the features to be extracted are formulated as given below.<disp-formula id="eqn-6"><label>(6)</label>
<mml:math id="mml-eqn-6" display="block"><mml:mrow><mml:mi mathvariant="normal">S</mml:mi><mml:mi mathvariant="normal">I</mml:mi></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="normal">F</mml:mi><mml:mi mathvariant="normal">E</mml:mi></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:munderover><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="normal">i</mml:mi></mml:mrow><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi mathvariant="normal">m</mml:mi></mml:mrow></mml:munderover><mml:mo>&#x2061;</mml:mo><mml:msub><mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x03B3;</mml:mi></mml:mrow></mml:mrow><mml:mrow><mml:mi mathvariant="normal">i</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mi mathvariant="normal">f</mml:mi></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="normal">S</mml:mi></mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">I</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">i</mml:mi></mml:mrow></mml:msub><mml:mo>;</mml:mo><mml:mspace width="thickmathspace" /><mml:mrow><mml:mi mathvariant="normal">S</mml:mi></mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">I</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">j</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mrow><mml:mi mathvariant="normal">S</mml:mi><mml:mi mathvariant="normal">P</mml:mi></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:munderover><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="normal">j</mml:mi></mml:mrow><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi mathvariant="normal">n</mml:mi></mml:mrow></mml:munderover><mml:mo>&#x2061;</mml:mo><mml:msub><mml:mi>&#x03BB;</mml:mi><mml:mrow><mml:mi mathvariant="normal">j</mml:mi></mml:mrow></mml:msub><mml:mo>.</mml:mo><mml:mrow><mml:mi mathvariant="normal">R</mml:mi><mml:mi mathvariant="normal">e</mml:mi><mml:mi mathvariant="normal">s</mml:mi></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="normal">S</mml:mi></mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">I</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:math>
</disp-formula><disp-formula id="eqn-7"><label>(7)</label>
<mml:math id="mml-eqn-7" display="block"><mml:mrow><mml:mi mathvariant="normal">f</mml:mi></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="normal">S</mml:mi></mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">I</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">i</mml:mi></mml:mrow></mml:msub><mml:mo>;</mml:mo><mml:mspace width="thickmathspace" /><mml:mrow><mml:mi mathvariant="normal">S</mml:mi></mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">I</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">j</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mrow><mml:mi mathvariant="normal">S</mml:mi><mml:mi mathvariant="normal">P</mml:mi></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mn>1</mml:mn><mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x03C0;</mml:mi></mml:mrow><mml:mi mathvariant="normal">S</mml:mi><mml:mi mathvariant="normal">P</mml:mi><mml:mspace width="thickmathspace" /></mml:mrow><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>+</mml:mo><mml:msup><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mrow><mml:mrow><mml:mi mathvariant="normal">S</mml:mi></mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">I</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mi mathvariant="normal">S</mml:mi></mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">I</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">j</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="normal">S</mml:mi><mml:mi mathvariant="normal">P</mml:mi></mml:mrow></mml:mrow></mml:mfrac></mml:mrow></mml:mstyle></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mn>2</mml:mn></mml:msup></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:mrow></mml:mfrac></mml:mrow><mml:mo>=</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mn>1</mml:mn><mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x03C0;</mml:mi></mml:mrow></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="normal">S</mml:mi><mml:mi mathvariant="normal">P</mml:mi></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mfrac></mml:mrow><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mrow><mml:mrow><mml:mi mathvariant="normal">S</mml:mi></mml:mrow><mml:msup><mml:mrow><mml:mi mathvariant="normal">P</mml:mi></mml:mrow><mml:mn>2</mml:mn></mml:msup></mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="normal">S</mml:mi></mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">I</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mi mathvariant="normal">S</mml:mi></mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">I</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">j</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:mrow><mml:mi mathvariant="normal">S</mml:mi></mml:mrow><mml:msup><mml:mrow><mml:mi mathvariant="normal">P</mml:mi></mml:mrow><mml:mn>2</mml:mn></mml:msup></mml:mrow></mml:mfrac></mml:mrow></mml:mstyle></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:mstyle></mml:mstyle></mml:math>
</disp-formula></p>
<p>From the above <xref ref-type="disp-formula" rid="eqn-6">Eqs. (6)</xref> and <xref ref-type="disp-formula" rid="eqn-7">(7)</xref>, the features to be extracted from the sampled preprocessed images &#x2018;SI(FE)&#x2019; are obtained based on the deterministic coefficient &#x2018;&#x03B3;<sub>i</sub>&#x2019;, stochastic kriging weights &#x2018;&#x03BB;<sub>j</sub>&#x2019;, residual &#x2018;Res&#x2019; at &#x2018;SI<sub>i</sub>&#x2019; and finally, Cauchy distribution function &#x2018;f(SI<sub>i</sub>; SI<sub>j</sub>, SP)&#x2019; respectively. The Cauchy distribution function results are obtained according to the scaling parameters &#x2018;SP&#x2019; with which the orientation of the sampled preprocessed images &#x2018;SI<sub>i</sub>&#x2019; and &#x2018;SI<sub>j</sub>&#x2019; are made. Finally, the corresponding response is mathematically formulated as given below.<disp-formula id="eqn-8"><label>(8)</label>
<mml:math id="mml-eqn-8" display="block"><mml:mtable columnalign="right left" rowspacing=".5em" columnspacing="thickmathspace" displaystyle="true"><mml:mtr><mml:mtd /><mml:mtd><mml:mrow><mml:mi mathvariant="normal">P</mml:mi></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mi mathvariant="normal">S</mml:mi><mml:mi mathvariant="normal">I</mml:mi></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="normal">F</mml:mi><mml:mi mathvariant="normal">E</mml:mi></mml:mrow><mml:mo stretchy="false">[</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">b</mml:mi></mml:mrow><mml:mn>1</mml:mn></mml:msub></mml:mrow><mml:mo stretchy="false">]</mml:mo></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mo fence="false" stretchy="false">{</mml:mo><mml:mrow><mml:mrow><mml:msubsup><mml:mrow><mml:mi mathvariant="normal">b</mml:mi></mml:mrow><mml:mn>1</mml:mn><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msubsup><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:msubsup><mml:mrow><mml:mspace width="thickmathspace" /><mml:mi mathvariant="normal">b</mml:mi></mml:mrow><mml:mn>1</mml:mn><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mn>2</mml:mn><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msubsup><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:msubsup><mml:mrow><mml:mspace width="thickmathspace" /><mml:mi mathvariant="normal">b</mml:mi></mml:mrow><mml:mn>1</mml:mn><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mn>3</mml:mn><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msubsup><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:msubsup><mml:mrow><mml:mi mathvariant="normal">b</mml:mi></mml:mrow><mml:mn>1</mml:mn><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi mathvariant="normal">n</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msubsup></mml:mrow><mml:mo fence="false" stretchy="false">}</mml:mo></mml:mrow><mml:mo>;</mml:mo><mml:mspace width="thickmathspace" /><mml:mrow><mml:mspace width="thickmathspace" /><mml:mi mathvariant="normal">S</mml:mi><mml:mi mathvariant="normal">I</mml:mi></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="normal">F</mml:mi><mml:mi mathvariant="normal">E</mml:mi></mml:mrow><mml:mo stretchy="false">[</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">b</mml:mi></mml:mrow><mml:mn>2</mml:mn></mml:msub></mml:mrow><mml:mo stretchy="false">]</mml:mo></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd /><mml:mtd><mml:mo fence="false" stretchy="false">{</mml:mo><mml:mrow><mml:mrow><mml:msubsup><mml:mrow><mml:mi mathvariant="normal">b</mml:mi></mml:mrow><mml:mn>2</mml:mn><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msubsup><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:msubsup><mml:mrow><mml:mspace width="thickmathspace" /><mml:mi mathvariant="normal">b</mml:mi></mml:mrow><mml:mn>2</mml:mn><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mn>2</mml:mn><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msubsup><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:msubsup><mml:mrow><mml:mspace width="thickmathspace" /><mml:mi mathvariant="normal">b</mml:mi></mml:mrow><mml:mn>2</mml:mn><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mn>3</mml:mn><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msubsup><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:msubsup><mml:mrow><mml:mi mathvariant="normal">b</mml:mi></mml:mrow><mml:mn>2</mml:mn><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi mathvariant="normal">n</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msubsup></mml:mrow><mml:mo fence="false" stretchy="false">}</mml:mo></mml:mrow><mml:mo>;</mml:mo><mml:mspace width="thickmathspace" /><mml:mo>&#x2026;</mml:mo><mml:mo>;</mml:mo><mml:mspace width="thickmathspace" /><mml:mrow><mml:mi mathvariant="normal">S</mml:mi><mml:mi mathvariant="normal">I</mml:mi></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="normal">F</mml:mi><mml:mi mathvariant="normal">E</mml:mi></mml:mrow><mml:mo stretchy="false">[</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">b</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">m</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">]</mml:mo></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mo fence="false" stretchy="false">{</mml:mo><mml:mrow><mml:msubsup><mml:mrow><mml:mi mathvariant="normal">b</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">m</mml:mi></mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msubsup><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:msubsup><mml:mrow><mml:mspace width="thickmathspace" /><mml:mi mathvariant="normal">b</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">m</mml:mi></mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mn>2</mml:mn><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msubsup><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:msubsup><mml:mrow><mml:mspace width="thickmathspace" /><mml:mi mathvariant="normal">b</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">m</mml:mi></mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mn>3</mml:mn><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msubsup><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:msubsup><mml:mrow><mml:mi mathvariant="normal">b</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">m</mml:mi></mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi mathvariant="normal">n</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msubsup></mml:mrow><mml:mo fence="false" stretchy="false">}</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:math>
</disp-formula></p>
<p>From the above <xref ref-type="disp-formula" rid="eqn-8">Eq. (8)</xref>, finally, the extracted features of face images at different time intervals or implicit continuous extracted image is obtained. With the corresponding continuous response as in &#x2018;SI(FE[b])&#x2019;, the error rate with which the classification can be made is improved. This is owing to the reason that by employing the Cauchy distribution function the scale parameter &#x2018;SP&#x2019; obtains different orientation of the preprocessed sample images, contributing to minimum error rate.</p>
</sec>
<sec id="s3_3">
<label>3.3</label>
<title>Continuous Czekanowski&#x2019;s Classification Model</title>
<p>With the extracted continuous features, classification between genuine and attackers are made by means of Continuous Czekanowski&#x2019;s Classification model. Then, the Continuous Czekanowski&#x2019;s Classification for continuous face recognition is mathematically expressed as given below.<disp-formula id="eqn-9"><label>(9)</label>
<mml:math id="mml-eqn-9" display="block"><mml:mrow><mml:mi mathvariant="normal">C</mml:mi><mml:mi mathvariant="normal">C</mml:mi><mml:mi mathvariant="normal">C</mml:mi></mml:mrow><mml:mo>=</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mrow><mml:mn>2</mml:mn><mml:mo fence="false" stretchy="false">|</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="normal">P</mml:mi><mml:mspace width="thickmathspace" /></mml:mrow><mml:mrow><mml:mo>&#x2229;</mml:mo></mml:mrow><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mi mathvariant="normal">Q</mml:mi></mml:mrow></mml:mrow><mml:mo fence="false" stretchy="false">|</mml:mo></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="normal">R</mml:mi></mml:mrow><mml:mo fence="false" stretchy="false">|</mml:mo><mml:mrow><mml:mi mathvariant="normal">P</mml:mi></mml:mrow><mml:mo fence="false" stretchy="false">|</mml:mo><mml:mo>+</mml:mo><mml:mo fence="false" stretchy="false">|</mml:mo><mml:mrow><mml:mi mathvariant="normal">Q</mml:mi></mml:mrow><mml:mo fence="false" stretchy="false">|</mml:mo></mml:mrow></mml:mfrac></mml:mrow></mml:mstyle></mml:math>
</disp-formula></p>
<p>From the above <xref ref-type="disp-formula" rid="eqn-9">Eq. (9)</xref>, the Continuous Czekanowski&#x2019;s Classification &#x2018;CCC&#x2019; results are arrived at based on the ground truth image &#x2018;Q&#x2019; and the computed continuous extracted image &#x2018;P&#x2019; respectively. In addition, &#x2018;R&#x2019; defines the mean value of &#x2018;P&#x2019; over the pixels where both &#x2018;P&#x2019; and &#x2018;Q&#x2019; are positive and mathematically formulated as given below.<disp-formula id="eqn-10"><label>(10)</label>
<mml:math id="mml-eqn-10" display="block"><mml:mrow><mml:mi mathvariant="normal">R</mml:mi></mml:mrow><mml:mo>=</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mrow><mml:msub><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mi mathvariant="normal">i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2061;</mml:mo><mml:msub><mml:mrow><mml:mi mathvariant="normal">p</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">i</mml:mi></mml:mrow></mml:msub><mml:msub><mml:mrow><mml:mi mathvariant="normal">q</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mi mathvariant="normal">i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2061;</mml:mo><mml:msub><mml:mrow><mml:mi mathvariant="normal">p</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">i</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mi mathvariant="normal">S</mml:mi><mml:mi mathvariant="normal">i</mml:mi><mml:mi mathvariant="normal">g</mml:mi><mml:mi mathvariant="normal">n</mml:mi></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">q</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mfrac></mml:mrow></mml:mstyle></mml:math>
</disp-formula></p>
<p>With the above classified results, face recognition is ensured therefore paving mechanisms for implicit continuous user authentication with maximum sensitivity and specificity. The pseudo code representation of Gaussian Weighted Cauchy Kriging Continuous Czekanowski&#x2019;s-based implicit continuous authentication is given below.</p>
<p>As given in the objective of Gaussian Weighted Cauchy Kriging Continuous Czekanowski&#x2019;s-based implicit continuous authentication algorithm is to ensure the accurate face recognition with minimum time and error rate. With this objective deep reinforcement learning is designed with one input layer, three hidden layers and one output layer. Raw continuous face input images obtained from the UMDAA-02 Face Dataset [<xref ref-type="bibr" rid="ref-26">26</xref>] is obtained as input. Next, preprocessing on the raw continuous face input images are performed by non-local mean function. Followed by, which the essential and pertinent continuous feature is extracted by employing Cauchy kriging function. Next, the continuous extracted features are utilized for classification. Continuous Czekanowski&#x2019;s function is applied for validation. The results of continuous Czekanowski&#x2019;s function are given to the output layer for providing final classification results via activation function. If the activation function provides output &#x2018;1&#x2019;, then the user is genuine user. On the other hand, if the activation function provides the output as &#x2018;0&#x2019;, the user is attacker or intruder and thus the phone goes to the locked state. In this way, implicit continuous user authentication is achieved with maximum accuracy.</p>
<fig id="fig-7">
<graphic mimetype="image" mime-subtype="png" xlink:href="CSSE_25672-fig-7.png"/>
</fig>
</sec>
</sec>
<sec id="s4">
<label>4</label>
<title>Experimental Setup</title>
<p>Simulation analysis of proposed Gaussian Weighted Cauchy Kriging-based Continuous Czekanowski&#x2019;s (GWCK-CC) is implemented in MATLAB simulator. The results are analyzed using the UMDAA-02 Face Dataset (UMDAA-02-FD). The UMDAA-02-FD dataset includes number of front-facing camera images. The dataset is used for face Detection and verification tasks. The results of GWCK-CC method is compared with the existing Gait-based Continuous authentication (GaitCode) [<xref ref-type="bibr" rid="ref-1">1</xref>], Extremal Openset Rejection (EOR) [<xref ref-type="bibr" rid="ref-2">2</xref>], and Existing Continuous Dice Coefficient. The performance metrics used for analyzing the implicit continuous authentication process is user authentication accuracy, user authentication time, error rate, sensitivity and specificity with respect to different face images.</p>
</sec>
<sec id="s5">
<label>5</label>
<title>Discussion</title>
<p>Comparative analysis of implicit continuous authentication of mobile devices is performed using Gaussian Weighted Cauchy Kriging-based Continuous Czekanowski&#x2019;s (GWCK-CC) and compared with two different methods Gait-based Continuous authentication (GaitCode) [<xref ref-type="bibr" rid="ref-1">1</xref>], Extremal Openset Rejection (EOR) [<xref ref-type="bibr" rid="ref-2">2</xref>], and Existing Continuous Dice Coefficient. Performance analysis is made with five distinct parameters namely user authentication accuracy, user authentication time, error rate, sensitivity and specificity for different numbers of face images.</p>
<sec id="s5_1">
<label>5.1</label>
<title>Performance Analysis of User Authentication Accuracy</title>
<p>The first and foremost parameter of significance for implicit continuous authentication is the user authentication accuracy. Higher the user authentication accuracy, higher the validation performance for mobile devices and therefore efficient the method is said to be. The user authentication accuracy is mathematically formulated as given below.<disp-formula id="eqn-11"><label>(11)</label>
<mml:math id="mml-eqn-11" display="block"><mml:mrow><mml:mi mathvariant="normal">U</mml:mi><mml:mi mathvariant="normal">S</mml:mi><mml:mi mathvariant="normal">A</mml:mi></mml:mrow><mml:mo>=</mml:mo><mml:munderover><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="normal">i</mml:mi></mml:mrow><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi mathvariant="normal">n</mml:mi></mml:mrow></mml:munderover><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mrow><mml:mrow><mml:mi mathvariant="normal">S</mml:mi></mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">I</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="normal">C</mml:mi><mml:mi mathvariant="normal">A</mml:mi></mml:mrow></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="normal">S</mml:mi></mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">I</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">i</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mfrac></mml:mrow></mml:mstyle></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mtext>&#xA0;</mml:mtext><mml:mrow><mml:mo>&#x2217;</mml:mo></mml:mrow><mml:mtext>&#xA0;</mml:mtext><mml:mn>100</mml:mn></mml:math>
</disp-formula></p>
<p>From the above <xref ref-type="disp-formula" rid="eqn-11">Eq. (11)</xref>, the user authentication accuracy &#x2018;USA&#x2019; is measured based on the sample face images correctly authenticated &#x2018;SI<sub>CA</sub>&#x2019; to the sample images involved in the simulation process &#x2018;SI<sub>i</sub>&#x2019; of implicit continuous authentication for mobile devices. <xref ref-type="table" rid="table-1">Tab. 1</xref> given below provides the tabulation results for user authentication accuracy using four different methods, GWCK-CC, existing GaitCode [<xref ref-type="bibr" rid="ref-1">1</xref>], EOR [<xref ref-type="bibr" rid="ref-2">2</xref>], and Existing Continuous Dice Coefficient.</p>
<table-wrap id="table-1"><label>Table 1</label>
<caption>
<title>Tabulation for user authentication accuracy</title></caption>
<table><colgroup><col align="left"/><col align="left"/><col align="left"/><col align="left"/><col align="left"/>
</colgroup>
<thead>
<tr>
<th align="left" rowspan="2">Face images</th>
<th align="center" colspan="4">User authentication accuracy (&#x0025;)</th>
</tr>
<tr>
<th align="left">GWCK-CC</th>
<th align="left">GaitCode</th>
<th align="left">EOR</th>
<th align="left">Existing continuous dice coefficient</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left">500</td>
<td align="left">97</td>
<td align="left">95</td>
<td align="left">92</td>
<td align="left">90</td>
</tr>
<tr>
<td align="left">1000</td>
<td align="left">96.35</td>
<td align="left">94.15</td>
<td align="left">92.15</td>
<td align="left">89.55</td>
</tr>
<tr>
<td align="left">1500</td>
<td align="left">96</td>
<td align="left">94</td>
<td align="left">90</td>
<td align="left">88</td>
</tr>
<tr>
<td align="left">2000</td>
<td align="left">95.25</td>
<td align="left">93.55</td>
<td align="left">88.15</td>
<td align="left">86</td>
</tr>
<tr>
<td align="left">2500</td>
<td align="left">94.25</td>
<td align="left">91.25</td>
<td align="left">86.35</td>
<td align="left">84.15</td>
</tr>
<tr>
<td align="left">3000</td>
<td align="left">94</td>
<td align="left">90</td>
<td align="left">85</td>
<td align="left">83</td>
</tr>
<tr>
<td align="left">3500</td>
<td align="left">93.15</td>
<td align="left">89.15</td>
<td align="left">84.15</td>
<td align="left">82.45</td>
</tr>
<tr>
<td align="left">4000</td>
<td align="left">93</td>
<td align="left">88.35</td>
<td align="left">84</td>
<td align="left">80</td>
</tr>
<tr>
<td align="left">4500</td>
<td align="left">92.55</td>
<td align="left">88</td>
<td align="left">81.55</td>
<td align="left">79.15</td>
</tr>
<tr>
<td align="left">5000</td>
<td align="left">92</td>
<td align="left">81</td>
<td align="left">78</td>
<td align="left">77</td>
</tr>
</tbody>
</table>
</table-wrap>
<p><xref ref-type="table" rid="table-1">Tab. 1</xref> shows the user authentication accuracy results of 5000 different face images acquired from different users at different time for simulation. From the above table it is inferred that the user authentication accuracy is inversely proportional to the different face images provided as input. In other words, increasing the face images results in the increase in the number of faces acquired from single users at a session and also increases in the stack value, therefore reducing a significant amount of correct authentication of face images. However, with simulations conducted for 500 face images, 485, 475, 460 and 450 faces were correctly authenticated using GWCK-CC, [<xref ref-type="bibr" rid="ref-1">1</xref>,<xref ref-type="bibr" rid="ref-2">2</xref>] and Existing Continuous Dice Coefficient. With this the user authentication accuracy using the four methods were observed to be 97&#x0025;, 95&#x0025;, 92&#x0025;, and 90&#x0025; respectively, therefore increasing the user authentication accuracy using GWCK-CC. The reason for that improvement is to apply GWCK-CC. The preprocessing is employed to separate the face area from the background segment. The process of preprocessing here starts by extracting pertinent features that differentiate between same faces acquired at different time intervals of continuous face images from the aligned face which is generated from the preprocessing stage. As a result, the user authentication accuracy is improved using GWCK-CC method by 4&#x0025;, 10&#x0025;, and 13&#x0025; as compared to [<xref ref-type="bibr" rid="ref-1">1</xref>,<xref ref-type="bibr" rid="ref-2">2</xref>], and Existing Continuous Dice Coefficient respectively.</p>
</sec>
<sec id="s5_2">
<label>5.2</label>
<title>Performance Analysis of User Authentication Time</title>
<p>The second parameter of significance is the time consumed in authentication the user or the respective sample face images-based implicit continuous authentication for mobile devices. Lower the user authentication time is sooner the user or the particular sample face images are said to be validated and accordingly authenticated is performed. With minimum time consumed in the overall process, the genuineness of the user is measured at the initial stage itself. The user authentication time is mathematically formulated as given below.<disp-formula id="eqn-12"><label>(12)</label>
<mml:math id="mml-eqn-12" display="block"><mml:mrow><mml:mi mathvariant="normal">U</mml:mi><mml:mi mathvariant="normal">A</mml:mi><mml:mi mathvariant="normal">T</mml:mi></mml:mrow><mml:mo>=</mml:mo><mml:munderover><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="normal">i</mml:mi></mml:mrow><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi mathvariant="normal">n</mml:mi></mml:mrow></mml:munderover><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mi mathvariant="normal">S</mml:mi></mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">I</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">i</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>&#x2217;</mml:mo><mml:mi mathvariant="normal">T</mml:mi><mml:mi mathvariant="normal">i</mml:mi><mml:mi mathvariant="normal">m</mml:mi><mml:mi mathvariant="normal">e</mml:mi><mml:mspace width="thickmathspace" /></mml:mrow><mml:mo stretchy="false">[</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="normal">A</mml:mi><mml:mi mathvariant="normal">U</mml:mi><mml:mi mathvariant="normal">T</mml:mi><mml:mi mathvariant="normal">H</mml:mi><mml:mi mathvariant="normal">E</mml:mi><mml:mi mathvariant="normal">N</mml:mi><mml:mi mathvariant="normal">T</mml:mi><mml:mi mathvariant="normal">I</mml:mi><mml:mi mathvariant="normal">C</mml:mi><mml:mi mathvariant="normal">A</mml:mi><mml:mi mathvariant="normal">T</mml:mi><mml:mi mathvariant="normal">I</mml:mi><mml:mi mathvariant="normal">O</mml:mi><mml:mi mathvariant="normal">N</mml:mi></mml:mrow></mml:mrow><mml:mo stretchy="false">]</mml:mo></mml:math>
</disp-formula></p>
<p>From the above <xref ref-type="disp-formula" rid="eqn-12">Eq. (12)</xref>, the user authentication time &#x2018;UAT&#x2019; is measured based on the sample face images provided as input &#x2018;SI<sub>i</sub>&#x2019; and the time consumed in performing the actual authentication process &#x2018;<inline-formula id="ieqn-6">
<mml:math id="mml-ieqn-6"><mml:mrow><mml:mi mathvariant="normal">T</mml:mi><mml:mi mathvariant="normal">i</mml:mi><mml:mi mathvariant="normal">m</mml:mi><mml:mi mathvariant="normal">e</mml:mi><mml:mspace width="thickmathspace" /></mml:mrow><mml:mo stretchy="false">[</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="normal">A</mml:mi><mml:mi mathvariant="normal">U</mml:mi><mml:mi mathvariant="normal">T</mml:mi><mml:mi mathvariant="normal">H</mml:mi><mml:mi mathvariant="normal">E</mml:mi><mml:mi mathvariant="normal">N</mml:mi><mml:mi mathvariant="normal">T</mml:mi><mml:mi mathvariant="normal">I</mml:mi><mml:mi mathvariant="normal">C</mml:mi><mml:mi mathvariant="normal">A</mml:mi><mml:mi mathvariant="normal">T</mml:mi><mml:mi mathvariant="normal">I</mml:mi><mml:mi mathvariant="normal">O</mml:mi><mml:mi mathvariant="normal">N</mml:mi></mml:mrow></mml:mrow><mml:mo stretchy="false">]</mml:mo></mml:math>
</inline-formula>&#x2019;. It is measured in terms of milliseconds (ms). <xref ref-type="fig" rid="fig-5">Fig. 5</xref> given below provides the tabulation results for user authentication time using four different methods, GWCK-CC, existing GaitCode [<xref ref-type="bibr" rid="ref-1">1</xref>], EOR [<xref ref-type="bibr" rid="ref-2">2</xref>], and Existing Continuous Dice Coefficient.</p>
<fig id="fig-5">
<label>Figure 5</label>
<caption>
<title>Graphical representation of user authentication time</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CSSE_25672-fig-5.png"/>
</fig>
<p><xref ref-type="fig" rid="fig-5">Fig. 5</xref> given above illustrates the user authentication time for performing implicit continuous authentication process. Here, x axis refers to the number of face images provided as input in the input layer and y axis refers to the user authentication time. From the above figure it is inferred that an increase in the number of face images results in the increase in the user authentication time. In other words increasing the face images causes increase in the number of continuous face images for a specific user for the corresponding session therefore causes significant increase in the user authentication time also. However, simulations conducted with 500 face images consumed 0.072&#x2005;ms for predicting single face image data using GWCK-CC, 0.09&#x2005;ms using [<xref ref-type="bibr" rid="ref-1">1</xref>], 0.104&#x2005;ms using [<xref ref-type="bibr" rid="ref-2">2</xref>], and 0.120&#x2005;ms using Existing Continuous Dice Coefficient. With this, the overall user authentication time using the four methods was observed to be 36, 45&#x2005;ms [<xref ref-type="bibr" rid="ref-1">1</xref>], 52&#x2005;ms [<xref ref-type="bibr" rid="ref-2">2</xref>] and 60&#x2005;ms Existing Continuous Dice Coefficient respectively. From the simulation results, the user authentication time using GWCK-CC was comparatively lesser than [<xref ref-type="bibr" rid="ref-1">1</xref>,<xref ref-type="bibr" rid="ref-2">2</xref>], and Existing Continuous Dice Coefficient. The reason behind the improvement was due to the application of Gaussian Weighted Non-local Mean Filter Preprocessing model to achieve the noise reduction. It concentrates on identifying projection that maximizes the total non-local mean of the projected continuous image or data. So, the small variations in the background are eliminated in an automatic manner. Therefore, the procedure was faster. Owing to this fact, the overall user authentication time using GWCK-CC was said to be comparatively lesser than 26&#x0025; [<xref ref-type="bibr" rid="ref-1">1</xref>], 51&#x0025; [<xref ref-type="bibr" rid="ref-2">2</xref>], and 54&#x0025; Existing Continuous Dice Coefficient respectively.</p>
</sec>
<sec id="s5_3">
<label>5.3</label>
<title>Performance Analysis of Error Rate</title>
<p>The error rate measures the difference between the actual user data and the predicted user data. While performing active authentication on mobile devices implicit continuous user authentication should be ensured in such a manner that the falsification of user authentication should be avoided. In other words, the error rate is mathematically formulated as given below.<disp-formula id="eqn-13"><label>(13)</label>
<mml:math id="mml-eqn-13" display="block"><mml:mrow><mml:mi mathvariant="normal">E</mml:mi><mml:mi mathvariant="normal">R</mml:mi></mml:mrow><mml:mo>=</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mn>1</mml:mn><mml:mrow><mml:mi mathvariant="normal">n</mml:mi></mml:mrow></mml:mfrac></mml:mrow><mml:munderover><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="normal">i</mml:mi></mml:mrow><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi mathvariant="normal">n</mml:mi></mml:mrow></mml:munderover><mml:mo>&#x2061;</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="normal">S</mml:mi><mml:mi mathvariant="normal">I</mml:mi></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="normal">D</mml:mi><mml:mi mathvariant="normal">O</mml:mi></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mi mathvariant="normal">S</mml:mi><mml:mi mathvariant="normal">I</mml:mi></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="normal">M</mml:mi><mml:mi mathvariant="normal">O</mml:mi></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mrow><mml:mo>&#x2217;</mml:mo></mml:mrow><mml:mn>100</mml:mn></mml:mstyle></mml:math>
</disp-formula></p>
<p>From the above <xref ref-type="disp-formula" rid="eqn-13">Eq. (13)</xref>, the error rate &#x2018;ER&#x2019; is measured based on the desired output of the sample images &#x2018;SI(DO)&#x2019; and the model output of the sample images &#x2018;SI(MO)&#x2019;. It is measured in terms of percentage. <xref ref-type="table" rid="table-2">Tab. 2</xref> given below provides the tabulation results for error rate using four different methods, GWCK-CC, existing GaitCode [<xref ref-type="bibr" rid="ref-1">1</xref>], EOR [<xref ref-type="bibr" rid="ref-2">2</xref>], and Existing Continuous Dice Coefficient.</p>
<table-wrap id="table-2"><label>Table 2</label>
<caption>
<title>Tabulation for error rate</title></caption>
<table><colgroup><col align="left"/><col align="left"/><col align="left"/><col align="left"/><col align="left"/>
</colgroup>
<thead>
<tr>
<th align="left" rowspan="2">Face images</th>
<th align="center" colspan="4">Error rate (&#x0025;)</th>
</tr>
<tr>
<th align="left">GWCK-CC</th>
<th align="left">GaitCode</th>
<th align="left">EOR</th>
<th align="left">Existing continuous dice coefficient</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left">500</td>
<td align="left">2</td>
<td align="left">4</td>
<td align="left">7</td>
<td align="left">9</td>
</tr>
<tr>
<td align="left">1000</td>
<td align="left">3.55</td>
<td align="left">4.85</td>
<td align="left">8.15</td>
<td align="left">9.55</td>
</tr>
<tr>
<td align="left">1500</td>
<td align="left">4</td>
<td align="left">5.35</td>
<td align="left">11.35</td>
<td align="left">12.45</td>
</tr>
<tr>
<td align="left">2000</td>
<td align="left">7</td>
<td align="left">12.05</td>
<td align="left">16</td>
<td align="left">17</td>
</tr>
<tr>
<td align="left">2500</td>
<td align="left">8.25</td>
<td align="left">14</td>
<td align="left">15.35</td>
<td align="left">17.55</td>
</tr>
<tr>
<td align="left">3000</td>
<td align="left">9.15</td>
<td align="left">14.35</td>
<td align="left">16</td>
<td align="left">18</td>
</tr>
<tr>
<td align="left">3500</td>
<td align="left">11.35</td>
<td align="left">15.15</td>
<td align="left">16.15</td>
<td align="left">18.25</td>
</tr>
<tr>
<td align="left">4000</td>
<td align="left">12</td>
<td align="left">16.25</td>
<td align="left">17</td>
<td align="left">19</td>
</tr>
<tr>
<td align="left">4500</td>
<td align="left">12.45</td>
<td align="left">17</td>
<td align="left">18.25</td>
<td align="left">20.55</td>
</tr>
<tr>
<td align="left">5000</td>
<td align="left">13</td>
<td align="left">17.35</td>
<td align="left">19</td>
<td align="left">21</td>
</tr>
</tbody>
</table>
</table-wrap>
<p><xref ref-type="table" rid="table-2">Tab. 2</xref> shows the error rate for 5000 different face images. From the table it is inferred that increasing the face images causes a swift increase in the error rate also. However, simulation results shows that with 500 face images used for simulation with 480 images correctly authenticated, the model output using the four methods were observed to be 470, 460, 445, and 435. With this, the overall error rate was found to be 2&#x0025;, 4&#x0025;, 7&#x0025; and 9&#x0025; respectively. With this the error rate using the proposed GWCK-CC method was found to be comparatively lesser than [<xref ref-type="bibr" rid="ref-1">1</xref>,<xref ref-type="bibr" rid="ref-2">2</xref>] and Existing Continuous Dice Coefficient. The reason was due to the application of Gaussian Weighted Cauchy Kriging Continuous Czekanowski&#x2019;s-based implicit continuous authentication algorithm. Preprocessing is performed using Gaussian weight. Cauchy Kriging function is applied to reduce the dimensionality and validation is performed for implication continuous authentication on mobile devices. The error rate using GWCK-CC method is reduced by 32&#x0025; compared to [<xref ref-type="bibr" rid="ref-1">1</xref>], 46&#x0025; compared to [<xref ref-type="bibr" rid="ref-2">2</xref>], and 52&#x0025; compared to Existing Continuous Dice Coefficient.</p>
</sec>
<sec id="s5_4">
<label>5.4</label>
<title>Performance Analysis of Sensitivity</title>
<p>Sensitivity rate compares the total number of face images that has been performed with implicit continuous authenticated with the total number of face images actually present. The main objective behind the measure of sensitivity is to predict the positive instances (TP) in the face video image dataset. In other words, the resultant value of sensitivity refers to that the subjects or face images predicted to have performed implicit continuous authentication. It is mathematically expressed as given below.<disp-formula id="eqn-14"><label>(14)</label>
<mml:math id="mml-eqn-14" display="block"><mml:mrow><mml:mi mathvariant="normal">S</mml:mi><mml:mi mathvariant="normal">e</mml:mi><mml:mi mathvariant="normal">n</mml:mi></mml:mrow><mml:mo>=</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mrow><mml:mrow><mml:mi mathvariant="normal">T</mml:mi><mml:mi mathvariant="normal">P</mml:mi></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="normal">T</mml:mi><mml:mi mathvariant="normal">P</mml:mi></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:mi mathvariant="normal">F</mml:mi><mml:mi mathvariant="normal">N</mml:mi></mml:mrow></mml:mrow></mml:mfrac></mml:mrow><mml:mrow><mml:mo>&#x2217;</mml:mo></mml:mrow><mml:mn>100</mml:mn></mml:mstyle></mml:math>
</disp-formula></p>
<p>From the above <xref ref-type="disp-formula" rid="eqn-14">Eq. (14)</xref>, sensitivity &#x2018;Sen&#x2019; is measured based on the true positive rate &#x2018;TP&#x2019; and the false negative rate &#x2018;FN&#x2019; respectively. It is measured in terms of percentage (&#x0025;). <xref ref-type="fig" rid="fig-6">Fig. 6</xref> given below provides the tabulation results for sensitivity rate using four different methods, GWCK-CC, existing GaitCode [<xref ref-type="bibr" rid="ref-1">1</xref>], EOR [<xref ref-type="bibr" rid="ref-2">2</xref>], and Existing Continuous Dice Coefficient.</p>
<fig id="fig-6">
<label>Figure 6</label>
<caption>
<title>Graphical representation of sensitivity</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CSSE_25672-fig-6.png"/>
</fig>
<p><xref ref-type="fig" rid="fig-6">Fig. 6</xref> given above shows the sensitivity results for 5000 different face images collected from UMDAA-02 Face Dataset collected at different time instances. As shown in the above figure, increasing the number of face images causes a decrease in the sensitivity rate. In other words while increasing the face images for active authentication on mobile devices also decreases in a small amount. However, simulations with 500 faces show a true positive rate of 475, 460, 450 and 440 using the four methods, GWCK-CC method, GaitCode [<xref ref-type="bibr" rid="ref-1">1</xref>], EOR [<xref ref-type="bibr" rid="ref-2">2</xref>], and Existing Continuous Dice Coefficient. In a similar manner, the false negative rates were observed to be 25, 40, 50 and 60 using the GWCK-CC method, GaitCode [<xref ref-type="bibr" rid="ref-1">1</xref>], EOR [<xref ref-type="bibr" rid="ref-2">2</xref>], and Existing Continuous Dice Coefficient. With this the overall sensitivity were observed to be 95&#x0025; using GWCK-CC method, 92&#x0025; using [<xref ref-type="bibr" rid="ref-1">1</xref>], 90&#x0025; using [<xref ref-type="bibr" rid="ref-2">2</xref>], and 88&#x0025; using Existing Continuous Dice Coefficient. The sensitivity was higher due to the application of Cauchy Kriging Regression for Feature Extraction using GWCK-CC method. Also, by applying Cauchy Kriging Regression results, the time complexity and as memory capacity are reduced. Only the projected continuous images are stored. Moreover, with the Cauchy Kriging Regression the residuals are found to be orthogonal to each other. Hence it circumvents redundant information, which in due course imparts comprehensive data compression and allows implicit continuous authentication for mobile devices. As a result, the sensitivity rate using GWCK-CC method is improved by 8&#x0025;, 10&#x0025;, 15&#x0025; compared to [<xref ref-type="bibr" rid="ref-1">1</xref>,<xref ref-type="bibr" rid="ref-2">2</xref>], and Existing Continuous Dice Coefficient respectively.</p>
</sec>
<sec id="s5_5">
<label>5.5</label>
<title>Performance Analysis of Specificity</title>
<p>The specificity on the other end refers to the percentage ratio of negatives that are correctly identified (i.e., the proportion of those face images that has not been performed with implicit continuous authentication and also the face images that are correctly identified as not performed with implicit continuous authentication).<disp-formula id="eqn-15"><label>(15)</label>
<mml:math id="mml-eqn-15" display="block"><mml:mrow><mml:mi mathvariant="normal">S</mml:mi><mml:mi mathvariant="normal">p</mml:mi><mml:mi mathvariant="normal">e</mml:mi></mml:mrow><mml:mo>=</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mrow><mml:mrow><mml:mi mathvariant="normal">T</mml:mi><mml:mi mathvariant="normal">N</mml:mi></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="normal">T</mml:mi><mml:mi mathvariant="normal">N</mml:mi></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:mi mathvariant="normal">F</mml:mi><mml:mi mathvariant="normal">P</mml:mi></mml:mrow></mml:mrow></mml:mfrac></mml:mrow><mml:mrow><mml:mo>&#x2217;</mml:mo></mml:mrow><mml:mn>100</mml:mn></mml:mstyle></mml:math>
</disp-formula></p>
<p>From the above <xref ref-type="disp-formula" rid="eqn-15">Eq. (15)</xref>, specificity &#x2018;Spe&#x2019; is measured based on the true negative rate &#x2018;TN&#x2019; and the false positive rate &#x2018;FP&#x2019; respectively. It is measured in terms of percentage (&#x0025;). <xref ref-type="table" rid="table-3">Tab. 3</xref> given below provides the tabulation results for specificity rate using four different methods, GWCK-CC, existing GaitCode [<xref ref-type="bibr" rid="ref-1">1</xref>], EOR [<xref ref-type="bibr" rid="ref-2">2</xref>], and Existing Continuous Dice Coefficient.</p>
<table-wrap id="table-3"><label>Table 3</label>
<caption>
<title>Tabulation for specificity</title></caption>
<table><colgroup><col align="left"/><col align="left"/><col align="left"/><col align="left"/><col align="left"/>
</colgroup>
<thead>
<tr>
<th align="left" rowspan="2">Face images</th>
<th align="center" colspan="4">Specificity (&#x0025;)</th>
</tr>
<tr>
<th align="left">GWCK-CC</th>
<th align="left">GaitCode</th>
<th align="left">EOR</th>
<th align="left">Existing continuous dice coefficient</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left">500</td>
<td align="left">94</td>
<td align="left">90</td>
<td align="left">88</td>
<td align="left">85</td>
</tr>
<tr>
<td align="left">1000</td>
<td align="left">92.15</td>
<td align="left">88.15</td>
<td align="left">86.15</td>
<td align="left">83.25</td>
</tr>
<tr>
<td align="left">1500</td>
<td align="left">91</td>
<td align="left">86.35</td>
<td align="left">84.25</td>
<td align="left">82.15</td>
</tr>
<tr>
<td align="left">2000</td>
<td align="left">90.55</td>
<td align="left">86</td>
<td align="left">83</td>
<td align="left">81</td>
</tr>
<tr>
<td align="left">2500</td>
<td align="left">90.25</td>
<td align="left">84.25</td>
<td align="left">82.15</td>
<td align="left">80.55</td>
</tr>
<tr>
<td align="left">3000</td>
<td align="left">90</td>
<td align="left">84</td>
<td align="left">82</td>
<td align="left">79</td>
</tr>
<tr>
<td align="left">3500</td>
<td align="left">88.35</td>
<td align="left">83.15</td>
<td align="left">81.85</td>
<td align="left">78.15</td>
</tr>
<tr>
<td align="left">4000</td>
<td align="left">88</td>
<td align="left">83</td>
<td align="left">81</td>
<td align="left">77</td>
</tr>
<tr>
<td align="left">4500</td>
<td align="left">87.25</td>
<td align="left">82.55</td>
<td align="left">80.25</td>
<td align="left">76.15</td>
</tr>
<tr>
<td align="left">5000</td>
<td align="left">87</td>
<td align="left">82</td>
<td align="left">77</td>
<td align="left">74</td>
</tr>
</tbody>
</table>
</table-wrap>
<p><xref ref-type="table" rid="table-3">Tab. 3</xref> given above shows the specificity for four different methods namely GWCK-CC, existing GaitCode [<xref ref-type="bibr" rid="ref-1">1</xref>], EOR [<xref ref-type="bibr" rid="ref-2">2</xref>], and Existing Continuous Dice Coefficient. Specificity is a measure of how well the implicit continuous authentication is measured in identifying the true negatives, the percentage ratio of true negatives out of all the face samples images involved in the simulation that do not have the condition (true negatives and false positives). From the figure a decreasing trend is set to be seen using all the four methods. However, simulation performed with 500 face sample images shows a true negative of 470, 450, 440, and 425 using the four methods, GWCK-CC, existing GaitCode [<xref ref-type="bibr" rid="ref-1">1</xref>], EOR [<xref ref-type="bibr" rid="ref-2">2</xref>], and Existing Continuous Dice Coefficient, false positive of 30, 50, 60 and 75 respectively. With this, the overall specificity rate was observed to be 94&#x0025;, 90&#x0025;, 88&#x0025; and 85&#x0025; using GWCK-CC, existing GaitCode [<xref ref-type="bibr" rid="ref-1">1</xref>], EOR [<xref ref-type="bibr" rid="ref-2">2</xref>] and Existing Continuous Dice Coefficient, therefore contributing towards the required objective. The reason behind the specificity improvement was due to the application of Continuous Czekanowski&#x2019;s Classification. Then, it performs not only continuous authentication but also correct authentication. Due to this, the specificity rate using GWCK-CC [<xref ref-type="bibr" rid="ref-1">1</xref>] method was found to be better by 6&#x0025;, 9&#x0025;, and 13&#x0025; compared to [<xref ref-type="bibr" rid="ref-1">1</xref>,<xref ref-type="bibr" rid="ref-2">2</xref>] and Existing Continuous Dice Coefficient respectively.</p>
</sec>
</sec>
<sec id="s6">
<label>6</label>
<title>Conclusion</title>
<p>In this paper, we proposed the use of a Gaussian Weighted Cauchy Kriging-based Continuous Czekanowski&#x2019;s (GWCK-CC) implicit continuous authentication on mobile devices. The objective for the authentication method was to ensure smooth process on mobile devices without the fear of the data or information being hacked. In this study, for each session, the face images of user were acquired continuously in a temporal basis. Gaussian weight was applied to the input continuous images to obtain fine-grained denoised images. Next, pertinent continuous features of the sample face images were extracted by employing Cauchy Kriging Regression. Finally, the classified output using Continuous Czekanowski&#x2019;s function was utilized to differentiate between normal and abnormal users. Compared with the continuous authentication results of the state-of-the-art methods, the user authentication accuracy, user authentication time, error rate, sensitivity and specificity of the generated GWCK-CC is relatively strong, which can accomplish very consequential effects and ensure robust authentication. The managerial and technical implications are based on the proposed method theory. To conduct the experiments, the results are implemented by using UMDAA-02-FD with higher authentication accuracy by 9&#x0025;, lesser authentication time, and error rate by 44&#x0025;, and 43&#x0025; than the state of art works. The proposed GWCK-CC method limitation is that it failed to identify the different types of attack. In the future, instead of using deep learning, other variant in the deep learning can be utilized to extract features. In addition, ensemble learning could be employed to categorize the valid and invalid set of activities of user.</p>
</sec>
</body>
<back><fn-group>
<fn fn-type="other">
<p><bold>Funding Statement:</bold> The authors received no specific funding for this study.</p>
</fn>
<fn fn-type="conflict">
<p><bold>Conflicts of Interest:</bold> The authors declare that they have no conflicts of interest to report regarding the present study.</p>
</fn>
</fn-group>
<ref-list content-type="authoryear">
<title>References</title>
<ref id="ref-1"><label>[1]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>I.</given-names> <surname>Papavasileiou</surname></string-name>, <string-name><given-names>Z.</given-names> <surname>Qiao</surname></string-name>, <string-name><given-names>C.</given-names> <surname>Zhang</surname></string-name>, <string-name><given-names>W.</given-names> <surname>Zhang</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Bi</surname></string-name> <etal>et al.,</etal></person-group> &#x201C;<article-title>GaitCode: Gait-based continuous authentication using multimodal learning and wearable sensors</article-title>,&#x201D; <source>Smart Health</source>, vol. <volume>19</volume>, pp. <fpage>1</fpage>&#x2013;<lpage>18</lpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-2"><label>[2]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>P.</given-names> <surname>Perera</surname></string-name> and <string-name><given-names>V. M.</given-names> <surname>Patel</surname></string-name></person-group>, &#x201C;<article-title>Face-based multiple user active authentication on mobile devices</article-title>,&#x201D; <source>IEEE Transactions on Information Forensics and Security</source>, vol. <volume>14</volume>, no. <issue>5</issue>, pp. <fpage>1240</fpage>&#x2013;<lpage>1250</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-3"><label>[3]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>P.</given-names> <surname>Kumari</surname></string-name> and <string-name><given-names>K. R.</given-names> <surname>Seeja</surname></string-name></person-group>, &#x201C;<article-title>A novel periocular biometrics solution for authentication during covid-19 pandemic situation</article-title>,&#x201D; <source>Journal of Ambient Intelligence and Humanized Computing</source>, vol. <volume>12</volume>, pp. <fpage>10321</fpage>&#x2013;<lpage>10337</lpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-4"><label>[4]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>A. B. A.</given-names> <surname>Ali</surname></string-name>, <string-name><given-names>V.</given-names> <surname>Ponnusamy</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Sangodiah</surname></string-name>, <string-name><given-names>R.</given-names> <surname>Alroobaea</surname></string-name>, <string-name><given-names>N. Z.</given-names> <surname>Jhanjhi</surname></string-name> <etal>et al.,</etal></person-group> &#x201C;<article-title>Smartphone security using swipe behavior-based authentication</article-title>,&#x201D; <source>Intelligent Automation &#x0026; Soft Computing</source>, vol. <volume>29</volume>, no. <issue>2</issue>, pp. <fpage>571</fpage>&#x2013;<lpage>585</lpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-5"><label>[5]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>M. A.</given-names> <surname>Alqarni</surname></string-name>, <string-name><given-names>S. H.</given-names> <surname>Chauhdary</surname></string-name>, <string-name><given-names>M. N.</given-names> <surname>Malik</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Ehatisham-ul-Haq</surname></string-name> and <string-name><given-names>M. A.</given-names> <surname>Azam</surname></string-name></person-group>, &#x201C;<article-title>Identifying smartphone users based on how they interact with their phones</article-title>,&#x201D; <source>Human-Centric Computing and Information Sciences</source>, vol. <volume>10</volume>, no. <issue>7</issue>, pp. <fpage>1</fpage>&#x2013;<lpage>14</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-6"><label>[6]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>M.</given-names> <surname>Abuhamad</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Abusnaina</surname></string-name>, <string-name><given-names>D.</given-names> <surname>Nyang</surname></string-name> and <string-name><given-names>D.</given-names> <surname>Mohaisen</surname></string-name></person-group>, &#x201C;<article-title>Sensor-based continuous authentication of smartphones&#x2019; users using behavioral biometrics: A contemporary survey</article-title>,&#x201D; <source>IEEE Internet of Things Journal</source>, vol. <volume>8</volume>, no. <issue>1</issue>, pp. <fpage>65</fpage>&#x2013;<lpage>84</lpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-7"><label>[7]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>&#x00D6;. D.</given-names> <surname>Incel</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Gunay</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Akani</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Barlas</surname></string-name>, <string-name><given-names>O. E.</given-names> <surname>Basar</surname></string-name> <etal>et al.,</etal></person-group> &#x201C;<article-title>DAKOTA: Sensor and touch screen-based continuous authentication on a mobile banking application</article-title>,&#x201D; <source>IEEE Access</source>, vol. <volume>9</volume>, pp. <fpage>38943</fpage>&#x2013;<lpage>38960</lpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-8"><label>[8]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>R.</given-names> <surname>Wang</surname></string-name> and <string-name><given-names>D.</given-names> <surname>Tao</surname></string-name></person-group>, &#x201C;<article-title>Context-aware implicit authentication of smartphone users based on multi-sensor behavior</article-title>,&#x201D; <source>IEEE Access</source>, vol. <volume>7</volume>, pp. <fpage>119654</fpage>&#x2013;<lpage>119667</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-9"><label>[9]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>S.</given-names> <surname>Vhaduri</surname></string-name>, <string-name><given-names>S. V.</given-names> <surname>Dibbo</surname></string-name> and <string-name><given-names>W.</given-names> <surname>Cheung</surname></string-name></person-group>, &#x201C;<article-title>HIAuth: A hierarchical implicit authentication system for IoT wearables using multiple biometrics</article-title>,&#x201D; <source>IEEE Access</source>, vol. <volume>9</volume>, pp. <fpage>116395</fpage>&#x2013;<lpage>116406</lpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-10"><label>[10]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>F.</given-names> <surname>Anjomshoa</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Aloqaily</surname></string-name>, <string-name><given-names>B.</given-names> <surname>Kantarci</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Erol-Kantarci</surname></string-name> and <string-name><given-names>S.</given-names> <surname>Schuckers</surname></string-name></person-group>, &#x201C;<article-title>Social behaviometrics for personalized devices in the internet of things era</article-title>,&#x201D; <source>IEEE Access</source>, vol. <volume>5</volume>, pp. <fpage>12199</fpage>&#x2013;<lpage>12213</lpage>, <year>2017</year>.</mixed-citation></ref>
<ref id="ref-11"><label>[11]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>Y.</given-names> <surname>Li</surname></string-name>, <string-name><given-names>H.</given-names> <surname>Hu</surname></string-name>, <string-name><given-names>G.</given-names> <surname>Zhou</surname></string-name> and <string-name><given-names>S.</given-names> <surname>Deng</surname></string-name></person-group>, &#x201C;<article-title>Sensor-based continuous authentication using cost-effective kernel ridge regression</article-title>,&#x201D; <source>IEEE Access</source>, vol. <volume>6</volume>, pp. <fpage>32554</fpage>&#x2013;<lpage>32565</lpage>, <year>2018</year>.</mixed-citation></ref>
<ref id="ref-12"><label>[12]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>F.</given-names> <surname>Nakayama</surname></string-name>, <string-name><given-names>P.</given-names> <surname>Lenz</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Banou</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Nogueira</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Santos</surname></string-name> <etal>et al.,</etal></person-group> &#x201C;<article-title>A continuous user authentication system based on galvanic coupling communication for s-health</article-title>,&#x201D; <source>Wireless Communications and Mobile Computing</source>, vol. <volume>2019</volume>, pp. <fpage>1</fpage>&#x2013;<lpage>11</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-13"><label>[13]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>F. H.</given-names> <surname>Al-Naji</surname></string-name> and <string-name><given-names>R.</given-names> <surname>Zagrouba</surname></string-name></person-group>, &#x201C;<article-title>CAB-IoT: Continuous authentication architecture based on blockchain for internet of things</article-title>,&#x201D; <source>Journal of King Saud University-Computer and Information Sciences</source>, pp. <fpage>1</fpage>&#x2013;<lpage>18</lpage>, <year>2020</year>. [Online]. Available: <uri xlink:href="https://doi.org/10.1016/j.jksuci.2020.11.023">https://doi.org/10.1016/j.jksuci.2020.11.023</uri>.</mixed-citation></ref>
<ref id="ref-14"><label>[14]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>V.</given-names> <surname>Shankar</surname></string-name> and <string-name><given-names>K.</given-names> <surname>Singh</surname></string-name></person-group>, &#x201C;<article-title>An intelligent scheme for continuous authentication of smartphone using deep auto encoder and softmax regression model easy for user brain</article-title>,&#x201D; <source>IEEE Access</source>, vol. <volume>7</volume>, pp. <fpage>48645</fpage>&#x2013;<lpage>48654</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-15"><label>[15]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>P. A.</given-names> <surname>Thomas</surname></string-name> and <string-name><given-names>K. P.</given-names> <surname>Mathew</surname></string-name></person-group>, &#x201C;<article-title>A broad review on non-intrusive active user authentication in biometrics</article-title>,&#x201D; <source>Journal of Ambient Intelligence and Humanized Computing</source>, pp. <fpage>1</fpage>&#x2013;<lpage>22</lpage>, <year>2021</year>. [Online]. Available: <uri xlink:href="https://doi.org/10.1007/s12652-021-03301-x">https://doi.org/10.1007/s12652-021-03301-x</uri>.</mixed-citation></ref>
<ref id="ref-16"><label>[16]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>I.</given-names> <surname>Stylios</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Kokolakis</surname></string-name>, <string-name><given-names>O.</given-names> <surname>Thanou</surname></string-name> and <string-name><given-names>S.</given-names> <surname>Chatzis</surname></string-name></person-group>, &#x201C;<article-title>Behavioral biometrics &#x0026; continuous user authentication on mobile devices: A survey</article-title>,&#x201D; <source>Information Fusion</source>, vol. <volume>66</volume>, pp. <fpage>76</fpage>&#x2013;<lpage>99</lpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-17"><label>[17]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>M.</given-names> <surname>Abuhamad</surname></string-name>, <string-name><given-names>T.</given-names> <surname>Abuhmed</surname></string-name>, <string-name><given-names>D.</given-names> <surname>Mohaisen</surname></string-name> and <string-name><given-names>D.</given-names> <surname>Nyang</surname></string-name></person-group>, &#x201C;<article-title>AUToSen: Deep learning based implicit continuous authentication using smartphone sensors</article-title>,&#x201D; <source>IEEE Internet of Things Journal</source>, vol. <volume>7</volume>, no. <issue>6</issue>, pp. <fpage>5008</fpage>&#x2013;<lpage>5020</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-18"><label>[18]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>W. R.</given-names> <surname>Almeida</surname></string-name>, <string-name><given-names>F. A.</given-names> <surname>Andal&#x00F3;</surname></string-name>, <string-name><given-names>R.</given-names> <surname>Padilha</surname></string-name>, <string-name><given-names>G.</given-names> <surname>Bertocco</surname></string-name>, <string-name><given-names>W.</given-names> <surname>Dias</surname></string-name> <etal>et al.,</etal></person-group> &#x201C;<article-title>Detecting face presentation attacks in mobile devices with a patch-based CNN and a sensor-aware loss function</article-title>,&#x201D; <source>PLOS ONE</source>, vol. <volume>15</volume>, no. <issue>9</issue>, pp. <fpage>1</fpage>&#x2013;<lpage>24</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-19"><label>[19]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>S.</given-names> <surname>Gupta</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Buriro</surname></string-name> and <string-name><given-names>B.</given-names> <surname>Crispo</surname></string-name></person-group>, &#x201C;<article-title>Demystifying authentication concepts in smartphones: Ways and types to secure access</article-title>,&#x201D; <source>Mobile Information Systems</source>, vol. <volume>2018</volume>, pp. <fpage>1</fpage>&#x2013;<lpage>16</lpage>, <year>2018</year>.</mixed-citation></ref>
<ref id="ref-20"><label>[20]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>K.</given-names> <surname>Shaukat</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Luo</surname></string-name>, <string-name><given-names>V.</given-names> <surname>Varadharajan</surname></string-name>, <string-name><given-names>I. A.</given-names> <surname>Hameed</surname></string-name> and <string-name><given-names>M.</given-names> <surname>Xu</surname></string-name></person-group>, &#x201C;<article-title>A survey on machine learning techniques for cyber security in the last decade</article-title>,&#x201D; <source>IEEE Access</source>, vol. <volume>8</volume>, pp. <fpage>222310</fpage>&#x2013;<lpage>222354</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-21"><label>[21]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>K.</given-names> <surname>Shaukat</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Luo</surname></string-name>, <string-name><given-names>V.</given-names> <surname>Varadharajan</surname></string-name>, <string-name><given-names>I. A.</given-names> <surname>Hameed</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Chen</surname></string-name> <etal>et al.,</etal></person-group> &#x201C;<article-title>Performance comparison and current challenges of using machine learning techniques in cyber security</article-title>,&#x201D; <source>Energies</source>, vol. <volume>10</volume>, no. <issue>13</issue>, pp. <fpage>1</fpage>&#x2013;<lpage>30</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-22"><label>[22]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>V. M.</given-names> <surname>Patel</surname></string-name>, <string-name><given-names>R.</given-names> <surname>Chellappa</surname></string-name>, <string-name><given-names>D.</given-names> <surname>Chandra</surname></string-name> and <string-name><given-names>B.</given-names> <surname>Barbello</surname></string-name></person-group>, &#x201C;<article-title>Continuous user authentication on mobile devices: Recent progress and remaining challenges</article-title>,&#x201D; <source>IEEE Signal Processing Magazine</source>, vol. <volume>33</volume>, no. <issue>4</issue>, pp. <fpage>1</fpage>&#x2013;<lpage>24</lpage>, <year>2016</year>.</mixed-citation></ref>
<ref id="ref-23"><label>[23]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>C.</given-names> <surname>Boutilier</surname></string-name> and <string-name><given-names>B.</given-names> <surname>Price</surname></string-name></person-group>, &#x201C;<article-title>Accelerating reinforcement learning through implicit imitation</article-title>,&#x201D; <source>Journal of Artificial Intelligence Research</source>, vol. <volume>19</volume>, no. <issue>1</issue>, pp. <fpage>569</fpage>&#x2013;<lpage>629</lpage>, <year>2003</year>.</mixed-citation></ref>
<ref id="ref-24"><label>[24]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>K.</given-names> <surname>Shaukat</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Luo</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Chen</surname></string-name> and <string-name><given-names>D.</given-names> <surname>Liu</surname></string-name></person-group>, &#x201C;<article-title>Cyber threat detection using machine learning techniques: A performance evaluation perspective</article-title>,&#x201D; in <conf-name>2020 Int. Conf. on Cyber Warfare and Security (ICCWS)</conf-name>, Islamabad, Pakistan, pp. <fpage>1</fpage>&#x2013;<lpage>6</lpage>, <year>2020</year>. <uri xlink:href="https://doi.org/10.1109/ICCWS48432.2020.9292388">https://doi.org/10.1109/ICCWS48432.2020.9292388</uri>.</mixed-citation></ref>
<ref id="ref-25"><label>[25]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>B.</given-names> <surname>Recht</surname></string-name></person-group>, &#x201C;<article-title>A tour of reinforcement learning: The view from continuous control</article-title>,&#x201D; <source>Annual Review of Control, Robotics, and Autonomous Systems</source>, vol. <volume>2</volume>, pp. <fpage>253</fpage>&#x2013;<lpage>279</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-26"><label>[26]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>U.</given-names> <surname>Mahbub</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Sarkar</surname></string-name>, <string-name><given-names>V. M.</given-names> <surname>Patel</surname></string-name> and <string-name><given-names>R.</given-names> <surname>Chellappa</surname></string-name></person-group>, &#x201C;<article-title>Active user authentication for smartphones: A challenge data set and benchmark results</article-title>,&#x201D; in <conf-name>2016 IEEE 8th Int. Conf. on Biometrics Theory, Applications and Systems (BTAS)</conf-name>, Niagra Falls, NY, USA, pp. <fpage>1</fpage>&#x2013;<lpage>8</lpage>, <year>2016</year>.</mixed-citation></ref>
</ref-list>
</back>
</article>