<?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" xml:lang="en" article-type="research-article" dtd-version="1.1">
<front>
<journal-meta>
<journal-id journal-id-type="pmc">CMC</journal-id>
<journal-id journal-id-type="nlm-ta">CMC</journal-id>
<journal-id journal-id-type="publisher-id">CMC</journal-id>
<journal-title-group>
<journal-title>Computers, Materials &#x0026; Continua</journal-title>
</journal-title-group>
<issn pub-type="epub">1546-2226</issn>
<issn pub-type="ppub">1546-2218</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">45854</article-id>
<article-id pub-id-type="doi">10.32604/cmc.2023.045854</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Article</subject>
</subj-group>
</article-categories>
<title-group>
<article-title>Local Adaptive Gradient Variance Attack for Deep Fake Fingerprint Detection</article-title>
<alt-title alt-title-type="left-running-head">Local Adaptive Gradient Variance Attack for Deep Fake Fingerprint Detection</alt-title>
<alt-title alt-title-type="right-running-head">Local Adaptive Gradient Variance Attack for Deep Fake Fingerprint Detection</alt-title>
</title-group>
<contrib-group>
<contrib id="author-1" contrib-type="author">
<name name-style="western"><surname>Yuan</surname><given-names>Chengsheng</given-names></name><xref ref-type="aff" rid="aff-1">1</xref><xref ref-type="aff" rid="aff-2">2</xref></contrib>
<contrib id="author-2" contrib-type="author">
<name name-style="western"><surname>Cui</surname><given-names>Baojie</given-names></name><xref ref-type="aff" rid="aff-1">1</xref><xref ref-type="aff" rid="aff-2">2</xref></contrib>
<contrib id="author-3" contrib-type="author">
<name name-style="western"><surname>Zhou</surname><given-names>Zhili</given-names></name><xref ref-type="aff" rid="aff-3">3</xref></contrib>
<contrib id="author-4" contrib-type="author" corresp="yes">
<name name-style="western"><surname>Li</surname><given-names>Xinting</given-names></name><xref ref-type="aff" rid="aff-4">4</xref><email>lixt@tju.edu.cn</email></contrib>
<contrib id="author-5" contrib-type="author">
<name name-style="western"><surname>Wu</surname><given-names>Qingming Jonathan</given-names></name><xref ref-type="aff" rid="aff-5">5</xref></contrib>
<aff id="aff-1"><label>1</label><institution>Engineering Research Center of Digital Forensics, Ministry of Education, Nanjing University of Information Science and Technology</institution>, <addr-line>Nanjing, 210044</addr-line>, <country>China</country></aff>
<aff id="aff-2"><label>2</label><institution>School of Computer Science, Nanjing University of Information Science and Technology</institution>, <addr-line>Nanjing, 210044</addr-line>, <country>China</country></aff>
<aff id="aff-3"><label>3</label><institution>Institute of Artificial Intelligence and Blockchain, Guangzhou University</institution>, <addr-line>Guangzhou, 510006</addr-line>, <country>China</country></aff>
<aff id="aff-4"><label>4</label><institution>School of International Relations, National University of Defense Technology</institution>, <addr-line>Nanjing, 210039</addr-line>, <country>China</country></aff>
<aff id="aff-5"><label>5</label><institution>Department of Electrical and Computer Engineering, University of Windsor</institution>, <addr-line>Windsor, N9B 3P4</addr-line>, <country>Canada</country></aff>
</contrib-group>
<author-notes>
<corresp id="cor1"><label>&#x002A;</label>Corresponding Author: Xinting Li. Email: <email>lixt@tju.edu.cn</email></corresp>
</author-notes>
<pub-date date-type="collection" publication-format="electronic">
<year>2024</year></pub-date>
<pub-date date-type="pub" publication-format="electronic"><day>30</day>
<month>1</month>
<year>2024</year></pub-date>
<volume>78</volume>
<issue>1</issue>
<fpage>899</fpage>
<lpage>914</lpage>
<history>
<date date-type="received">
<day>09</day>
<month>9</month>
<year>2023</year>
</date>
<date date-type="accepted">
<day>20</day>
<month>11</month>
<year>2023</year>
</date>
</history>
<permissions>
<copyright-statement>&#x00A9; 2024 Yuan et al.</copyright-statement>
<copyright-year>2024</copyright-year>
<copyright-holder>Yuan et al.</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_CMC_45854.pdf"></self-uri>
<abstract>
<p>In recent years, deep learning has been the mainstream technology for fingerprint liveness detection (FLD) tasks because of its remarkable performance. However, recent studies have shown that these deep fake fingerprint detection (DFFD) models are not resistant to attacks by adversarial examples, which are generated by the introduction of subtle perturbations in the fingerprint image, allowing the model to make fake judgments. Most of the existing adversarial example generation methods are based on gradient optimization, which is easy to fall into local optimal, resulting in poor transferability of adversarial attacks. In addition, the perturbation added to the blank area of the fingerprint image is easily perceived by the human eye, leading to poor visual quality. In response to the above challenges, this paper proposes a novel adversarial attack method based on local adaptive gradient variance for DFFD. The ridge texture area within the fingerprint image has been identified and designated as the region for perturbation generation. Subsequently, the images are fed into the targeted white-box model, and the gradient direction is optimized to compute gradient variance. Additionally, an adaptive parameter search method is proposed using stochastic gradient ascent to explore the parameter values during adversarial example generation, aiming to maximize adversarial attack performance. Experimental results on two publicly available fingerprint datasets show that our method achieves higher attack transferability and robustness than existing methods, and the perturbation is harder to perceive.</p>
</abstract>
<kwd-group kwd-group-type="author">
<kwd>FLD</kwd>
<kwd>adversarial attacks</kwd>
<kwd>adversarial examples</kwd>
<kwd>gradient optimization</kwd>
<kwd>transferability</kwd>
</kwd-group>
<funding-group>
<award-group id="awg1">
<funding-source>National Natural Science Foundation of China</funding-source>
<award-id>62102189</award-id>
<award-id>62122032</award-id>
<award-id>61972205</award-id>
</award-group>
<award-group id="awg2">
<funding-source>National Social Sciences Foundation of China</funding-source>
<award-id>2022-SKJJ-C-082</award-id>
</award-group>
<award-group id="awg3">
<funding-source>Natural Science Foundation of Jiangsu Province</funding-source>
<award-id>BK20200807</award-id>
</award-group>
<award-group id="awg4">
<funding-source>NUDT Scientific Research Program</funding-source>
<award-id>JS21-4</award-id>
<award-id>ZK21-43</award-id>
</award-group>
<award-group id="awg5">
<funding-source>Guangdong Natural Science Funds for Distinguished Young Scholar</funding-source>
<award-id>2023B1515020041</award-id>
</award-group>
</funding-group>
</article-meta>
</front>
<body>
<sec id="s1">
<label>1</label>
<title>Introduction</title>
<p>Recently, biometric identification technologies such as fingerprint recognition [<xref ref-type="bibr" rid="ref-1">1</xref>], face recognition [<xref ref-type="bibr" rid="ref-2">2</xref>], and iris recognition [<xref ref-type="bibr" rid="ref-3">3</xref>], etc., have seen extensive deployment in a wide range of real-world applications. Fingerprint recognition, in particular, is favored due to its versatility, uniqueness and convenience. However recent studies have shown that these systems are vulnerable to fraudulent attacks involving fake fingerprints, the proposed fingerprint liveness detection technology can solve the above problems well, and its main task is to identify whether the fingerprint to be authenticated is from a human or a forged imitation.</p>
<p>In recent years, the iterative updating and development of deep learning technology has provided a whole new set of solutions for multiple types of tasks in the field of computer vision, such as image classification [<xref ref-type="bibr" rid="ref-4">4</xref>], object recognition [<xref ref-type="bibr" rid="ref-5">5</xref>], semantic segmentation [<xref ref-type="bibr" rid="ref-6">6</xref>], natural language processing [<xref ref-type="bibr" rid="ref-7">7</xref>]. These solutions have already been introduced to real-world scenarios, such as face recognition [<xref ref-type="bibr" rid="ref-8">8</xref>] and pedestrian detection [<xref ref-type="bibr" rid="ref-9">9</xref>], etc., and have obtained good feedback. Given the excellent performance of deep learning in image classification, it has also been applied to fingerprint liveness detection tasks. Notably, research on fingerprint liveness detection based on deep learning has garnered substantial attention from both academia and industry, showcasing remarkable achievements in deep fake fingerprint detection tasks [<xref ref-type="bibr" rid="ref-10">10</xref>], [<xref ref-type="bibr" rid="ref-11">11</xref>]. However, the latest research [<xref ref-type="bibr" rid="ref-12">12</xref>] has pointed out that in addition to the problem of spoofing attacks by forged fingerprints, DFFD models also face the problem of adversarial attacks. That is, by adding some fine perturbations to the fingerprint image, the constructed adversarial example enables the model to make false classifications with a high degree of confidence. The adversarial fingerprint is more destructive compared with the spoofing attack, and it is easier for the DFFD model to make wrong predictions. This poses a major threat to the integrity and security of the DFFD system. According to the level of knowledge, adversarial examples are generally divided into two categories: white-box attack entails crafting adversarial examples using knowledge of the target model&#x2019;s internal structure and parameters. In contrast, a black-box attack is a method for generating adversarial examples without access to the internal architecture or parameters of the target model. Generally speaking, white-box attacks can design customized perturbations according to the structure and parameters of the model, and achieve a high success rate of attack, but poor transferability in the face of unknown models. In a real-world scenario, it is not realistic to discover and know the parameters and structure of the target model in advance. It is more based on the black box attack scenario, that is, the parameters and structure of the target model are not known in advance, so studying and improving the transferability between different models is more in line with the real scenario. In addition, adversarial attacks can be divided into targeted and untargeted attacks depending on whether the model is incorrectly classified into a particular category. There has been limited research in the realm of adversarial attacks on DFFD systems, despite the significant threats they pose. To deal with adversarial attacks and improve the security of fingerprint recognition systems, a novel adversarial example generation method based on local adaptive gradient variance is proposed in this paper. The main contributions of this paper are as follows:
<list list-type="bullet">
<list-item>
<p>To enhance the visual quality of the adversarial fingerprint without affecting the original attack performance, Grad-CAM is used to visualize the attention area of the fingerprint image and as the additional area of the subsequent perturbation, which is difficult to perceive by human eyes.</p></list-item>
<list-item>
<p>To improve the transferability in the gradient-based adversarial example generation method, this paper proposes a local adaptive gradient variance attack method, which realizes the gradient update direction controllable by computing gradient variance at each iteration.</p></list-item>
<list-item>
<p>In this paper, an adaptive parameter search method is proposed to search the optimal hyper-parameters by using the stochastic gradient ascent method, thus reducing manual intervention and balancing the success rate of white-box attacks.</p></list-item>
<list-item>
<p>In this paper, the performance evaluation is tested on two publicly available fingerprint datasets, LiveDet2019 [<xref ref-type="bibr" rid="ref-13">13</xref>] and LiveDet2017 [<xref ref-type="bibr" rid="ref-14">14</xref>]. Experimental results indicate that the proposed method can improve the transferability of adversarial examples between different DFFD models, and obtain good visual quality.</p></list-item>
</list></p>
<p>This paper is an extension of our previous conference paper [<xref ref-type="bibr" rid="ref-15">15</xref>]. Compared with the [<xref ref-type="bibr" rid="ref-15">15</xref>], this paper extends and improves it. The main differences are summarized as follows: (1) We have improved the introduction section, restated the research motivation, provided a more comprehensive introduction and solved the actual problems. (2) In <xref ref-type="sec" rid="s3">Section 3</xref>, we constrain the region where perturbation is added, and discuss and analyze the feasibility. (3) In <xref ref-type="sec" rid="s4">Section 4</xref>, we demonstrate that the proposed method can be combined with input transformations to improve the visual quality of adversarial examples via extensive experimentation and interpretation.</p>
<p>The rest of this paper is structured as follows: <xref ref-type="sec" rid="s2">Section 2</xref> presents a review of related work. In <xref ref-type="sec" rid="s3">Section 3</xref>, we introduce the proposed method for generating adversarial examples. <xref ref-type="sec" rid="s4">Section 4</xref> provides the experimental results. Finally, the conclusion and future work are given.</p>
</sec>
<sec id="s2">
<label>2</label>
<title>Related Work</title>
<sec id="s2_1">
<label>2.1</label>
<title>Adversarial Examples</title>
<p>Szegedy et al. [<xref ref-type="bibr" rid="ref-16">16</xref>] first disclosed the flaws in image classification tasks: although deep learning has achieved impressive performance in image classification, it faces a serious challenge, that is, adding some subtle perturbations to the original image can cause the model to make incorrect predictions, and the human visual system can hardly catch the anomaly. They also give a mathematical formula for the calculation of perturbation, expressed in <italic>&#x03C1;</italic>, which induces the model to give a wrong judgment:
<disp-formula id="eqn-1"><label>(1)</label><mml:math id="mml-eqn-1" display="block"><mml:mtable rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mi>m</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>i</mml:mi><mml:mi>m</mml:mi><mml:mi>i</mml:mi><mml:mi>z</mml:mi><mml:mi>e</mml:mi><mml:mspace width="1em" /><mml:msub><mml:mrow><mml:mo>|</mml:mo><mml:mi>&#x03C1;</mml:mi><mml:mo>|</mml:mo></mml:mrow><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:msub><mml:mspace width="1em" /><mml:mi>s</mml:mi><mml:mo>.</mml:mo><mml:mi>t</mml:mi><mml:mo>.</mml:mo><mml:mtext>&#x00A0;</mml:mtext><mml:msup><mml:mi>y</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo>=</mml:mo><mml:mi>f</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>x</mml:mi><mml:mo>+</mml:mo><mml:mi>&#x03C1;</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="ueqn-2"><mml:math id="mml-ueqn-2" display="block"><mml:mi>x</mml:mi><mml:mo>+</mml:mo><mml:mi>&#x03C1;</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mn>1</mml:mn><mml:mo>]</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:msup><mml:mi>y</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo>&#x2260;</mml:mo><mml:mi>y</mml:mi></mml:math></disp-formula></p>
<p>In formulation <xref ref-type="disp-formula" rid="eqn-1">(1)</xref>, <inline-formula id="ieqn-1"><mml:math id="mml-ieqn-1"><mml:mi>&#x03C1;</mml:mi></mml:math></inline-formula> is constrained by norm <inline-formula id="ieqn-2"><mml:math id="mml-ieqn-2"><mml:msub><mml:mi>L</mml:mi><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, where <inline-formula id="ieqn-3"><mml:math id="mml-ieqn-3"><mml:mi>x</mml:mi></mml:math></inline-formula> represents the original input image, <inline-formula id="ieqn-4"><mml:math id="mml-ieqn-4"><mml:mi>y</mml:mi></mml:math></inline-formula> is the ground-truth label associated with it, and <inline-formula id="ieqn-5"><mml:math id="mml-ieqn-5"><mml:msup><mml:mi>y</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:math></inline-formula> signifies the incorrect label.</p>
<p>To calculate the global optimal solution, Szegedy tried to transformed the adversarial attack into a convex optimization problem, and presented a L-BFGS method [<xref ref-type="bibr" rid="ref-17">17</xref>]. After that, more and more work has been proposed. Moosavi-Dezfooli et al. [<xref ref-type="bibr" rid="ref-18">18</xref>] designed an iterative method to calculate the minimum perturbation for input images and added perturbations to guide the output image toward the decision boundary of the classifier. Carlini et al. [<xref ref-type="bibr" rid="ref-19">19</xref>] presented a series of three attacks along with a novel loss function designed to deceive target networks via defensive distillation.</p>
<p>Concurrently, the research landscape has seen the emergence of various black-box attack techniques. Sarkar et al. [<xref ref-type="bibr" rid="ref-20">20</xref>] introduced the UPSET network, capable of generating adversarial examples with universal perturbations applied to original images, effectively causing the model to misclassify specific target classes. Bhagoji et al. [<xref ref-type="bibr" rid="ref-21">21</xref>] proposed a finite difference-based method (FD attack) rooted in finite difference principles, wherein pixel data is adjusted to estimate the gradient direction approximately, subsequently conducting iterative attacks based on this estimated gradient. Dong et al. [<xref ref-type="bibr" rid="ref-22">22</xref>] introduced momentum into the iterative adversarial example generation process. Su et al. [<xref ref-type="bibr" rid="ref-23">23</xref>] designed a single pixel attack using a differential evolution algorithm to explore extreme conditions by modifying a single pixel in an image to trick the classifier. Furthermore, Fei et al. [<xref ref-type="bibr" rid="ref-12">12</xref>] conducted pioneering research into the feasibility of adversarial examples within the context of DFFD networks. A series of improved and optimized adversarial example generation methods have been proposed, showing great potential in this field. In this paper, focusing on DFFD model, we focus on how to improve the mobility and visual quality of the detection model.</p>
</sec>
<sec id="s2_2">
<label>2.2</label>
<title>Gradient-Based Methods</title>
<p>In this section, our primary focus is on presenting gradient-based attacks aimed at enhancing the transferability of adversarial attacks.</p>
<sec id="s2_2_1">
<label>2.2.1</label>
<title><italic>Fast Gradient Sign Method</italic> (<italic>FGSM</italic>)</title>
<p>To solve the nonlinear and vulnerability problems of the model, Goodfellow et al. [<xref ref-type="bibr" rid="ref-24">24</xref>] first proposed a FGSM, which realizes the generation of the adversarial example <inline-formula id="ieqn-6"><mml:math id="mml-ieqn-6"><mml:msup><mml:mi>x</mml:mi><mml:mrow><mml:mi>a</mml:mi><mml:mi>d</mml:mi><mml:mi>v</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> by optimizing the loss function and one-step update method, which is defined as follows:
<disp-formula id="eqn-2"><label>(2)</label><mml:math id="mml-eqn-2" display="block"><mml:mtable rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:msup><mml:mi>x</mml:mi><mml:mrow><mml:mi>a</mml:mi><mml:mi>d</mml:mi><mml:mi>v</mml:mi></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mi>x</mml:mi><mml:mo>+</mml:mo><mml:mi>&#x03F5;</mml:mi><mml:mo>&#x22C5;</mml:mo><mml:mi>s</mml:mi><mml:mi>i</mml:mi><mml:mi>g</mml:mi><mml:mi>n</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi mathvariant="normal">&#x2207;</mml:mi><mml:mrow><mml:mi>x</mml:mi></mml:mrow></mml:msub><mml:mi>J</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>x</mml:mi><mml:mo>,</mml:mo><mml:mi>y</mml:mi><mml:mo>;</mml:mo><mml:mtext>&#x00A0;</mml:mtext><mml:mi>&#x03B8;</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>here, <inline-formula id="ieqn-7"><mml:math id="mml-ieqn-7"><mml:msup><mml:mi>x</mml:mi><mml:mrow><mml:mi>a</mml:mi><mml:mi>d</mml:mi><mml:mi>v</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> represents the adversarial example, <inline-formula id="ieqn-8"><mml:math id="mml-ieqn-8"><mml:mi>x</mml:mi></mml:math></inline-formula> is the original image, <inline-formula id="ieqn-9"><mml:math id="mml-ieqn-9"><mml:mi>&#x03F5;</mml:mi></mml:math></inline-formula> is the perturbation size, <inline-formula id="ieqn-10"><mml:math id="mml-ieqn-10"><mml:mi>s</mml:mi><mml:mi>i</mml:mi><mml:mi>g</mml:mi><mml:mi>n</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mo>.</mml:mo><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> denotes the sign function, and <inline-formula id="ieqn-11"><mml:math id="mml-ieqn-11"><mml:msub><mml:mi mathvariant="normal">&#x2207;</mml:mi><mml:mrow><mml:mi>x</mml:mi></mml:mrow></mml:msub><mml:mi>J</mml:mi></mml:math></inline-formula> represents the gradient derived from the loss function <inline-formula id="ieqn-12"><mml:math id="mml-ieqn-12"><mml:mi>J</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mo>.</mml:mo><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula>. While FGSM performs attack rapidly, it exhibits a moderate success rate in adversarial attacks.</p>
</sec>
<sec id="s2_2_2">
<label>2.2.2</label>
<title><italic>Iterative Fast Gradient Sign Method</italic> (<italic>I-FGSM</italic>)</title>
<p>In contrast to FGSM, which relies on a single iteration, Kurakin et al. proposed I-FGSM [<xref ref-type="bibr" rid="ref-25">25</xref>] conducts multiple iterations during adversarial example generation, employing a smaller step size <inline-formula id="ieqn-13"><mml:math id="mml-ieqn-13"><mml:mi>&#x03B1;</mml:mi></mml:math></inline-formula> for each iteration, as expressed by:
<disp-formula id="eqn-3"><label>(3)</label><mml:math id="mml-eqn-3" display="block"><mml:mtable rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>a</mml:mi><mml:mi>d</mml:mi><mml:mi>v</mml:mi></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mrow><mml:mi>a</mml:mi><mml:mi>d</mml:mi><mml:mi>v</mml:mi></mml:mrow></mml:msubsup><mml:mo>+</mml:mo><mml:mi>&#x03B1;</mml:mi><mml:mo>&#x22C5;</mml:mo><mml:mi>s</mml:mi><mml:mi>i</mml:mi><mml:mi>g</mml:mi><mml:mi>n</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi mathvariant="normal">&#x2207;</mml:mi><mml:mrow><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mrow><mml:mi>a</mml:mi><mml:mi>d</mml:mi><mml:mi>v</mml:mi></mml:mrow></mml:msubsup></mml:mrow></mml:msub><mml:mi>J</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mrow><mml:mi>a</mml:mi><mml:mi>d</mml:mi><mml:mi>v</mml:mi></mml:mrow></mml:msubsup><mml:mo>,</mml:mo><mml:mi>y</mml:mi><mml:mo>;</mml:mo><mml:mtext>&#x00A0;</mml:mtext><mml:mi>&#x03B8;</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>where <inline-formula id="ieqn-14"><mml:math id="mml-ieqn-14"><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mrow><mml:mi>a</mml:mi><mml:mi>d</mml:mi><mml:mi>v</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> signifies the adversarial example at the <inline-formula id="ieqn-15"><mml:math id="mml-ieqn-15"><mml:mi>t</mml:mi></mml:math></inline-formula>-th iteration, with <inline-formula id="ieqn-16"><mml:math id="mml-ieqn-16"><mml:mi>t</mml:mi><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:math></inline-formula> implying <inline-formula id="ieqn-17"><mml:math id="mml-ieqn-17"><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mrow><mml:mi>a</mml:mi><mml:mi>d</mml:mi><mml:mi>v</mml:mi></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:mi>x</mml:mi></mml:math></inline-formula>, I-FGSM perform a better attack performance compared to FGSM but incurs higher computational costs.</p>
</sec>
<sec id="s2_2_3">
<label>2.2.3</label>
<title><italic>Momentum Iterative Fast Gradient Sign Method</italic> (<italic>MI-FGSM</italic>)</title>
<p>To enhance the update stability and avoid local maximum, MI-FGSM [<xref ref-type="bibr" rid="ref-22">22</xref>] is proposed to extend I-FGSM, that is, the momentum of previous iterations was included in gradient calculation to boost the transferability of adversarial examples, which is expressed as:
<disp-formula id="eqn-4"><label>(4)</label><mml:math id="mml-eqn-4" display="block"><mml:mtable rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:msub><mml:mi>g</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mi>&#x03BC;</mml:mi><mml:mo>&#x22C5;</mml:mo><mml:msub><mml:mi>g</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mfrac><mml:mrow><mml:msub><mml:mi mathvariant="normal">&#x2207;</mml:mi><mml:mrow><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mrow><mml:mi>a</mml:mi><mml:mi>d</mml:mi><mml:mi>v</mml:mi></mml:mrow></mml:msubsup></mml:mrow></mml:msub><mml:mi>J</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mrow><mml:mi>a</mml:mi><mml:mi>d</mml:mi><mml:mi>v</mml:mi></mml:mrow></mml:msubsup><mml:mo>,</mml:mo><mml:mi>y</mml:mi><mml:mo>;</mml:mo><mml:mtext>&#x00A0;</mml:mtext><mml:mi>&#x03B8;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:msub><mml:mi mathvariant="normal">&#x2207;</mml:mi><mml:mrow><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mrow><mml:mi>a</mml:mi><mml:mi>d</mml:mi><mml:mi>v</mml:mi></mml:mrow></mml:msubsup></mml:mrow></mml:msub></mml:mrow><mml:mi>J</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mrow><mml:mi>a</mml:mi><mml:mi>d</mml:mi><mml:mi>v</mml:mi></mml:mrow></mml:msubsup><mml:mo>,</mml:mo><mml:mi>y</mml:mi><mml:mo>;</mml:mo><mml:mtext>&#x00A0;</mml:mtext><mml:mi>&#x03B8;</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:msub><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:mfrac></mml:mstyle><mml:mo>,</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="ueqn-6"><mml:math id="mml-ueqn-6" display="block"><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>a</mml:mi><mml:mi>d</mml:mi><mml:mi>v</mml:mi></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mrow><mml:mi>a</mml:mi><mml:mi>d</mml:mi><mml:mi>v</mml:mi></mml:mrow></mml:msubsup><mml:mo>+</mml:mo><mml:mi>&#x03B1;</mml:mi><mml:mo>&#x22C5;</mml:mo><mml:mi>s</mml:mi><mml:mi>i</mml:mi><mml:mi>g</mml:mi><mml:mi>n</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>g</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo></mml:math></disp-formula>where <inline-formula id="ieqn-18"><mml:math id="mml-ieqn-18"><mml:msub><mml:mi>g</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is the gradient at the <inline-formula id="ieqn-19"><mml:math id="mml-ieqn-19"><mml:mi>t</mml:mi></mml:math></inline-formula>-th iteration, and the attenuation factor <inline-formula id="ieqn-20"><mml:math id="mml-ieqn-20"><mml:mi>&#x03BC;</mml:mi></mml:math></inline-formula> accumulates gradients from previous iterations.</p>
</sec>
<sec id="s2_2_4">
<label>2.2.4</label>
<title><italic>Nesterov Iterative Fast Gradient Sign Method</italic> (<italic>NI-FGSM</italic>)</title>
<p>NI-FGSM [<xref ref-type="bibr" rid="ref-26">26</xref>] introduces a Nesterov momentum, during the gradient update, predicts the gradient direction of the next iteration. NI-FGSM substitutes <inline-formula id="ieqn-21"><mml:math id="mml-ieqn-21"><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mrow><mml:mi>a</mml:mi><mml:mi>d</mml:mi><mml:mi>v</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> in <xref ref-type="disp-formula" rid="eqn-4">Eq. (4)</xref> with <inline-formula id="ieqn-22"><mml:math id="mml-ieqn-22"><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mrow><mml:mi>a</mml:mi><mml:mi>d</mml:mi><mml:mi>v</mml:mi></mml:mrow></mml:msubsup><mml:mo>+</mml:mo><mml:mi>&#x03B1;</mml:mi><mml:mo>&#x22C5;</mml:mo><mml:mi>&#x03BC;</mml:mi><mml:mo>&#x22C5;</mml:mo><mml:msub><mml:mi>g</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>.</p>
</sec>
<sec id="s2_2_5">
<label>2.2.5</label>
<title><italic>Variance Tuning Momentum-Based Iterative Method</italic> (<italic>VMI-FGSM</italic>)</title>
<p>VMI-FGSM [<xref ref-type="bibr" rid="ref-27">27</xref>] calculates the gradient of the neighborhood data points during the update to optimize the gradient update direction in the next iteration. It can be expressed as:
<disp-formula id="eqn-5"><label>(5)</label><mml:math id="mml-eqn-5" display="block"><mml:mtable rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:msub><mml:mi>g</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mi>&#x03BC;</mml:mi><mml:mo>&#x22C5;</mml:mo><mml:msub><mml:mi>g</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mfrac><mml:mrow><mml:msub><mml:mi mathvariant="normal">&#x2207;</mml:mi><mml:mrow><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mrow><mml:mi>a</mml:mi><mml:mi>d</mml:mi><mml:mi>v</mml:mi></mml:mrow></mml:msubsup></mml:mrow></mml:msub><mml:mi>J</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mrow><mml:mi>a</mml:mi><mml:mi>d</mml:mi><mml:mi>v</mml:mi></mml:mrow></mml:msubsup><mml:mo>,</mml:mo><mml:mi>y</mml:mi><mml:mo>;</mml:mo><mml:mtext>&#x00A0;</mml:mtext><mml:mi>&#x03B8;</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mrow><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:msub><mml:mi mathvariant="normal">&#x2207;</mml:mi><mml:mrow><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mrow><mml:mi>a</mml:mi><mml:mi>d</mml:mi><mml:mi>v</mml:mi></mml:mrow></mml:msubsup></mml:mrow></mml:msub></mml:mrow><mml:mi>J</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mrow><mml:mi>a</mml:mi><mml:mi>d</mml:mi><mml:mi>v</mml:mi></mml:mrow></mml:msubsup><mml:mo>,</mml:mo><mml:mi>y</mml:mi><mml:mo>;</mml:mo><mml:mtext>&#x00A0;</mml:mtext><mml:mi>&#x03B8;</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:msub><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:mfrac></mml:mstyle></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>where <inline-formula id="ieqn-23"><mml:math id="mml-ieqn-23"><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mfrac><mml:mn>1</mml:mn><mml:mi>n</mml:mi></mml:mfrac></mml:mstyle><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:munderover><mml:msub><mml:mi mathvariant="normal">&#x2207;</mml:mi><mml:mrow><mml:mrow><mml:msup><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msup></mml:mrow></mml:mrow></mml:msub><mml:mi>J</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msup><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msup><mml:mo>,</mml:mo><mml:mi>y</mml:mi><mml:mo>;</mml:mo><mml:mtext>&#x00A0;</mml:mtext><mml:mi>&#x03B8;</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi mathvariant="normal">&#x2207;</mml:mi><mml:mrow><mml:mi>x</mml:mi></mml:mrow></mml:msub><mml:mi>J</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>x</mml:mi><mml:mo>,</mml:mo><mml:mi>y</mml:mi><mml:mo>;</mml:mo><mml:mtext>&#x00A0;</mml:mtext><mml:mi>&#x03B8;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>, <inline-formula id="ieqn-24"><mml:math id="mml-ieqn-24"><mml:msup><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mrow><mml:mi>a</mml:mi><mml:mi>d</mml:mi><mml:mi>v</mml:mi></mml:mrow></mml:msubsup><mml:mo>+</mml:mo><mml:msup><mml:mi>r</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula>, and <inline-formula id="ieqn-25"><mml:math id="mml-ieqn-25"><mml:msup><mml:mi>r</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> is randomly selected in the neighborhood. Essentially, <inline-formula id="ieqn-26"><mml:math id="mml-ieqn-26"><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> captures the difference between the current gradient and the average gradient of its neighborhood during the <inline-formula id="ieqn-27"><mml:math id="mml-ieqn-27"><mml:mi>t</mml:mi></mml:math></inline-formula>-th iteration. This method further enhances the transferability of the gradient-based adversarial attacks.</p>
</sec>
<sec id="s2_2_6">
<label>2.2.6</label>
<title><italic>Transformation Robust Attack</italic> (<italic>TRA</italic>)</title>
<p>TRA [<xref ref-type="bibr" rid="ref-12">12</xref>] stands as the pioneering adversarial attack method in the realm of DFFD, and it confirms the feasibility of adversarial attacks on DFFD.</p>
</sec>
</sec>
<sec id="s2_3">
<label>2.3</label>
<title>Input Transformations</title>
<p>This section introduces various input transformations to enhance the attack transferability.</p>
<sec id="s2_3_1">
<label>2.3.1</label>
<title><italic>Diverse Input Method</italic> (<italic>DIM</italic>)</title>
<p>DIM [<xref ref-type="bibr" rid="ref-28">28</xref>] implements stochastic alterations involving resizing and padding on input data using a fixed probability. Subsequently, the modified images are directed through the classifier to calculate gradients, thereby enhancing the potential for transferability.</p>
</sec>
<sec id="s2_3_2">
<label>2.3.2</label>
<title><italic>Translation-Invariant Method</italic> (<italic>TIM</italic>)</title>
<p>TIM [<xref ref-type="bibr" rid="ref-29">29</xref>] employs a set of images to compute gradients, proving particularly effective, especially when confronting black-box models equipped with defensive mechanisms. To mitigate gradient calculations, Dong et al. introduce slight positional shifts to the images, followed by an approximation of gradient computation through convolving gradients from unaltered images with a kernel matrix.</p>
</sec>
<sec id="s2_3_3">
<label>2.3.3</label>
<title><italic>Scale-Invariant Method</italic> (<italic>SIM</italic>)</title>
<p>SIM [<xref ref-type="bibr" rid="ref-26">26</xref>] introduces the concept of scale-invariant property and computes gradients across an array of images scaled by a factor of <inline-formula id="ieqn-28"><mml:math id="mml-ieqn-28"><mml:mn>1</mml:mn><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:msup><mml:mn>2</mml:mn><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> relative to the input image, enhancing the adaptability of generated adversarial examples, where <inline-formula id="ieqn-29"><mml:math id="mml-ieqn-29"><mml:mi>i</mml:mi></mml:math></inline-formula> is treated as a hyper-parameter.</p>
<p>It&#x2019;s important to emphasize that different input transformation methods, namely DIM, TIM, and SIM, can be seamlessly incorporated into gradient-based attack methodologies, that is, the Composite Transformation Method (CTM) can improve mobility more effectively. In this study, the proposed method seeks to enhance the transferability of gradient-based attacks (e.g., MI-FGSM, VMI-FGSM). It can be synergistically employed alongside diverse input transformations to further bolster the transferability of the attack.</p>
</sec>
</sec>
</sec>
<sec id="s3">
<label>3</label>
<title>Proposed Method</title>
<p>VMI-FGSM establishes gradient variance as the distinction between the average gradient in the vicinity neighborhood and the gradient from the previous iteration. We believe that simply combining the difference between the previous iteration and the current iteration gradient is not enough to solve the transferability problem of adversarial examples. Consequently, this paper designs a novel attack approach based on local adaptive gradient variance under lower perturbation levels, adversarial examples generated using our method demonstrate enhanced attack performance and increased transferability against unknown DFFD models. <xref ref-type="fig" rid="fig-1">Fig. 1</xref> provides visual insights into the effects of various attacks on both live and counterfeit fingerprints.</p>
<fig id="fig-1">
<label>Figure 1</label>
<caption>
<title>When the perturbation size of <inline-formula id="ieqn-30"><mml:math id="mml-ieqn-30"><mml:mi mathvariant="bold-italic">&#x03F5;</mml:mi></mml:math></inline-formula> is 0.06 and the attack target model is Inception-v3, compared with MI-FGSM and VMI-FGSM, the adversarial examples of the proposed method is better</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_45854-fig-1.tif"/>
</fig>
<sec id="s3_1">
<label>3.1</label>
<title>Adversarial Fingerprint Area Location</title>
<p>The generation of adversarial examples involves adding subtle perturbations to the original image, typically constrained by specific norms like L<sub>0</sub> or L<sub>&#x221E;</sub>. The requirement of these interference generation is that the human visual system cannot be observed without successfully attacking the task model. To delve into the underlying principles of adversarial fingerprints, we employ the Grad-CAM to highlight sensitive regions that influence DFFD classification.</p>
<p>As illustrated in <xref ref-type="fig" rid="fig-2">Fig. 2</xref>, the layers of the VGG-16 model concentrate on discerning the texture of the original fingerprint within the image. When dealing with an adversarial fingerprint generated using the I-FGSM method, we observe that the introduced perturbations not only avoid diverting neural network attention to irrelevant areas but also focus on the fingerprint texture region. Consequently, our research uses YOLO-v5 [<xref ref-type="bibr" rid="ref-30">30</xref>] to restrict the addition of perturbations for adversarial fingerprints exclusively to the interior of the fingerprint texture region. This strategy not only improves the image quality without affecting the performance of the original task, but also makes the perturbations imperceptible to humans.</p>
<fig id="fig-2">
<label>Figure 2</label>
<caption>
<title>The Grad-CAM visualization of VGG-16 classifies a clean fingerprint image and an FGSM generated adversarial fingerprint, layer1 to layer3 represents the layer from shallow to deep</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_45854-fig-2.tif"/>
</fig>
<fig id="fig-4">
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_45854-fig-4.tif"/>
</fig>
</sec>
<sec id="s3_2">
<label>3.2</label>
<title>Gradient Variance</title>
<p>Given a clean image <inline-formula id="ieqn-56"><mml:math id="mml-ieqn-56"><mml:mi>x</mml:mi></mml:math></inline-formula>, a corresponding label <inline-formula id="ieqn-57"><mml:math id="mml-ieqn-57"><mml:mi>y</mml:mi></mml:math></inline-formula>, a classifier <inline-formula id="ieqn-58"><mml:math id="mml-ieqn-58"><mml:mi>f</mml:mi></mml:math></inline-formula> parameterized by <inline-formula id="ieqn-59"><mml:math id="mml-ieqn-59"><mml:mi>&#x03B8;</mml:mi></mml:math></inline-formula>, and a loss function <inline-formula id="ieqn-60"><mml:math id="mml-ieqn-60"><mml:mi>J</mml:mi></mml:math></inline-formula>. Additionally, we consider an example <inline-formula id="ieqn-61"><mml:math id="mml-ieqn-61"><mml:mi>x</mml:mi><mml:mrow><mml:mtext>^{'}</mml:mtext></mml:mrow></mml:math></inline-formula> sampled from the neighborhood, along with a neighborhood bound <inline-formula id="ieqn-62"><mml:math id="mml-ieqn-62"><mml:msup><mml:mi>&#x03F5;</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:math></inline-formula> for that region, and define the gradient variance as follows:
<disp-formula id="eqn-6"><label>(6)</label><mml:math id="mml-eqn-6" display="block"><mml:mtable rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mi>v</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>x</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>E</mml:mi><mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mo symmetric="true">&#x2016;</mml:mo><mml:msup><mml:mi>x</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo>&#x2212;</mml:mo><mml:mi>x</mml:mi><mml:mo symmetric="true">&#x2016;</mml:mo></mml:mrow><mml:mrow><mml:mi>p</mml:mi><mml:mo>&#x003C;</mml:mo><mml:msup><mml:mi>&#x03F5;</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:mrow></mml:msub></mml:mrow></mml:mrow></mml:msub><mml:mrow><mml:mo>[</mml:mo><mml:msub><mml:mi mathvariant="normal">&#x2207;</mml:mi><mml:mrow><mml:msup><mml:mi>x</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:mrow></mml:msub><mml:mi>J</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msup><mml:mi>x</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo>,</mml:mo><mml:mi>y</mml:mi><mml:mo>;</mml:mo><mml:mtext>&#x00A0;</mml:mtext><mml:mi>&#x03B8;</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi mathvariant="normal">&#x2207;</mml:mi><mml:mrow><mml:mi>x</mml:mi></mml:mrow></mml:msub><mml:mi>J</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>x</mml:mi><mml:mo>,</mml:mo><mml:mi>y</mml:mi><mml:mo>;</mml:mo><mml:mtext>&#x00A0;</mml:mtext><mml:mi>&#x03B8;</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>]</mml:mo></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>.</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula></p>
<p>We establish <inline-formula id="ieqn-63"><mml:math id="mml-ieqn-63"><mml:msup><mml:mi>&#x03F5;</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo>=</mml:mo><mml:mi>&#x03F5;</mml:mi><mml:mo>&#x22C5;</mml:mo><mml:mi>b</mml:mi></mml:math></inline-formula>, where <inline-formula id="ieqn-64"><mml:math id="mml-ieqn-64"><mml:mi>&#x03F5;</mml:mi></mml:math></inline-formula> denotes the perturbation size, and <inline-formula id="ieqn-65"><mml:math id="mml-ieqn-65"><mml:mi>b</mml:mi></mml:math></inline-formula> functions as the bound of the neighborhood. Due to the discontinuous nature of the input, calculating <inline-formula id="ieqn-66"><mml:math id="mml-ieqn-66"><mml:msub><mml:mi>E</mml:mi><mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mo symmetric="true">&#x2016;</mml:mo><mml:mi>x</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mi>x</mml:mi><mml:mo symmetric="true">&#x2016;</mml:mo></mml:mrow><mml:mrow><mml:mi>p</mml:mi><mml:mo>&#x003C;</mml:mo><mml:msup><mml:mi>&#x03F5;</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:mrow></mml:msub></mml:mrow></mml:mrow></mml:msub><mml:mrow><mml:mo>[</mml:mo><mml:msub><mml:mi mathvariant="normal">&#x2207;</mml:mi><mml:mrow><mml:msup><mml:mi>x</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:mrow></mml:msub><mml:mi>J</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msup><mml:mi>x</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo>,</mml:mo><mml:mi>y</mml:mi><mml:mo>;</mml:mo><mml:mtext>&#x00A0;</mml:mtext><mml:mi>&#x03B8;</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula> directly is not feasible. Consequently, we approximate this value by sampling <inline-formula id="ieqn-67"><mml:math id="mml-ieqn-67"><mml:mi>N</mml:mi></mml:math></inline-formula> data points from the neighborhood of <inline-formula id="ieqn-68"><mml:math id="mml-ieqn-68"><mml:mi>x</mml:mi></mml:math></inline-formula> to compute <inline-formula id="ieqn-69"><mml:math id="mml-ieqn-69"><mml:mi>v</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula>:
<disp-formula id="eqn-7"><label>(7)</label><mml:math id="mml-eqn-7" display="block"><mml:mtable rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mfrac><mml:mn>1</mml:mn><mml:mi>N</mml:mi></mml:mfrac><mml:msubsup><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:msubsup><mml:msub><mml:mi mathvariant="normal">&#x2207;</mml:mi><mml:mrow><mml:mrow><mml:msup><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msup></mml:mrow></mml:mrow></mml:msub><mml:mi>J</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msup><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msup><mml:mo>,</mml:mo><mml:mi>y</mml:mi><mml:mo>;</mml:mo><mml:mtext>&#x00A0;</mml:mtext><mml:mi>&#x03B8;</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi mathvariant="normal">&#x2207;</mml:mi><mml:mrow><mml:mi>x</mml:mi></mml:mrow></mml:msub><mml:mi>J</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>x</mml:mi><mml:mo>,</mml:mo><mml:mi>y</mml:mi><mml:mo>;</mml:mo><mml:mtext>&#x00A0;</mml:mtext><mml:mi>&#x03B8;</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula></p>
<p>Here, <inline-formula id="ieqn-70"><mml:math id="mml-ieqn-70"><mml:msup><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> represents an example sampled from distribution <inline-formula id="ieqn-71"><mml:math id="mml-ieqn-71"><mml:mi>U</mml:mi><mml:mo stretchy="false">[</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mi>b</mml:mi><mml:mo>&#x22C5;</mml:mo><mml:mi>&#x03F5;</mml:mi><mml:msup><mml:mo stretchy="false">)</mml:mo><mml:mrow><mml:mi>d</mml:mi></mml:mrow></mml:msup><mml:mo>,</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mi>b</mml:mi><mml:mo>&#x22C5;</mml:mo><mml:mi>&#x03F5;</mml:mi><mml:msup><mml:mo stretchy="false">)</mml:mo><mml:mrow><mml:mi>d</mml:mi></mml:mrow></mml:msup><mml:mo stretchy="false">]</mml:mo></mml:math></inline-formula>. During the <inline-formula id="ieqn-72"><mml:math id="mml-ieqn-72"><mml:mi>t</mml:mi></mml:math></inline-formula>-th iteration, we employ the gradient variance obtained from the preceding <inline-formula id="ieqn-73"><mml:math id="mml-ieqn-73"><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula>-th iteration to modify the gradient&#x2019;s update direction. In addition, we add a factor <inline-formula id="ieqn-74"><mml:math id="mml-ieqn-74"><mml:mrow><mml:mi mathvariant="normal">&#x03BB;</mml:mi></mml:mrow></mml:math></inline-formula> to control impact of gradient variance on transferability.</p>
<fig id="fig-5">
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_45854-fig-5.tif"/>
</fig>
</sec>
<sec id="s3_3">
<label>3.3</label>
<title>Adaptive Parameter Selection</title>
<p>Optimizing the parameters in the above methods manually can be resource-intensive and susceptible to subjective biases. Hence, we have devised an adaptive parameter optimization method rooted in gradient descent. When provided with an adversarial example denoted as <inline-formula id="ieqn-96"><mml:math id="mml-ieqn-96"><mml:msup><mml:mi>x</mml:mi><mml:mrow><mml:mi>a</mml:mi><mml:mi>d</mml:mi><mml:mi>v</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula>, the model&#x2019;s prediction <inline-formula id="ieqn-97"><mml:math id="mml-ieqn-97"><mml:mi>y</mml:mi><mml:mo>=</mml:mo><mml:mi>f</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:msup><mml:mi>x</mml:mi><mml:mrow><mml:mi>a</mml:mi><mml:mi>d</mml:mi><mml:mi>v</mml:mi></mml:mrow></mml:msup><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula>, and loss function <inline-formula id="ieqn-98"><mml:math id="mml-ieqn-98"><mml:mi>L</mml:mi><mml:mo>=</mml:mo><mml:mi>J</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:msup><mml:mi>x</mml:mi><mml:mrow><mml:mi>a</mml:mi><mml:mi>d</mml:mi><mml:mi>v</mml:mi></mml:mrow></mml:msup><mml:mo>,</mml:mo><mml:mi>y</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula>. In this approach, we replace <inline-formula id="ieqn-99"><mml:math id="mml-ieqn-99"><mml:mi>N</mml:mi></mml:math></inline-formula>, <inline-formula id="ieqn-100"><mml:math id="mml-ieqn-100"><mml:mi>b</mml:mi></mml:math></inline-formula>, and <inline-formula id="ieqn-101"><mml:math id="mml-ieqn-101"><mml:mrow><mml:mi mathvariant="normal">&#x03BB;</mml:mi></mml:mrow></mml:math></inline-formula> from Algorithm 1 with <inline-formula id="ieqn-102"><mml:math id="mml-ieqn-102"><mml:msup><mml:mi>&#x03B8;</mml:mi><mml:mrow><mml:mi>a</mml:mi><mml:mi>d</mml:mi><mml:mi>v</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula>. With an original image, a learning rate <inline-formula id="ieqn-103"><mml:math id="mml-ieqn-103"><mml:mi>l</mml:mi><mml:mi>r</mml:mi></mml:math></inline-formula>, and the corresponding adversarial example <inline-formula id="ieqn-104"><mml:math id="mml-ieqn-104"><mml:msup><mml:mi>x</mml:mi><mml:mrow><mml:mi>a</mml:mi><mml:mi>d</mml:mi><mml:mi>v</mml:mi></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mi>g</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo>;</mml:mo><mml:msup><mml:mi>&#x03B8;</mml:mi><mml:mrow><mml:mi>a</mml:mi><mml:mi>d</mml:mi><mml:mi>v</mml:mi></mml:mrow></mml:msup><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula>, the loss function can be expressed as <inline-formula id="ieqn-105"><mml:math id="mml-ieqn-105"><mml:mi>L</mml:mi><mml:mo>=</mml:mo><mml:msup><mml:mi>J</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo>,</mml:mo><mml:mi>y</mml:mi><mml:mo>;</mml:mo><mml:mtext>&#x00A0;</mml:mtext><mml:msup><mml:mi>&#x03B8;</mml:mi><mml:mrow><mml:mi>a</mml:mi><mml:mi>d</mml:mi><mml:mi>v</mml:mi></mml:mrow></mml:msup><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula>. The gradient <inline-formula id="ieqn-106"><mml:math id="mml-ieqn-106"><mml:msub><mml:mi mathvariant="normal">&#x2207;</mml:mi><mml:mrow><mml:mrow><mml:msup><mml:mi>&#x03B8;</mml:mi><mml:mrow><mml:mi>a</mml:mi><mml:mi>d</mml:mi><mml:mi>v</mml:mi></mml:mrow></mml:msup></mml:mrow></mml:mrow></mml:msub><mml:msup><mml:mi>J</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:math></inline-formula> can be derived from <inline-formula id="ieqn-107"><mml:math id="mml-ieqn-107"><mml:msup><mml:mi>J</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo stretchy="false">(</mml:mo><mml:mo>.</mml:mo><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula>, facilitating the parameter update process:
<disp-formula id="eqn-8"><label>(8)</label><mml:math id="mml-eqn-8" display="block"><mml:mtable rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:msubsup><mml:mi>&#x03B8;</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>a</mml:mi><mml:mi>d</mml:mi><mml:mi>v</mml:mi></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:msubsup><mml:mi>&#x03B8;</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mrow><mml:mi>a</mml:mi><mml:mi>d</mml:mi><mml:mi>v</mml:mi></mml:mrow></mml:msubsup><mml:mo>+</mml:mo><mml:mi>l</mml:mi><mml:mi>r</mml:mi><mml:mo>&#x22C5;</mml:mo><mml:msub><mml:mi mathvariant="normal">&#x2207;</mml:mi><mml:mrow><mml:mrow><mml:msup><mml:mi>&#x03B8;</mml:mi><mml:mrow><mml:mi>a</mml:mi><mml:mi>d</mml:mi><mml:mi>v</mml:mi></mml:mrow></mml:msup></mml:mrow></mml:mrow></mml:msub><mml:msub><mml:mi>J</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:msup><mml:mi>&#x03B8;</mml:mi><mml:mrow><mml:mi>a</mml:mi><mml:mi>d</mml:mi><mml:mi>v</mml:mi></mml:mrow></mml:msup><mml:mo>,</mml:mo><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mi>a</mml:mi><mml:mi>d</mml:mi><mml:mi>v</mml:mi></mml:mrow></mml:msubsup><mml:mo>,</mml:mo><mml:msubsup><mml:mi>y</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mi>a</mml:mi><mml:mi>d</mml:mi><mml:mi>v</mml:mi></mml:mrow></mml:msubsup><mml:mo>)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula></p>
<p>Notably, our primary aim here is to increase the loss, effectively constituting a gradient ascent procedure. Given the need to generate corresponding adversarial examples in each iteration of the gradient update, we opt for a stochastic gradient ascent approach to manage computational costs. The parameter search process is concisely outlined in Algorithm 2.</p>
</sec>
</sec>
<sec id="s4">
<label>4</label>
<title>Experiments</title>
<p>In this section, a set of experiments is carried out using the LiveDet2019 and LiveDet2017 datasets to assess the effectiveness of the method. Initially, we delineate the specific experimental configurations and subsequently compare our success rate in performing attacks with other methods across various settings. It is important to emphasize that FLD constitutes a binary classification task. In the case of non-targeted attack on N categorized datasets, the model is tasked with classifying images into the remaining N-1 classes. In contrast, within the context of the binary classification task, images are categorized exclusively as either genuine or counterfeit. This inherent difference results in an appreciably lower success rate for binary classification attacks compared to their multi-class counterparts. Empirical findings also demonstrate that our method can enhance the transferability of adversarial attacks while improving visual effects compared to alternative methods.</p>
<sec id="s4_1">
<label>4.1</label>
<title>Experimental Setup</title>
<sec id="s4_1_1">
<label>4.1.1</label>
<title>Dataset</title>
<p>In terms of data distribution and image quality, the dataset originates from the Liveness Detection Competitions of 2019 and 2017 (LiveDet2019 and LiveDet2017). These datasets consist of fingerprint images gathered by different sensors such as Digital Persona, Orcathus Sensors, and Green Bit. Each sensor&#x0027;s image collection comprises both genuine fingerprint images and counterfeit fingerprints crafted from a variety of materials such as Ecoflex, Latex and Gelatine.</p>
<p>Since the different quality of fingerprint images collected by different sensors, we have made the deliberate choice to exclusively utilize images gathered by the Digital Persona sensor for the dataset. Additionally, to maintain a balance in the quantities of counterfeit and live fingerprints, our dataset includes only counterfeit fingerprints derived from the initial three materials: Ecoflex, Gelatine, and Latex. This selection aims to ensure a more even distribution of features extracted during the training of our network model, thereby enhancing the model&#x0027;s classification accuracy. Every image in our dataset has undergone resizing to align with the input size required by our model, transforming the original 252 &#x00D7; 324 dimensions to 224 &#x00D7; 224. This meticulously curated dataset serves as the training data for our network model. In the context of testing adversarial attacks, 1000 images that can be reliably classified are selected to test the attack performance.</p>
</sec>
<sec id="s4_1_2">
<label>4.1.2</label>
<title>Metrics</title>
<p>In this paper, the performance of adversarial examples is evaluated from two aspects: (1) Transferability, as the ability to deceive the black-box model is essential for effective adversarial attacks. (2) Image quality, that is, the size of the introduced perturbation, we use the Peak Signal-to-Noise Ratio (PSNR) value as the evaluation metric.</p>
</sec>
<sec id="s4_1_3">
<label>4.1.3</label>
<title>Baselines</title>
<p>We have chosen gradient-based iterative adversarial attacks commonly employed in the field as our baseline, specifically, I-FGSM, MI-FGSM, and VMI-FGSM. It is worth noting that VMI-FGSM has been empirically demonstrated to exhibit superior transferability compared to other attack methods.</p>
</sec>
<sec id="s4_1_4">
<label>4.1.4</label>
<title>Models Choice</title>
<p>In the performance test, five classic networks, specifically, Inception-v3, Inception-v1, Inception-resnet-v2, VGG-16 and Mobilenet-v1, are selected to analyze the performance of different schemes. In addition, we combined two adversarial training models, namely Inception-v3<sub>adv</sub>, Inception-resnet-v2<sub>adv</sub>, to evaluate the robustness of adversarial attacks.</p>
</sec>
<sec id="s4_1_5">
<label>4.1.5</label>
<title>Hyper-Parameters Setting</title>
<p>In the experimental setup, we still use the relevant parameters in our previous work [<xref ref-type="bibr" rid="ref-15">15</xref>], where the magnitude of the perturbation is set to <inline-formula id="ieqn-108"><mml:math id="mml-ieqn-108"><mml:mi>&#x03F5;</mml:mi></mml:math></inline-formula> &#x003D; 0.16. The pixel values range within [0, 1], iteration number <inline-formula id="ieqn-109"><mml:math id="mml-ieqn-109"><mml:mi>T</mml:mi></mml:math></inline-formula> &#x003D; 10, and factor <inline-formula id="ieqn-110"><mml:math id="mml-ieqn-110"><mml:mi>&#x03BC;</mml:mi></mml:math></inline-formula> &#x003D; 1.0. For our method, we establish neighborhood bound <inline-formula id="ieqn-111"><mml:math id="mml-ieqn-111"><mml:mi>b</mml:mi></mml:math></inline-formula> &#x003D; 1.5 and factor <inline-formula id="ieqn-112"><mml:math id="mml-ieqn-112"><mml:mrow><mml:mi mathvariant="normal">&#x03BB;</mml:mi></mml:mrow></mml:math></inline-formula> &#x003D; 1.5. Notably, we have observed that the attack success rate tends to stabilize when the number of samples reaches 10, prompting us to set <inline-formula id="ieqn-113"><mml:math id="mml-ieqn-113"><mml:mi>N</mml:mi></mml:math></inline-formula> &#x003D; 10 for our experiments. Furthermore, we introduce variations in <inline-formula id="ieqn-114"><mml:math id="mml-ieqn-114"><mml:mi>&#x03F5;</mml:mi></mml:math></inline-formula>, within different attack methods to conduct a comparative analysis. Specifically, we adjust <inline-formula id="ieqn-115"><mml:math id="mml-ieqn-115"><mml:mi>&#x03F5;</mml:mi></mml:math></inline-formula> to take on values of 0.03, 0.06, 0.09, 0.12, and 0.16, respectively, enabling us to assess the performance of our method alongside other techniques under varying perturbation levels.</p>
</sec>
</sec>
<sec id="s4_2">
<label>4.2</label>
<title>Experimental Results</title>
<sec id="s4_2_1">
<label>4.2.1</label>
<title>Transferability</title>
<p>First, the attack success rates of different network models I-FGSM, MI-FGSM, VMI-FGSM and ours are evaluated using LiveDet2019 and LiveDet2017 datasets at a fixed perturbation size, and the outcomes are summarized in <xref ref-type="table" rid="table-1">Tables 1</xref> and <xref ref-type="table" rid="table-2"> 2</xref>. The rows represent the attacked model, and adversarial examples are generated based on models in columns. Each neural network is trained using the designated dataset. Notably, the results in the table indicate that our proposed method consistently achieves a superior attack success rate when pitted against unknown models. Furthermore, it sustains its attack performance when confronted with the white-box model.</p>
<table-wrap id="table-1">
<label>Table 1</label>
<caption>
<title>Attack success rate on different models on LiveDet2019</title>
</caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th>Model</th>
<th>Attack</th>
<th>Inc-v3</th>
<th>Inc-v1</th>
<th>IncRes-v2</th>
<th>VGG-16</th>
<th>Mobilenet</th>
</tr>
</thead>
<tbody>
<tr>
<td rowspan="4">Inc-v3</td>
<td>I-FGSM</td>
<td>92.9%</td>
<td>22.3%</td>
<td>7.4%</td>
<td>3.4%</td>
<td>43.9%</td>
</tr>
<tr>
<td>MI-FGSM</td>
<td>97.2%</td>
<td>39.4%</td>
<td>19.1%</td>
<td>6.9%</td>
<td>45.3%</td>
</tr>
<tr>
<td>VMI-FGSM</td>
<td>97.4%</td>
<td>40.8%</td>
<td>27.7%</td>
<td>8.7%</td>
<td>52.5%</td>
</tr>
<tr>
<td><bold>Ours</bold></td>
<td>96.1%</td>
<td>47.3%</td>
<td>29.2%</td>
<td>11.7%</td>
<td>46.8%</td>
</tr>
<tr>
<td rowspan="4">Inc-v1</td>
<td>I-FGSM</td>
<td>15.2%</td>
<td>99.3%</td>
<td>13.7%</td>
<td>8.4%</td>
<td>42.1%</td>
</tr>
<tr>
<td>MI-FGSM</td>
<td>37.5%</td>
<td>99.1%</td>
<td>35.1%</td>
<td>19.6%</td>
<td>50.4%</td>
</tr>
<tr>
<td>VMI-FGSM</td>
<td>53.7%</td>
<td>99.2%</td>
<td>59.7%</td>
<td>30.7%</td>
<td>70.4%</td>
</tr>
<tr>
<td><bold>Ours</bold></td>
<td>58.4%</td>
<td>99.2%</td>
<td>60.9%</td>
<td>36.5%</td>
<td>71.7%</td>
</tr>
<tr>
<td rowspan="4">IncRes-v2</td>
<td>I-FGSM</td>
<td>20.8%</td>
<td>26.9%</td>
<td>97.8%</td>
<td>9.2%</td>
<td>41.9%</td>
</tr>
<tr>
<td>MI-FGSM</td>
<td>53.2%</td>
<td>60.3%</td>
<td>97.6%</td>
<td>23.8%</td>
<td>43.8%</td>
</tr>
<tr>
<td>VMI-FGSM</td>
<td>80.3%</td>
<td>87.2%</td>
<td>97.4%</td>
<td>39.7%</td>
<td>45.2%</td>
</tr>
<tr>
<td><bold>Ours</bold></td>
<td>82.1%</td>
<td>91.5%</td>
<td>97.6%</td>
<td>48.1%</td>
<td>49.9%</td>
</tr>
<tr>
<td rowspan="4">VGG-16</td>
<td>I-FGSM</td>
<td>11.1%</td>
<td>14.7%</td>
<td>8.3%</td>
<td>95.4%</td>
<td>35.4%</td>
</tr>
<tr>
<td>MI-FGSM</td>
<td>25.5%</td>
<td>33.7%</td>
<td>29.6%</td>
<td>95.1%</td>
<td>45.3%</td>
</tr>
<tr>
<td>VMI-FGSM</td>
<td>39.8%</td>
<td>48.1%</td>
<td>46.8%</td>
<td>95.6%</td>
<td>48.2%</td>
</tr>
<tr>
<td><bold>Ours</bold></td>
<td>45.4%</td>
<td>52.0%</td>
<td>45.9%</td>
<td>96.1%</td>
<td>48.8%</td>
</tr>
<tr>
<td rowspan="4">Mobilenet</td>
<td>I-FGSM</td>
<td>9.9%</td>
<td>4.5%</td>
<td>2.0%</td>
<td>3.1%</td>
<td>97.4%</td>
</tr>
<tr>
<td>MI-FGSM</td>
<td>22.4%</td>
<td>12.4%</td>
<td>5.7%</td>
<td>8.2%</td>
<td>97.6%</td>
</tr>
<tr>
<td>VMI-FGSM</td>
<td>30.1%</td>
<td>10.7%</td>
<td>3.3%</td>
<td>10.3%</td>
<td>97.2%</td>
</tr>
<tr>
<td><bold>Ours</bold></td>
<td>45.1%</td>
<td>25.3%</td>
<td>19.3%</td>
<td>17.5%</td>
<td>97.8%</td>
</tr>
</tbody>
</table>
</table-wrap><table-wrap id="table-2">
<label>Table 2</label>
<caption>
<title>Attack success rate on different models on LiveDet2017</title>
</caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th>Model</th>
<th>Attack</th>
<th>Inc-v3</th>
<th>Inc-v1</th>
<th>IncRes-v2</th>
<th>VGG-16</th>
<th>Mobilenet</th>
</tr>
</thead>
<tbody>
<tr>
<td rowspan="4">Inc-v3</td>
<td>I-FGSM</td>
<td>95.8%</td>
<td>22.6%</td>
<td>12.8%</td>
<td>6.1%</td>
<td>43.8%</td>
</tr>
<tr>
<td>MI-FGSM</td>
<td>97.5%</td>
<td>38.4%</td>
<td>20.4%</td>
<td>9.6%</td>
<td>45.2%</td>
</tr>
<tr>
<td>VMI-FGSM</td>
<td>97.1%</td>
<td>45.0%</td>
<td>25.6%</td>
<td>13.5%</td>
<td>54.9%</td>
</tr>
<tr>
<td><bold>Ours</bold></td>
<td>96.2%</td>
<td>48.5%</td>
<td>27.5%</td>
<td>14.2%</td>
<td>56.0%</td>
</tr>
<tr>
<td rowspan="4">Inc-v1</td>
<td>I-FGSM</td>
<td>17.2%</td>
<td>97.3%</td>
<td>15.6%</td>
<td>10.2%</td>
<td>45.1%</td>
</tr>
<tr>
<td>MI-FGSM</td>
<td>35.4%</td>
<td>98.1%</td>
<td>33.1%</td>
<td>22.7%</td>
<td>53.9%</td>
</tr>
<tr>
<td>VMI-FGSM</td>
<td>47.7%</td>
<td>98.2%</td>
<td>55.8%</td>
<td>33.9%</td>
<td>68.4%</td>
</tr>
<tr>
<td><bold>Ours</bold></td>
<td>52.9%</td>
<td>98.2%</td>
<td>62.3%</td>
<td>35.2%</td>
<td>70.3%</td>
</tr>
<tr>
<td rowspan="4">IncRes-v2</td>
<td>I-FGSM</td>
<td>23.5%</td>
<td>27.5%</td>
<td>97.4%</td>
<td>8.8%</td>
<td>42.3%</td>
</tr>
<tr>
<td>MI-FGSM</td>
<td>55.4%</td>
<td>61.5%</td>
<td>97.6%</td>
<td>20.1%</td>
<td>44.2%</td>
</tr>
<tr>
<td>VMI-FGSM</td>
<td>75.6%</td>
<td>86.3%</td>
<td>97.4%</td>
<td>43.4%</td>
<td>46.8%</td>
</tr>
<tr>
<td><bold>Ours</bold></td>
<td>80.3%</td>
<td>91.0%</td>
<td>96.9%</td>
<td>46.1%</td>
<td>48.8%</td>
</tr>
<tr>
<td rowspan="4">VGG-16</td>
<td>I-FGSM</td>
<td>9.2%</td>
<td>12.0%</td>
<td>7.2%</td>
<td>94.4%</td>
<td>36.5%</td>
</tr>
<tr>
<td>MI-FGSM</td>
<td>20.6%</td>
<td>36.2%</td>
<td>23.1%</td>
<td>96.2%</td>
<td>45.2%</td>
</tr>
<tr>
<td>VMI-FGSM</td>
<td>33.8%</td>
<td>44.7%</td>
<td>42.7%</td>
<td>96.9%</td>
<td>45.9%</td>
</tr>
<tr>
<td><bold>Ours</bold></td>
<td>38.7%</td>
<td>48.9%</td>
<td>42.3%</td>
<td>96.7%</td>
<td>47.3%</td>
</tr>
<tr>
<td rowspan="4">Mobilenet</td>
<td>I-FGSM</td>
<td>8.1%</td>
<td>5.1%</td>
<td>3.5%</td>
<td>2.9%</td>
<td>97.2%</td>
</tr>
<tr>
<td>MI-FGSM</td>
<td>22.5%</td>
<td>13.6%</td>
<td>6.1%</td>
<td>7.9%</td>
<td>97.6%</td>
</tr>
<tr>
<td>VMI-FGSM</td>
<td>36.7%</td>
<td>15.8%</td>
<td>10.4%</td>
<td>11.2%</td>
<td>97.6%</td>
</tr>
<tr>
<td><bold>Ours</bold></td>
<td>41.8%</td>
<td>28.0%</td>
<td>15.4%</td>
<td>15.1%</td>
<td>97.7%</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>Taking <xref ref-type="table" rid="table-1">Table 1</xref> as an example, in the context of a white-box attack, the attack success rate of each method based on Inception-resnet-v2 exceeds 97%. For black-box attacks targeting Mobilenet and Inception-v1, our proposed method attains success rates of 91.5% and 49.9%, respectively. In comparison, VMI yields success rates of 87.2% and 45.2% for these models. It is also observed that when the architecture of the black-box model closely resembles that of the target model, the attack exhibits higher success rates. This underscores the robust transferability of our approach across a variety of models. When using the LiveDet2017 dataset, <xref ref-type="table" rid="table-2">Table 2</xref> presents similar results.</p>

<p>Additionally, we test the robustness of different methods by challenging three network models that have undergone adversarial training, as depicted in <xref ref-type="table" rid="table-3">Table 3</xref>. The experimental findings demonstrate that our method exhibits greater robustness when faced with adversarially trained models.</p>
<table-wrap id="table-3">
<label>Table 3</label>
<caption>
<title>Attack success rate on adversarially trained models</title>
</caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th>Model</th>
<th>Attack</th>
<th>Inc-v3<sub>adv</sub></th>
<th>Inc-Res <sub>adv</sub></th>
</tr>
</thead>
<tbody>
<tr>
<td rowspan="4">Inc-v3</td>
<td>I-FGSM</td>
<td>11.2%</td>
<td>2.4%</td>
</tr>
<tr>
<td>MI-FGSM</td>
<td>30.1%</td>
<td>9.5%</td>
</tr>
<tr>
<td>VMI-FGSM</td>
<td>43.8%</td>
<td>17.6%</td>
</tr>
<tr>
<td><bold>Ours</bold></td>
<td>46.9%</td>
<td>18.7%</td>
</tr>
<tr>
<td rowspan="4">Inc-v1</td>
<td>I-FGSM</td>
<td>1.9%</td>
<td>2.0%</td>
</tr>
<tr>
<td>MI-FGSM</td>
<td>7.3%</td>
<td>8.9%</td>
</tr>
<tr>
<td>VMI-FGSM</td>
<td>12.5%</td>
<td>13.1%</td>
</tr>
<tr>
<td><bold>Ours</bold></td>
<td>15.6%</td>
<td>17.1%</td>
</tr>
<tr>
<td rowspan="4">IncRes-v2</td>
<td>I-FGSM</td>
<td>3.6%</td>
<td>15.4%</td>
</tr>
<tr>
<td>MI-FGSM</td>
<td>10.2%</td>
<td>33.8%</td>
</tr>
<tr>
<td>VMI-FGSM</td>
<td>18.3%</td>
<td>45.1%</td>
</tr>
<tr>
<td><bold>Ours</bold></td>
<td>22.3%</td>
<td>47.5%</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>To further investigate the transferability of adversarial examples under varying levels of perturbation, we conducted experiments as presented in <xref ref-type="table" rid="table-4">Table 4</xref>. Rows represent the attack methods employed, while columns denote the perturbation sizes set at 0.03, 0.06, 0.09, 0.12, and 0.16, respectively, with pixel values confined to [0, 1]. All attacks are conducted on Inception-v3, and the reported results represent the average black-box attack success rates, consistent with those detailed in <xref ref-type="table" rid="table-1">Tables 1</xref> and <xref ref-type="table" rid="table-2">2</xref>. In <xref ref-type="fig" rid="fig-3">Fig. 3</xref>, we provide visualizations of a counterfeit fingerprint image and corresponding adversarial examples with different perturbation magnitudes. Due to the limitation of the perturbation region, the noise in the image is not obvious. As the perturbation increases, the black-box attack success rate will be higher. For instance, at &#x03F5; &#x003D; 0.16, the proposed method achieves a remarkable 35.1% success rate in attacks across various models, surpassing the performance of any other method.</p>
<table-wrap id="table-4">
<label>Table 4</label>
<caption>
<title>Attack success rate on Inception-v3 with different perturbation sizes <inline-formula id="ieqn-116"><mml:math id="mml-ieqn-116"><mml:mi mathvariant="bold-italic">&#x03F5;</mml:mi></mml:math></inline-formula></title>
</caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th>Attack</th>
<th>0.03</th>
<th>0.06</th>
<th>0.09</th>
<th>0.12</th>
<th>0.16</th>
</tr>
</thead>
<tbody>
<tr>
<td>I-FGSM</td>
<td>5.4%</td>
<td>7.1%</td>
<td>9.7%</td>
<td>13.2%</td>
<td>19.3%</td>
</tr>
<tr>
<td>MI-FGSM</td>
<td>6.2%</td>
<td>10.1%</td>
<td>13.5%</td>
<td>16.9%</td>
<td>27.7%</td>
</tr>
<tr>
<td>VMI-FGSM</td>
<td>8.9%</td>
<td>13.8%</td>
<td>17.6%</td>
<td>22.7%</td>
<td>32.4%</td>
</tr>
<tr>
<td>Ours</td>
<td>9.5%</td>
<td>14.5%</td>
<td>19.1%</td>
<td>24.5%</td>
<td>35.1%</td>
</tr>
</tbody>
</table>
</table-wrap><fig id="fig-3">
<label>Figure 3</label>
<caption>
<title>Adversarial examples generated by Ours with different <inline-formula id="ieqn-117"><mml:math id="mml-ieqn-117"><mml:mi mathvariant="bold-italic">&#x03F5;</mml:mi></mml:math></inline-formula> on Inception-v3</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_45854-fig-3.tif"/>
</fig>
<p>It is worth noting that although it may be difficult for human observers to detect alterations in the image with the increase of perturbation, the model is more vulnerable to deception because its feature perception is different from that of human beings.</p>
</sec>
<sec id="s4_2_2">
<label>4.2.2</label>
<title>Attack with Input Transformations</title>
<p>Input transformations, such as DIM, TIM, and SIM, can be seamlessly integrated with gradient-based adversarial attacks to significantly bolster transferability. In this paper, these input transformations have been incorporated into our method, resulting in a demonstrable enhancement of transferability. As detailed in <xref ref-type="table" rid="table-5">Table 5</xref>, success rates exhibit further improvement across various models, with our proposed method consistently outperforming the baseline. These findings provide additional compelling evidence for the efficacy of our approach.</p>
<table-wrap id="table-5">
<label>Table 5</label>
<caption>
<title>Attack success rate of adversarial examples generated on different models enhanced by CTM</title>
</caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th>Model</th>
<th>Attack</th>
<th>Inc-v3</th>
<th>Inc-v1</th>
<th>IncRes-v2</th>
<th>VGG-16</th>
<th>Mobilenet</th>
</tr>
</thead>
<tbody>
<tr>
<td/>
<td>MI-CT-FGSM</td>
<td>96.8%</td>
<td>67.8%</td>
<td>53.2%</td>
<td>32.0%</td>
<td>61.4%</td>
</tr>
<tr>
<td>Inc-v3</td>
<td>VMI-CT-FGSM</td>
<td>97.4%</td>
<td>71.4%</td>
<td>55.5%</td>
<td>39.3%</td>
<td>72.5%</td>
</tr>
<tr>
<td/>
<td><bold>Ours-CT</bold></td>
<td>95.8%</td>
<td>72.9%</td>
<td>58.4%</td>
<td>39.8%</td>
<td>67.8%</td>
</tr>
<tr>
<td/>
<td>MI-CT-FGSM</td>
<td>67.2%</td>
<td>98.7%</td>
<td>73.0%</td>
<td>51.8%</td>
<td>57.4%</td>
</tr>
<tr>
<td>Inc-v1</td>
<td>VMI-CT-FGSM</td>
<td>53.7%</td>
<td>98.5%</td>
<td>68.7%</td>
<td>71.4%</td>
<td>75.8%</td>
</tr>
<tr>
<td/>
<td><bold>Ours-CT</bold></td>
<td>57.1%</td>
<td>98.5%</td>
<td>69.5%</td>
<td>72.6%</td>
<td>76.2%</td>
</tr>
<tr>
<td/>
<td>MI-CT-FGSM</td>
<td>83.7%</td>
<td>85.3%</td>
<td>97.7%</td>
<td>76.6%</td>
<td>58.0%</td>
</tr>
<tr>
<td>IncRes-v2</td>
<td>VMI-CT-FGSM</td>
<td>87.5%</td>
<td>87.2%</td>
<td>98.1%</td>
<td>75.7%</td>
<td>61.8%</td>
</tr>
<tr>
<td/>
<td><bold>Ours-CT</bold></td>
<td>88.1%</td>
<td>92.3%</td>
<td>98.3%</td>
<td>77.0%</td>
<td>63.9%</td>
</tr>
<tr>
<td/>
<td>MI-CT-FGSM</td>
<td>48.4%</td>
<td>53.1%</td>
<td>49.9%</td>
<td>96.2%</td>
<td>56.8%</td>
</tr>
<tr>
<td>VGG-16</td>
<td>VMI-CT-FGSM</td>
<td>52.7%</td>
<td>59.2%</td>
<td>52.3%</td>
<td>96.1%</td>
<td>61.9%</td>
</tr>
<tr>
<td/>
<td><bold>Ours-CT</bold></td>
<td>55.4%</td>
<td>60.0%</td>
<td>53.2%</td>
<td>96.2%</td>
<td>59.8%</td>
</tr>
<tr>
<td/>
<td>MI-CT-FGSM</td>
<td>39.1%</td>
<td>23.5%</td>
<td>19.6%</td>
<td>23.3%</td>
<td>98.4%</td>
</tr>
<tr>
<td>Mobilenet</td>
<td>VMI-CT-FGSM</td>
<td>43.2%</td>
<td>28.8%</td>
<td>13.6%</td>
<td>24.3%</td>
<td>98.6%</td>
</tr>
<tr>
<td/>
<td><bold>Ours-CT</bold></td>
<td>58.4%</td>
<td>44.5%</td>
<td>37.6%</td>
<td>31.0%</td>
<td>98.8%</td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
<sec id="s4_2_3">
<label>4.2.3</label>
<title>Quantitative Analysis of Visual Quality</title>
<p>Moreover, the PSNR metric has also been introduced to evaluate the quality of adversarial fingerprint images. As presented in <xref ref-type="table" rid="table-6">Table 6</xref>, when compared to alternative attack methods, the adversarial fingerprints generated by our method exhibit a notably higher PSNR value, signifying superior visual quality. Again, the scheme proposed in this paper is effective.</p>
<table-wrap id="table-6">
<label>Table 6</label>
<caption>
<title>PSNR values of adversarial examples generated by different methods</title>
</caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th>Datasets</th>
<th>I-FGSM</th>
<th>MI-FGSM</th>
<th>VMI-FGSM</th>
<th>Ours</th>
</tr>
</thead>
<tbody>
<tr>
<td>LiveDet2019</td>
<td>18.7</td>
<td>18.9</td>
<td>18.6</td>
<td>22.3</td>
</tr>
<tr>
<td>LiveDet2017</td>
<td>18.8</td>
<td>18.9</td>
<td>18.8</td>
<td>22.2</td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
</sec>
</sec>
<sec id="s5">
<label>5</label>
<title>Conclusion and Future Work</title>
<p>FLD based on deep learning not only suffers from spoofing attacks of forged fingerprints, but also faces the deceptive attacks problem of adversarial fingerprints. The existing FLD research tasks lack the study of adversarial examples, and the transferability of adversarial attacks in the face of unknown network models is generally poor. To solve the above problems, we propose an adversarial attack method based on local adaptive gradient variance, which is designed to enhance the transferability of adversarial attacks and improve the visual quality, to further enhance the security of the fingerprint recognition system. Initially, we constrain the perturbation generation range and formulate gradient variance as the squared difference between the current gradient and the average gradient of the neighborhood during each iteration. Subsequently, during the generation of adversarial examples at each iteration, we optimize the current gradient direction based on the gradient variance from the previous iteration. To address the challenge of selecting appropriate parameters, this paper proposes an adaptive parameter search method that employs gradient ascent to identify the optimal solution.</p>
<p>Experimental results reveal that our proposed method can effectively enhance the transferability of adversarial attacks and further improve the visual quality while maintaining a high success rate for white-box attacks. These findings underscore the current vulnerabilities of DFFD systems, which struggle to withstand adversarial attacks. While black-box attacks have demonstrated feasibility, there remains room for improving their success rates, albeit at the cost of elevated computational complexity in generating adversarial examples. These challenges merit further exploration in future research, with an emphasis on developing more robust defenses against such attacks.</p>
</sec>
</body>
<back>
<ack>
<p>We are grateful to Nanjing University of Information Science and Technology for providing a research environment and computing equipment.</p>
</ack>
<sec><title>Funding Statement</title>
<p>This work is supported by the National Natural Science Foundation of China under Grant (62102189; 62122032; 61972205), the National Social Sciences Foundation of China under Grant 2022-SKJJ-C-082, the Natural Science Foundation of Jiangsu Province under Grant BK20200807, NUDT Scientific Research Program under Grant (JS21-4; ZK21-43), Guangdong Natural Science Funds for Distinguished Young Scholar under Grant 2023B1515020041.</p>
</sec>
<sec><title>Author Contributions</title>
<p>Study conception and design: C. Yuan, B. Cui; data collection: B. Cui; analysis and interpretation of results: C. Yuan, B. Cui; draft manuscript preparation: C. Yuan, B. Cui, Z. Zhou, X. Li and Q. M. J. Wu. All authors reviewed the results and approved the final version of the manuscript.</p>
</sec>
<sec sec-type="data-availability"><title>Availability of Data and Materials</title>
<p>All datasets and materials are publicly available.</p>
</sec>
<sec sec-type="COI-statement"><title>Conflicts of Interest</title>
<p>The authors declare that they have no conflicts of interest to report regarding the present study.</p>
</sec>
<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>K.</given-names> <surname>Karampidis</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Rousouliotis</surname></string-name>, <string-name><given-names>E.</given-names> <surname>Linardos</surname></string-name> and <string-name><given-names>E.</given-names> <surname>Kavallieratou</surname></string-name></person-group>, &#x201C;<article-title>A comprehensive survey of fingerprint presentation attack detection</article-title>,&#x201D; <source>Journal of Surveillance, Security and Safety</source>, vol. <volume>2</volume>, no. <issue>4</issue>, pp. <fpage>117</fpage>&#x2013;<lpage>161</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>M.</given-names> <surname>Wang</surname></string-name> and <string-name><given-names>W.</given-names> <surname>Deng</surname></string-name></person-group>, &#x201C;<article-title>Deep face recognition: A survey</article-title>,&#x201D; <source>Neurocomputing</source>, vol. <volume>429</volume>, pp. <fpage>215</fpage>&#x2013;<lpage>244</lpage>, <year>2021</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>J.</given-names> <surname>Daugman</surname></string-name></person-group>, &#x201C;<chapter-title>How iris recognition works</chapter-title>,&#x201D; in <source>IEEE Transactions on Circuits and Systems for Video Technology</source>, vol. <volume>14</volume>, no. <issue>1</issue>, pp. <fpage>21</fpage>&#x2013;<lpage>30</lpage>, <year>2004</year>.</mixed-citation></ref>
<ref id="ref-4"><label>[4]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>L.</given-names> <surname>Niu</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Veeraraghavan</surname></string-name> and <string-name><given-names>A.</given-names> <surname>Sabharwal</surname></string-name></person-group>, &#x201C;<article-title>Webly supervised learning meets zero-shot learning: A hybrid approach for fine-grained classification</article-title>,&#x201D; in <conf-name>Proc. of CVPR</conf-name>, <publisher-loc>Salt Lake City, USA</publisher-loc>, pp. <fpage>7171</fpage>&#x2013;<lpage>7180</lpage>, <year>2018</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>G.</given-names> <surname>Hinton</surname></string-name>, <string-name><given-names>L.</given-names> <surname>Deng</surname></string-name>, <string-name><given-names>D.</given-names> <surname>Yu</surname></string-name>, <string-name><given-names>G. E.</given-names> <surname>Dahl</surname></string-name>, <string-name><given-names>A. R.</given-names> <surname>Mohamed</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>Deep neural networks for acoustic modeling in speech recognition: The shared views of four research groups</article-title>,&#x201D; <source>IEEE Signal Processing Magazine</source>, vol. <volume>29</volume>, no. <issue>6</issue>, pp. <fpage>82</fpage>&#x2013;<lpage>97</lpage>, <year>2012</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>J.</given-names> <surname>Long</surname></string-name>, <string-name><given-names>E.</given-names> <surname>Shelhamer</surname></string-name> and <string-name><given-names>T.</given-names> <surname>Darrell</surname></string-name></person-group>, &#x201C;<article-title>Fully convolutional networks for semantic segmentation</article-title>,&#x201D; <source>IEEE Transactions on Pattern Analysis and Machine Intelligence</source>, vol. <volume>39</volume>, no. <issue>4</issue>, pp. <fpage>640</fpage>&#x2013;<lpage>651</lpage>, <year>2015</year>.</mixed-citation></ref>
<ref id="ref-7"><label>[7]</label><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><given-names>I.</given-names> <surname>Sutskever</surname></string-name>, <string-name><given-names>O.</given-names> <surname>Vinyals</surname></string-name> and <string-name><given-names>Q. V.</given-names> <surname>Le</surname></string-name></person-group>, &#x201C;<chapter-title>Sequence to sequence learning with neural networks</chapter-title>,&#x201D; in <source>Advances in Neural Information Processing Systems</source>, vol. <volume>27</volume>. pp. <fpage>3104</fpage>&#x2013;<lpage>3112</lpage>, <year>2014</year>.</mixed-citation></ref>
<ref id="ref-8"><label>[8]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>H.</given-names> <surname>Wang</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Wang</surname></string-name>, <string-name><given-names>Z.</given-names> <surname>Zhou</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Ji</surname></string-name>, <string-name><given-names>D.</given-names> <surname>Gong</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>CosFace: Large margin cosine loss for deep face recognition</article-title>,&#x201D; in <conf-name>Proc. of CVPR</conf-name>, <publisher-loc>Salt Lake City, USA</publisher-loc>, pp. <fpage>5265</fpage>&#x2013;<lpage>5274</lpage>, <year>2018</year>.</mixed-citation></ref>
<ref id="ref-9"><label>[9]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>Z.</given-names> <surname>Zheng</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Yang</surname></string-name>, <string-name><given-names>Z.</given-names> <surname>Yu</surname></string-name>, <string-name><given-names>L.</given-names> <surname>Zheng</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Yang</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>Joint discriminative and generative learning for person re-identification</article-title>,&#x201D; in <conf-name>Proc. of CVPR</conf-name>, <publisher-loc>Long Beach, USA</publisher-loc>, pp. <fpage>2138</fpage>&#x2013;<lpage>2147</lpage>, <year>2019</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>C.</given-names> <surname>Yuan</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Chen</surname></string-name>, <string-name><given-names>P.</given-names> <surname>Yu</surname></string-name>, <string-name><given-names>R.</given-names> <surname>Meng</surname></string-name>, <string-name><given-names>W.</given-names> <surname>Cheng</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>Semi-supervised stacked autoencoder-based deep hierarchical semantic feature for real-time fingerprint liveness detection</article-title>,&#x201D; <source>Journal of Real-Time Image Processing</source>, vol. <volume>17</volume>, no. <issue>1</issue>, pp. <fpage>55</fpage>&#x2013;<lpage>71</lpage>, <year>2020</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>W. E. N.</given-names> <surname>Jian</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Zhou</surname></string-name> and <string-name><given-names>H.</given-names> <surname>Liu</surname></string-name></person-group>, &#x201C;<article-title>Densely connected convolutional network optimized by genetic algorithm for fingerprint liveness detection</article-title>,&#x201D; <source>IEEE Access</source>, vol. <volume>9</volume>, pp. <fpage>2229</fpage>&#x2013;<lpage>2243</lpage>, <year>2020</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>J.</given-names> <surname>Fei</surname></string-name>, <string-name><given-names>Z.</given-names> <surname>Xia</surname></string-name>, <string-name><given-names>P.</given-names> <surname>Yu</surname></string-name> and <string-name><given-names>F.</given-names> <surname>Xiao</surname></string-name></person-group>, &#x201C;<article-title>Adversarial attacks on fingerprint liveness detection</article-title>,&#x201D; <source>EURASIP Journal on Image and Video Processing</source>, vol. <volume>2020</volume>, no. <issue>1</issue>, pp. <fpage>3104</fpage>&#x2013;<lpage>3112</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-13"><label>[13]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>G.</given-names> <surname>Orr&#x00F9;</surname></string-name>, <string-name><given-names>R.</given-names> <surname>Casula</surname></string-name>, <string-name><given-names>P.</given-names> <surname>Tuveri</surname></string-name>, <string-name><given-names>C.</given-names> <surname>Bazzoni</surname></string-name>, <string-name><given-names>G.</given-names> <surname>Dessalvi</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>Livdet in action-fingerprint liveness detection competition 2019</article-title>,&#x201D; in <conf-name>Proc. of ICB</conf-name>, <publisher-loc>Crete, Greece</publisher-loc>, pp. <fpage>1</fpage>&#x2013;<lpage>6</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-14"><label>[14]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>V.</given-names> <surname>Mura</surname></string-name>, <string-name><given-names>G.</given-names> <surname>Orr&#x00F9;</surname></string-name>, <string-name><given-names>R.</given-names> <surname>Casula</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Sibiriu</surname></string-name>, <string-name><given-names>G.</given-names> <surname>Loi</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>LivDet 2017 fingerprint liveness detection competition 2017</article-title>,&#x201D; in <conf-name>Proc. of ICB</conf-name>, <publisher-loc>Gold Coast, Australia</publisher-loc>, pp. <fpage>297</fpage>&#x2013;<lpage>302</lpage>, <year>2018</year>.</mixed-citation></ref>
<ref id="ref-15"><label>[15]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>C.</given-names> <surname>Yuan</surname></string-name> and <string-name><given-names>B.</given-names> <surname>Cui</surname></string-name></person-group>, &#x201C;<article-title>Adversarial attack with adaptive gradient variance for deep fake fingerprint detection</article-title>,&#x201D; in <conf-name>Proc. of MMSP</conf-name>, <publisher-loc>Shanghai, China</publisher-loc>, pp. <fpage>1</fpage>&#x2013;<lpage>6</lpage>, <year>2022</year>.</mixed-citation></ref>
<ref id="ref-16"><label>[16]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><given-names>C.</given-names> <surname>Szegedy</surname></string-name>, <string-name><given-names>W.</given-names> <surname>Zaremba</surname></string-name>, <string-name><given-names>I.</given-names> <surname>Sutskever</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Bruna</surname></string-name>, <string-name><given-names>D.</given-names> <surname>Erhan</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>Intriguing properties of neural networks</article-title>,&#x201D; <comment>arXiv preprint arXiv: 1312.6199</comment>, <year>2014</year>.</mixed-citation></ref>
<ref id="ref-17"><label>[17]</label><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><given-names>H.</given-names> <surname>Tang</surname></string-name> and <string-name><given-names>X.</given-names> <surname>Qin</surname></string-name></person-group>, <source>Practical Methods of Optimization</source>, <edition>1</edition>st ed., <publisher-loc>Dalian, China</publisher-loc>: <publisher-name>Academic Press, Dalian University of Technology Press</publisher-name>, pp. <fpage>138</fpage>&#x2013;<lpage>149</lpage>, <year>2004</year>.</mixed-citation></ref>
<ref id="ref-18"><label>[18]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>S. M.</given-names> <surname>Moosavi-Dezfooli</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Fawzi</surname></string-name> and <string-name><given-names>P.</given-names> <surname>Frossard</surname></string-name></person-group>, &#x201C;<article-title>DeepFool: A simple and accurate method to fool deep neural networks</article-title>,&#x201D; in <conf-name>Proc. of CVPR</conf-name>, <publisher-loc>Las Vegas, USA</publisher-loc>, pp. <fpage>2574</fpage>&#x2013;<lpage>2582</lpage>, <year>2016</year>.</mixed-citation></ref>
<ref id="ref-19"><label>[19]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>N.</given-names> <surname>Carlini</surname></string-name> and <string-name><given-names>D.</given-names> <surname>Wagner</surname></string-name></person-group>, &#x201C;<article-title>Towards evaluating the robustness of neural networks</article-title>,&#x201D; in <conf-name>Proc. of Symp. on Security and Privacy</conf-name>, <publisher-loc>San Jose, USA</publisher-loc>, pp. <fpage>39</fpage>&#x2013;<lpage>57</lpage>, <year>2017</year>.</mixed-citation></ref>
<ref id="ref-20"><label>[20]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><given-names>S.</given-names> <surname>Sarkar</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Bansal</surname></string-name>, <string-name><given-names>U.</given-names> <surname>Mahbub</surname></string-name> and <string-name><given-names>R.</given-names> <surname>Chellappa</surname></string-name></person-group>, &#x201C;<article-title>UPSET and ANGRI: Breaking high performance image classifiers</article-title>,&#x201D; <comment>arXiv preprint arXiv:1707.01159</comment>, <year>2017</year>.</mixed-citation></ref>
<ref id="ref-21"><label>[21]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>A. N.</given-names> <surname>Bhagoji</surname></string-name>, <string-name><given-names>W.</given-names> <surname>He</surname></string-name>, <string-name><given-names>B.</given-names> <surname>Li</surname></string-name> and <string-name><given-names>D.</given-names> <surname>Song</surname></string-name></person-group>, &#x201C;<article-title>Practical black-box attacks on deep neural networks using efficient query mechanisms</article-title>,&#x201D; in <conf-name>Proc. of ECCV</conf-name>, <publisher-loc>Munich, Germany</publisher-loc>, pp. <fpage>3104</fpage>&#x2013;<lpage>3112</lpage>, <year>2018</year>.</mixed-citation></ref>
<ref id="ref-22"><label>[22]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>Y.</given-names> <surname>Dong</surname></string-name>, <string-name><given-names>F.</given-names> <surname>Liao</surname></string-name>, <string-name><given-names>T.</given-names> <surname>Pang</surname></string-name>, <string-name><given-names>H.</given-names> <surname>Su</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Zhu</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>Boosting adversarial attacks with momentum</article-title>,&#x201D; in <conf-name>Proc. of CVPR</conf-name>, <publisher-loc>Salt Lake City, USA</publisher-loc>, pp. <fpage>9185</fpage>&#x2013;<lpage>9193</lpage>, <year>2018</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>J.</given-names> <surname>Su</surname></string-name>, <string-name><given-names>D. V.</given-names> <surname>Vargas</surname></string-name> and <string-name><given-names>K.</given-names> <surname>Sakurai</surname></string-name></person-group>, &#x201C;<article-title>One pixel attack for fooling deep neural networks</article-title>,&#x201D; <source>IEEE Transactions on Evolutionary Computation</source>, vol. <volume>23</volume>, no. <issue>5</issue>, pp. <fpage>828</fpage>&#x2013;<lpage>841</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-24"><label>[24]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><given-names>I. J.</given-names> <surname>Goodfellow</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Shlens</surname></string-name> and <string-name><given-names>C.</given-names> <surname>Szegedy</surname></string-name></person-group>, &#x201C;<article-title>Explaining and harnessing adversarial examples</article-title>,&#x201D; <comment>arXiv preprint arXiv:1412.6572</comment>, <year>2014</year>.</mixed-citation></ref>
<ref id="ref-25"><label>[25]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>A.</given-names> <surname>Kurakin</surname></string-name>, <string-name><given-names>I. J.</given-names> <surname>Goodfellow</surname></string-name> and <string-name><given-names>S.</given-names> <surname>Bengio</surname></string-name></person-group>, &#x201C;<chapter-title>Adversarial examples in the physical world</chapter-title>,&#x201D; in <conf-name>Proc. of Int. Conf. on Learning Representations Workshop</conf-name>, <conf-loc>Toulon, France</conf-loc>, pp. <fpage>1</fpage>&#x2013;<lpage>15</lpage>, <year>2017</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>J.</given-names> <surname>Lin</surname></string-name>, <string-name><given-names>C.</given-names> <surname>Song</surname></string-name>, <string-name><given-names>K.</given-names> <surname>He</surname></string-name>, <string-name><given-names>L.</given-names> <surname>Wang</surname></string-name> and <string-name><given-names>J. E.</given-names> <surname>Hopcroft</surname></string-name></person-group>, &#x201C;<article-title>Nesterov accelerated gradient and scale invariance for adversarial attacks</article-title>,&#x201D; in <conf-name>Proc. of ICLR</conf-name>, <publisher-loc>Addis Ababa, Ethiopia</publisher-loc>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-27"><label>[27]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>X.</given-names> <surname>Wang</surname></string-name> and <string-name><given-names>K.</given-names> <surname>He</surname></string-name></person-group>, &#x201C;<article-title>Enhancing the transferability of adversarial attacks through variance tuning</article-title>,&#x201D; in <conf-name>Proc. of CVPR</conf-name>, <publisher-loc>Nashville, USA</publisher-loc>, pp. <fpage>1924</fpage>&#x2013;<lpage>1933</lpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-28"><label>[28]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>C.</given-names> <surname>Xie</surname></string-name>, <string-name><given-names>Z.</given-names> <surname>Zhang</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Zhou</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Bai</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Wang</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>Improving transferability of adversarial examples with input diversity</article-title>,&#x201D; in <conf-name>Proc. of CVPR</conf-name>, <publisher-loc>Long Beach, USA</publisher-loc>, pp. <fpage>2730</fpage>&#x2013;<lpage>2739</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-29"><label>[29]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>Y.</given-names> <surname>Dong</surname></string-name>, <string-name><given-names>T.</given-names> <surname>Pang</surname></string-name>, <string-name><given-names>H.</given-names> <surname>Su</surname></string-name> and <string-name><given-names>J.</given-names> <surname>Zhu</surname></string-name></person-group>, &#x201C;<article-title>Evading defenses to transferable adversarial examples by translation-invariant attacks</article-title>,&#x201D; in <conf-name>Proc. of CVPR</conf-name>, <publisher-loc>Long Beach, USA</publisher-loc>, pp. <fpage>4312</fpage>&#x2013;<lpage>4321</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-30"><label>[30]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>W.</given-names> <surname>Zhan</surname></string-name>, <string-name><given-names>C.</given-names> <surname>Sun</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Wang</surname></string-name>, <string-name><given-names>J.</given-names> <surname>She</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Zhang</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>An improved Yolov5 real-time detection method for small objects captured by UAV</article-title>,&#x201D; <source>Soft Computing</source>, vol. <volume>26</volume>, pp. <fpage>361</fpage>&#x2013;<lpage>373</lpage>, <year>2022</year>.</mixed-citation></ref>
</ref-list>
</back></article>