<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD Journal Publishing DTD v2.3 20070202//EN" "journalpublishing.dtd">
<article xml:lang="EN" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" article-type="research-article">
<front>
<journal-meta>
<journal-id journal-id-type="publisher-id">Front. Neurorobot.</journal-id>
<journal-title>Frontiers in Neurorobotics</journal-title>
<abbrev-journal-title abbrev-type="pubmed">Front. Neurorobot.</abbrev-journal-title>
<issn pub-type="epub">1662-5218</issn>
<publisher>
<publisher-name>Frontiers Media S.A.</publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="doi">10.3389/fnbot.2024.1490198</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Neuroscience</subject>
<subj-group>
<subject>Original Research</subject>
</subj-group>
</subj-group>
</article-categories>
<title-group>
<article-title>UnionCAM: enhancing CNN interpretability through denoising, weighted fusion, and selective high-quality class activation mapping</article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author" corresp="yes">
<name><surname>Hu</surname> <given-names>Hao</given-names></name>
<xref ref-type="aff" rid="aff1"><sup>1</sup></xref>
<xref ref-type="aff" rid="aff2"><sup>2</sup></xref>
<xref ref-type="corresp" rid="c001"><sup>&#x0002A;</sup></xref>
<uri xlink:href="http://loop.frontiersin.org/people/2830233/overview"/>
<role content-type="https://credit.niso.org/contributor-roles/conceptualization/"/>
<role content-type="https://credit.niso.org/contributor-roles/data-curation/"/>
<role content-type="https://credit.niso.org/contributor-roles/methodology/"/>
<role content-type="https://credit.niso.org/contributor-roles/software/"/>
<role content-type="https://credit.niso.org/contributor-roles/validation/"/>
<role content-type="https://credit.niso.org/contributor-roles/writing-original-draft/"/>
<role content-type="https://credit.niso.org/contributor-roles/writing-review-editing/"/>
</contrib>
<contrib contrib-type="author">
<name><surname>Wang</surname> <given-names>Rui</given-names></name>
<xref ref-type="aff" rid="aff1"><sup>1</sup></xref>
<uri xlink:href="http://loop.frontiersin.org/people/2853181/overview"/>
<role content-type="https://credit.niso.org/contributor-roles/conceptualization/"/>
<role content-type="https://credit.niso.org/contributor-roles/supervision/"/>
<role content-type="https://credit.niso.org/contributor-roles/validation/"/>
<role content-type="https://credit.niso.org/contributor-roles/writing-review-editing/"/>
</contrib>
<contrib contrib-type="author">
<name><surname>Lin</surname> <given-names>Hao</given-names></name>
<xref ref-type="aff" rid="aff3"><sup>3</sup></xref>
<role content-type="https://credit.niso.org/contributor-roles/validation/"/>
<role content-type="https://credit.niso.org/contributor-roles/writing-review-editing/"/>
</contrib>
<contrib contrib-type="author">
<name><surname>Yu</surname> <given-names>Huai</given-names></name>
<xref ref-type="aff" rid="aff4"><sup>4</sup></xref>
<role content-type="https://credit.niso.org/contributor-roles/data-curation/"/>
<role content-type="https://credit.niso.org/contributor-roles/writing-review-editing/"/>
</contrib>
</contrib-group>
<aff id="aff1"><sup>1</sup><institution>The Institute of Computing, China Academy of Railway Sciences Corporation Ltd</institution>, <addr-line>Beijing</addr-line>, <country>China</country></aff>
<aff id="aff2"><sup>2</sup><institution>The Center of National Railway Intelligent Transportation System Engineering and Technology</institution>, <addr-line>Beijing</addr-line>, <country>China</country></aff>
<aff id="aff3"><sup>3</sup><institution>Xi&#x00027;an Jiaotong University</institution>, <addr-line>Xi&#x00027;an</addr-line>, <country>China</country></aff>
<aff id="aff4"><sup>4</sup><institution>Signal and Communication Research Institute, China Academy of Railway Sciences Corporation Ltd</institution>, <addr-line>Beijing</addr-line>, <country>China</country></aff>
<author-notes>
<fn fn-type="edited-by"><p>Edited by: Luca Patan&#x000E9;, University of Messina, Italy</p></fn>
<fn fn-type="edited-by"><p>Reviewed by: Shuqiang Wang, Chinese Academy of Sciences (CAS), China</p>
<p>Ali Abboud, University of Diyala, Iraq</p></fn>
<corresp id="c001">&#x0002A;Correspondence: Hao Hu <email>hhcars11&#x00040;163.com</email></corresp>
</author-notes>
<pub-date pub-type="epub">
<day>14</day>
<month>11</month>
<year>2024</year>
</pub-date>
<pub-date pub-type="collection">
<year>2024</year>
</pub-date>
<volume>18</volume>
<elocation-id>1490198</elocation-id>
<history>
<date date-type="received">
<day>02</day>
<month>09</month>
<year>2024</year>
</date>
<date date-type="accepted">
<day>04</day>
<month>10</month>
<year>2024</year>
</date>
</history>
<permissions>
<copyright-statement>Copyright &#x000A9; 2024 Hu, Wang, Lin and Yu.</copyright-statement>
<copyright-year>2024</copyright-year>
<copyright-holder>Hu, Wang, Lin and Yu</copyright-holder>
<license xlink:href="http://creativecommons.org/licenses/by/4.0/"><p>This is an open-access article distributed under the terms of the Creative Commons Attribution License (CC BY). The use, distribution or reproduction in other forums is permitted, provided the original author(s) and the copyright owner(s) are credited and that the original publication in this journal is cited, in accordance with accepted academic practice. No use, distribution or reproduction is permitted which does not comply with these terms.</p></license>
</permissions>
<abstract>
<p>Deep convolutional neural networks (CNNs) have achieved remarkable success in various computer vision tasks. However, the lack of interpretability in these models has raised concerns and hindered their widespread adoption in critical domains. Generating activation maps that highlight the regions contributing to the CNN&#x00027;s decision has emerged as a popular approach to visualize and interpret these models. Nevertheless, existing methods often produce activation maps contaminated with irrelevant background noise or incomplete object activation, limiting their effectiveness in providing meaningful explanations. To address this challenge, we propose Union Class Activation Mapping (UnionCAM), an innovative visual interpretation framework that generates high-quality class activation maps (CAMs) through a novel three-step approach. UnionCAM introduces a weighted fusion strategy that adaptively combines multiple CAMs to create more informative and comprehensive activation maps. First, the denoising module removes background noise from CAMs by using adaptive thresholding. Subsequently, the union module fuses the denoised CAMs with region-based CAMs using a weighted combination scheme to obtain more comprehensive and informative maps, which we refer to as fused CAMs. Lastly, the activation map selection module automatically selects the optimal CAM that offers the best interpretation from the pool of fused CAMs. Extensive experiments on ILSVRC2012 and VOC2007 datasets demonstrate UnionCAM&#x00027;s superior performance over state-of-the-art methods. It effectively suppresses background noise, captures complete object regions, and provides intuitive visual explanations. UnionCAM achieves significant improvements in insertion and deletion scores, outperforming the best baseline. UnionCAM makes notable contributions by introducing a novel denoising strategy, adaptive fusion of CAMs, and an automatic selection mechanism. It bridges the gap between CNN performance and interpretability, providing a valuable tool for understanding and trusting CNN-based systems. UnionCAM has the potential to foster responsible deployment of CNNs in real-world applications.</p></abstract>
<kwd-group>
<kwd>visual interpretation</kwd>
<kwd>class activation map</kwd>
<kwd>CNN</kwd>
<kwd>Union Class Activation Mapping</kwd>
<kwd>denoised CAMs</kwd>
<kwd>region-based CAMs</kwd>
</kwd-group>
<counts>
<fig-count count="8"/>
<table-count count="4"/>
<equation-count count="8"/>
<ref-count count="48"/>
<page-count count="13"/>
<word-count count="7642"/>
</counts>
</article-meta>
</front>
<body>
<sec sec-type="intro" id="s1">
<title>1 Introduction</title>
<p>Deep learning models have revolutionized various domains, such as computer vision, natural language processing, and speech recognition. However, as these models become increasingly complex and opaque, the interpretation of their decision-making processes has become crucial for building trust and ensuring reliability. Among the various interpretation methods, visualizing feature maps or learned weights is the most intuitive and convincing approach for users to understand the reasoning behind the model&#x00027;s predictions. In convolutional neural networks (CNNs), which have become the primary choice for feature extraction in computer vision, gradient-based interpretation (Simonyan and Zisserman, <xref ref-type="bibr" rid="B34">2014</xref>), region-based visualization (Wang et al., <xref ref-type="bibr" rid="B39">2020b</xref>), and Class Activation Mapping (CAM) (Zhou et al., <xref ref-type="bibr" rid="B47">2016</xref>) are the most widely used methods for explaining convolutional operations.</p>
<p>Gradient-based approaches, such as Simonyan and Zisserman (<xref ref-type="bibr" rid="B34">2014</xref>), Adebayo et al. (<xref ref-type="bibr" rid="B1">2018</xref>), Omeiza et al. (<xref ref-type="bibr" rid="B25">2019</xref>), Springenberg et al. (<xref ref-type="bibr" rid="B36">2014</xref>), Sundararajan et al. (<xref ref-type="bibr" rid="B37">2017</xref>), and Zeiler and Fergus (<xref ref-type="bibr" rid="B42">2014</xref>), backpropagate the gradient of the target class to the input layer, highlighting image regions that significantly impact the prediction. However, these methods often generate noisy and incomplete activation maps, focusing primarily on edge or texture features while neglecting fine-grained information. Moreover, the gradients of CNNs may vanish or explode due to the saturation problem in the activation functions, such as Sigmoid or ReLU (Zhang et al., <xref ref-type="bibr" rid="B44">2021b</xref>), further compromising the quality of the activation maps.</p>
<p>CAM (Zhou et al., <xref ref-type="bibr" rid="B47">2016</xref>) and its extensions, such as GradCAM (Selvaraju et al., <xref ref-type="bibr" rid="B33">2017</xref>) and GradCAM&#x0002B;&#x0002B; (Chattopadhay et al., <xref ref-type="bibr" rid="B6">2018</xref>), provide visual explanations by linearly combining weighted activation maps from convolutional layers. Despite their effectiveness, these methods have limitations: CAM is architecture-sensitive and requires modifying the network structure, while GradCAM and GradCAM&#x0002B;&#x0002B; may activate irrelevant parts, such as the background, due to gradient noise. Furthermore, these methods may generate incomplete activation maps that fail to capture the entire object of interest, as they rely on the gradients of the target class, which may not cover all the discriminative regions.</p>
<p>Region-based methods, such as ScoreCAM (Wang et al., <xref ref-type="bibr" rid="B39">2020b</xref>) and GroupCAM (Zhang et al., <xref ref-type="bibr" rid="B43">2021a</xref>), calculate the importance of activation maps using the category confidence of corresponding input features rather than local region gradients. Although these methods can effectively remove background areas, they may generate incomplete activation maps and have high computational costs. Moreover, these methods do not fully exploit the information from the gradients, which can provide valuable insights into the model&#x00027;s decision-making process.</p>
<p>To address these limitations and provide a more accurate and comprehensive visual interpretation of deep CNNs, we propose UnionCAM, a novel method that employs a &#x0201C;denoising-union-selection&#x0201D; strategy to generate class activation maps. The main contributions of this paper are as follows:</p>
<list list-type="bullet">
<list-item><p>To effectively remove background noise from gradient-based activation maps and mitigate challenges such as gradient noise and vanishing gradients, we introduce the Activation Map Denoising (AMD) module. It applies a denoising function to the gradients, which enables the AMD module to better capture discriminative regions by generating more accurate and reliable activation maps.</p></list-item>
<list-item><p>We propose the Activation Map Union (AMU) module, combining the denoised activation maps from AMD with region-based activation maps, to integrate the advantages of gradient-based and region-based methods. AMU generates more complete and informative activation maps by capturing both fine-grained details and global context, offering a more comprehensive understanding of the model&#x00027;s decision-making process.</p></list-item>
<list-item><p>To select the most informative activation map from the union set generated by AMU, We further develop the Activation Map Selection (AMS) module. AMS employs a novel scoring function that considers both the discriminative power and the spatial consistency of the activation maps, ensuring that the selected map provides the most accurate and reliable visual interpretation. This module further enhances the interpretability and trustworthiness of the generated explanations.</p></list-item>
<list-item><p>Through extensive experiments on various benchmarks, we demonstrate that UnionCAM achieves state-of-the-art performance in visual interpretation, outperforming existing methods in terms of both accuracy and completeness. UnionCAM effectively addresses the problems of incomplete activation and background activation, providing a more trustworthy and interpretable visualization of deep CNNs. The superior performance of UnionCAM highlights its potential for facilitating the understanding and debugging of deep learning models in real-world applications.</p></list-item>
</list>
</sec>
<sec id="s2">
<title>2 Related work</title>
<p>Feature or weight visualization enhances model transparency and understanding by illustrating how decisions are made. It aids in understanding the human brain, facilitates early diagnosis of conditions, improves the accuracy of prediction systems, and helps detect potential failures, among other benefits (Zong et al., <xref ref-type="bibr" rid="B48">2024</xref>; Yu et al., <xref ref-type="bibr" rid="B41">2022</xref>). CAM (Zhou et al., <xref ref-type="bibr" rid="B47">2016</xref>) is one of the pioneering works that uses a weighted sum of the feature maps from the last convolutional layer to generate class-specific activation maps, which has inspired numerous subsequent developments in the field. In this paper, we reviewed recent relevant works and categorized them into three types: gradient-based, gradient-free, and ensemble methods. Additionally, some feature visualization methods, such as GAN-based approaches, can also provide valuable methods for understanding and interpreting model behavior.</p>
<sec>
<title>2.1 Gradient-based methods</title>
<p>Gradient-based methods utilize the gradients of the model&#x00027;s output with respect to the input or intermediate feature maps to highlight the important regions. Grad-CAM (Selvaraju et al., <xref ref-type="bibr" rid="B33">2017</xref>) generalizes CAM to models without global average pooling by using the gradients of the target class score with respect to the feature maps. Expanding on this work, a range of gradient-based methods have been developed to enhance granularity using various approaches, such as GradCAM&#x0002B;&#x0002B; (Chattopadhay et al., <xref ref-type="bibr" rid="B6">2018</xref>), Smooth GradCAM&#x0002B;&#x0002B; (Omeiza et al., <xref ref-type="bibr" rid="B25">2019</xref>), XGradCAM (Fu et al., <xref ref-type="bibr" rid="B11">2020</xref>), Augmented GradCAM (Morbidelli et al., <xref ref-type="bibr" rid="B23">2020</xref>), Integrated GradCAM (Sattarzadeh et al., <xref ref-type="bibr" rid="B32">2021</xref>), and among others. LayerCAM (Jiang et al., <xref ref-type="bibr" rid="B12">2021</xref>) enhances the reliability of CAMs by incorporating information from various layers through weighted aggregation, offering a more detailed coarse-to-fine aggregation solution. Despite their computational efficiency, gradient-based methods may capture irrelevant information in the activation maps since the feature maps are not always related to the target class (Zhang et al., <xref ref-type="bibr" rid="B44">2021b</xref>).</p>
</sec>
<sec>
<title>2.2 Gradient-free methods</title>
<p>Gradient-free CAMs, on the other hand, aim to identify the importance of different input regions by occluding or perturbing them and observing the effect on the model&#x00027;s output (Zhang et al., <xref ref-type="bibr" rid="B44">2021b</xref>; Selvaraju et al., <xref ref-type="bibr" rid="B33">2017</xref>; Kapishnikov et al., <xref ref-type="bibr" rid="B14">2019</xref>; Zhang et al., <xref ref-type="bibr" rid="B45">2018</xref>; Liu et al., <xref ref-type="bibr" rid="B21">2021b</xref>; Yan et al., <xref ref-type="bibr" rid="B40">2021</xref>; Ahn et al., <xref ref-type="bibr" rid="B2">2019</xref>; Liu et al., <xref ref-type="bibr" rid="B20">2021a</xref>; Liang et al., <xref ref-type="bibr" rid="B19">2022</xref>; Li et al., <xref ref-type="bibr" rid="B18">2021</xref>; Cui et al., <xref ref-type="bibr" rid="B8">2021</xref>; Ranjan et al., <xref ref-type="bibr" rid="B29">2019</xref>; Lu et al., <xref ref-type="bibr" rid="B22">2023</xref>; Jiao et al., <xref ref-type="bibr" rid="B13">2018</xref>). One of the earliest works, RISE (Petsiuk et al., <xref ref-type="bibr" rid="B26">2018</xref>), generates random binary masks to occlude different parts of the input image for prediction scores, and then uses a linear combination of these masks and corresponding scores to obtain the final importance map. Although effective, it is inefficient due to the need for thousands of random masks. ScoreCAM (Wang et al., <xref ref-type="bibr" rid="B39">2020b</xref>) improves upon RISE by using the activation maps as the initial masks and combining them with the model&#x00027;s output scores to generate more accurate activation maps, spearheading the advancement of methods such as Smooth ScoreCAM (Wang et al., <xref ref-type="bibr" rid="B38">2020a</xref>), Integrated ScoreCAM (Naidu et al., <xref ref-type="bibr" rid="B24">2020</xref>), FIMF ScoreCAM (Li et al., <xref ref-type="bibr" rid="B17">2023</xref>), GroupCAM (Zhang et al., <xref ref-type="bibr" rid="B43">2021a</xref>), and etc. Differently, AblationCAM (Ramaswamy et al., <xref ref-type="bibr" rid="B28">2020</xref>) utilizes the effective slope which is characterized as the difference between the original prediction score and the prediction score derived from an ablated activation map; based on this work, AblationCAM&#x0002B;&#x0002B; (Salama et al., <xref ref-type="bibr" rid="B31">2022</xref>) further introduce clustering to group activation maps for improved efficiency. ReciproCAM (Byun and Lee, <xref ref-type="bibr" rid="B4">2022</xref>) significantly accelerates execution speed by using the reciprocal relationship between activation maps and predictions, further inspiring the development of ViT-ReciproCAM (Byun and Lee, <xref ref-type="bibr" rid="B5">2023</xref>) for Vision Transformers (ViT). Although Gradient-Free CAMs generally produce more human-interpretable explanations, they may generate incomplete activation maps due to the presence of salient regions that are not necessarily related to the target class.</p>
</sec>
<sec>
<title>2.3 Ensemble methods</title>
<p>To address the limitations of gradient-based and gradient-free methods, certain approaches FDCAM (Li et al., <xref ref-type="bibr" rid="B16">2022</xref>) combine gradient-based and score-based weights to derive CAM&#x00027;s weightings, harnessing the strengths of both techniques. Feature CAM (Clement et al., <xref ref-type="bibr" rid="B7">2024</xref>) combines perturbation and activation solutions for fine-grained, class-discriminative visualizations. Grad&#x0002B;&#x0002B;-ScoreCAM (Soomro et al., <xref ref-type="bibr" rid="B35">2024</xref>) enhances CNN interpretability and localization by first generating a coarse heatmap with GradCAM&#x0002B;&#x0002B; and then refining it with ScoreCAM to incorporate intermediate layer information. Our proposed method UnionCAM also falls in this part, by denoising the gradient-based activation maps and then merging them with the region-based maps using a learned weight, UnionCAM generates more accurate and complete visual explanations. In the following sections, we will describe the proposed method in detail and demonstrate its effectiveness through comprehensive experiments.</p>
</sec>
<sec>
<title>2.4 Feature visualization via generation methods</title>
<p>Methods based on generative models also play an important role in feature visualization. GAN functions as an insightful method that clarifies the decision-making process and offers effective support for diverse tasks (Bau et al., <xref ref-type="bibr" rid="B3">2018</xref>; Yu et al., <xref ref-type="bibr" rid="B41">2022</xref>; Lang et al., <xref ref-type="bibr" rid="B15">2021</xref>). Bau et al. (<xref ref-type="bibr" rid="B3">2018</xref>) introduce an analytical framework for visualizing and understanding GANs at the levels of units, objects, and scenes. Lang et al. (<xref ref-type="bibr" rid="B15">2021</xref>) train a generative model to clarify the various attributes that contribute to classifier decisions. Yu et al. (<xref ref-type="bibr" rid="B41">2022</xref>) propose the multidirectional perception generative adversarial network (MP-GAN) to visualize morphological features for whole-brain MR images. Besides, diffusion model-based feature visualization methods provide visualization strategies from a different perspective. VPD (Zhao et al., <xref ref-type="bibr" rid="B46">2023</xref>) proposes to refine text features and prompt the denoising decoder for better interaction between visuals and text, using cross-attention maps for guidance. NeuroDM (Qian et al., <xref ref-type="bibr" rid="B27">2024</xref>) first extracts the visual-related features with high classification accuracy from EEG signals by EV-Transformer, and then employs EG-DM to synthesize high-quality images with the EEG visual-related features.</p>
</sec>
</sec>
<sec sec-type="methods" id="s3">
<title>3 Methodology</title>
<p>The overall architecture of the proposed UnionCAM is illustrated in <xref ref-type="fig" rid="F1">Figure 1</xref>, and we also present the pseudocode in <xref ref-type="fig" rid="F9">Algorithm 1</xref>. This section provides a detailed explanation of the three key modules in the proposed method: Activation Map Denoising (AMD), Activation Map Union (AMU), and Activation Map Selection (AMS). Let <inline-formula><mml:math id="M1"><mml:msub><mml:mrow><mml:mi>I</mml:mi></mml:mrow><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msub><mml:mo>&#x02208;</mml:mo><mml:msup><mml:mrow><mml:mi>&#x0211D;</mml:mi></mml:mrow><mml:mrow><mml:mn>3</mml:mn><mml:mo>&#x000D7;</mml:mo><mml:mi>M</mml:mi><mml:mo>&#x000D7;</mml:mo><mml:mi>N</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> be an input image, where <italic>M</italic> and <italic>N</italic> represent the height and width of the image, respectively. Let <inline-formula><mml:math id="M2"><mml:msub><mml:mrow><mml:mi>I</mml:mi></mml:mrow><mml:mrow><mml:mi>b</mml:mi></mml:mrow></mml:msub><mml:mo>&#x02208;</mml:mo><mml:msup><mml:mrow><mml:mi>&#x0211D;</mml:mi></mml:mrow><mml:mrow><mml:mn>3</mml:mn><mml:mo>&#x000D7;</mml:mo><mml:mi>M</mml:mi><mml:mo>&#x000D7;</mml:mo><mml:mi>N</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> be a black image with the same dimensions as <italic>I</italic><sub>0</sub>. We denote <italic>f</italic>(&#x000B7;) as a deep neural network which predicts a score <inline-formula><mml:math id="M3"><mml:msup><mml:mrow><mml:mi>y</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:msup><mml:mrow><mml:mi>f</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi></mml:mrow></mml:msup><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>I</mml:mi></mml:mrow><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>&#x02208;</mml:mo><mml:mi>&#x0211D;</mml:mi></mml:math></inline-formula> for class <italic>c</italic> given an input image <italic>I</italic><sub>0</sub>.</p>
<fig id="F1" position="float">
<label>Figure 1</label>
<caption><p>Pipeline of UnionCAM. AMD module is used to denoise meaningless background to generate a purer CAMs. Then, AMU module is to generate a complete CAM, which takes the class confidence as the weight to union the denoised CAMs and the region-based CAMs. AMS module is used to select a better interpretation effect of CAMs. &#x02299; denotes element-wise multiple operation, which used for weight and feature maps. &#x02295; represents add operation.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fnbot-18-1490198-g0001.tif"/>
</fig>
<fig id="F9" position="float">
<label>Algorithm 1</label>
<caption><p>UnionCAM.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fnbot-18-1490198-g0009.tif"/>
</fig>
<sec>
<title>3.1 Activation map denoising</title>
<p>After the feature extraction backbone network, the feature map and the corresponding reverse gradient of each channel can be obtained, as shown in the &#x0201C;Feat Maps&#x0201D; and &#x0201C;Grad Maps&#x0201D; in <xref ref-type="fig" rid="F1">Figure 1</xref>. However, the gradients of CNNs may be noisy and even tend to disappear due to the saturation problem of the zero gradient region of the &#x0201C;Sigmoid&#x0201D; or &#x0201C;ReLU&#x0201D; function (Zhang et al., <xref ref-type="bibr" rid="B44">2021b</xref>). To address this issue, we propose an activation map denoising (AMD) method, as illustrated in the &#x0201C;Activation Map Denoising&#x0201D; part in <xref ref-type="fig" rid="F1">Figure 1</xref>. This subsection will elaborate on this module. The AMD module mainly designs a function to denoise the gradient obtained after the backbone network. For the convenience of explanation, the gradient is denoted as <italic>W</italic> here.</p>
<p>For each channel of <italic>W</italic>, the &#x003B8; percentile is calculated as the denoising threshold. If the gradient value is greater than or equal to the threshold, the gradient value at the corresponding position remains unchanged; otherwise, the gradient value at the corresponding position is set to 0. This denoising operation is reasonable because positions with relatively small gradient values have a high probability of being background areas unrelated to the detection target. In this way, we can remove detect target-independent background regions, thereby improving the localization effect of class activation maps on detected targets.</p>
<p>In addition to an illustration of the denoising process in <xref ref-type="fig" rid="F1">Figure 1</xref>, we formulate the denoising function in this section. For a scalar <italic>W</italic><sub><italic>ij</italic></sub> in <italic>W</italic>, the denoising function can be formulated as:</p>
<disp-formula id="E1"><label>(1)</label><mml:math id="M4"><mml:mrow><mml:mi>D</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:mi>o</mml:mi><mml:mi>i</mml:mi><mml:mi>s</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>g</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:msubsup><mml:mi>W</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi><mml:mi>l</mml:mi></mml:mrow></mml:msubsup><mml:mo>,</mml:mo><mml:mi>&#x003B8;</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:mtable columnalign='left'><mml:mtr columnalign='left'><mml:mtd columnalign='left'><mml:mrow><mml:msubsup><mml:mi>W</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi><mml:mi>l</mml:mi></mml:mrow></mml:msubsup><mml:mo>,</mml:mo></mml:mrow></mml:mtd><mml:mtd columnalign='left'><mml:mrow><mml:msubsup><mml:mi>W</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi><mml:mi>l</mml:mi></mml:mrow></mml:msubsup><mml:mo>&#x02265;</mml:mo><mml:mi>p</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:msup><mml:mi>W</mml:mi><mml:mrow><mml:mi>c</mml:mi><mml:mi>l</mml:mi></mml:mrow></mml:msup><mml:mo>,</mml:mo><mml:mi>&#x003B8;</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>;</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr columnalign='left'><mml:mtd columnalign='left'><mml:mrow><mml:mn>0</mml:mn><mml:mo>,</mml:mo></mml:mrow></mml:mtd><mml:mtd columnalign='left'><mml:mrow><mml:mi>o</mml:mi><mml:mi>t</mml:mi><mml:mi>h</mml:mi><mml:mi>e</mml:mi><mml:mi>r</mml:mi><mml:mi>w</mml:mi><mml:mi>i</mml:mi><mml:mi>s</mml:mi><mml:mi>e</mml:mi><mml:mo>,</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow></mml:mrow></mml:mrow></mml:math></disp-formula>
<p>where <italic>p</italic>(<italic>W</italic><sup><italic>cl</italic></sup>, &#x003B8;) calculates the &#x003B8; percentile of the <italic>l</italic>-th layer <italic>W</italic><sup><italic>cl</italic></sup> for specific category <italic>c</italic>. With denoised weighting maps, the class related feature maps are defined as the weighted sum to obtain the class activation map, which can be formulated as,</p>
<disp-formula id="E2"><label>(2)</label><mml:math id="M5"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:msubsup><mml:mrow><mml:mi>L</mml:mi></mml:mrow><mml:mrow><mml:mi>D</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:mi>o</mml:mi><mml:mi>i</mml:mi><mml:mi>s</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>g</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:mstyle displaystyle="true"><mml:munder class="msub"><mml:mrow><mml:mo>&#x02211;</mml:mo></mml:mrow><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:munder></mml:mstyle><mml:msup><mml:mrow><mml:mi>&#x003B1;</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi><mml:mi>l</mml:mi></mml:mrow></mml:msup><mml:mo>&#x025CB;</mml:mo><mml:mtext class="textrm" mathvariant="normal">ReLU</mml:mtext><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msup><mml:mrow><mml:mi>W</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi><mml:mi>l</mml:mi></mml:mrow></mml:msup></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>&#x025CB;</mml:mo><mml:msup><mml:mrow><mml:mi>A</mml:mi></mml:mrow><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msup><mml:mo>,</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>where &#x000B0; is Hadamard product, <italic>A</italic><sup><italic>l</italic></sup> is the feature map of the <italic>l</italic>-th layer. The weight &#x003B1; is the pixel-level average coefficient, which is defined as:</p>
<disp-formula id="E3"><label>(3)</label><mml:math id="M6"><mml:mrow><mml:msubsup><mml:mi>&#x003B1;</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi><mml:mi>l</mml:mi></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:mtable columnalign='left'><mml:mtr columnalign='left'><mml:mtd columnalign='left'><mml:mrow><mml:mfrac><mml:mn>1</mml:mn><mml:mrow><mml:mstyle displaystyle='true'><mml:msub><mml:mo>&#x02211;</mml:mo><mml:mrow><mml:mi>m</mml:mi><mml:mo>,</mml:mo><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:msubsup><mml:mi>W</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi><mml:mi>l</mml:mi></mml:mrow></mml:msubsup><mml:mstyle mathvariant='double-struck'><mml:mtext>I</mml:mtext></mml:mstyle><mml:mo stretchy='false'>(</mml:mo><mml:msubsup><mml:mi>W</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi><mml:mi>l</mml:mi></mml:mrow></mml:msubsup><mml:mo stretchy='false'>)</mml:mo></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:mstyle></mml:mrow></mml:mfrac></mml:mrow></mml:mtd><mml:mtd columnalign='left'><mml:mrow><mml:mtext>if&#x000A0;</mml:mtext><mml:msubsup><mml:mi>W</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi><mml:mi>l</mml:mi></mml:mrow></mml:msubsup><mml:mo>&#x0003E;</mml:mo><mml:mn>0</mml:mn><mml:mo>;</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr columnalign='left'><mml:mtd columnalign='left'><mml:mn>0</mml:mn></mml:mtd><mml:mtd columnalign='left'><mml:mrow><mml:mtext>otherwise</mml:mtext><mml:mo>.</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow></mml:mrow></mml:mrow></mml:math></disp-formula>
<p>where &#x1D540;(&#x000B7;) is an indicator function checking whether the given variable is &#x0003E;0, and <inline-formula><mml:math id="M7"><mml:msubsup><mml:mrow><mml:mi>W</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi><mml:mi>l</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> is the gradient value corresponding to the (<italic>i, j</italic>) position in the denoised gradient <italic>W</italic> of the <italic>l</italic>-th channel. The locations where the gradient values are &#x0003E;0 are most likely the locations of the target. The use of pixel-level average coefficients can avoid excessive channel weights in small activation areas, which will lead to significant activation problems. After the above process, the gradient-based class activation map after denoising can be obtained, which is denoted as <inline-formula><mml:math id="M8"><mml:msubsup><mml:mrow><mml:mi>L</mml:mi></mml:mrow><mml:mrow><mml:mi>D</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:mi>o</mml:mi><mml:mi>i</mml:mi><mml:mi>s</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>g</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula>. A high-quality <inline-formula><mml:math id="M9"><mml:msubsup><mml:mrow><mml:mi>L</mml:mi></mml:mrow><mml:mrow><mml:mi>D</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:mi>o</mml:mi><mml:mi>i</mml:mi><mml:mi>s</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>g</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> serves as the basis for the upcoming soft and hard integration strategy, ensuring that the model can effectively leverage refined features.</p>
</sec>
<sec>
<title>3.2 Activation map union</title>
<p>Gradient-based CAM introduces noise due to the gradient. Although the denoising method in Section 3.1 can remove part of the noise, it cannot completely eliminate the background area unrelated to the target class. To further suppress the background area, we draw inspiration from the area-based method. In our approach, the feature map of each channel is used as a mask to activate the corresponding area in the original image. The activated area is then used as the input to the CNN, and the prediction score is used as the weight of the feature map. The weighted summation of these feature maps yields the class activation maps, denoted as <inline-formula><mml:math id="M18"><mml:msubsup><mml:mrow><mml:mi>L</mml:mi></mml:mrow><mml:mrow><mml:mi>R</mml:mi><mml:mi>e</mml:mi><mml:mi>g</mml:mi><mml:mi>i</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula>.</p>
<p>By using <inline-formula><mml:math id="M19"><mml:msubsup><mml:mrow><mml:mi>L</mml:mi></mml:mrow><mml:mrow><mml:mi>R</mml:mi><mml:mi>e</mml:mi><mml:mi>g</mml:mi><mml:mi>i</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula>, the influence of the gradient on the class activation map is significantly reduced, and the background area can be effectively suppressed. However, for targets with distinctive features, the main part of the target may also be partially removed, leading to an incomplete class activation map. To address this issue and obtain a more complete representation of the main object while further suppressing the background, we propose a method to combine <inline-formula><mml:math id="M20"><mml:msubsup><mml:mrow><mml:mi>L</mml:mi></mml:mrow><mml:mrow><mml:mi>D</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:mi>o</mml:mi><mml:mi>i</mml:mi><mml:mi>s</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>g</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> and <inline-formula><mml:math id="M21"><mml:msubsup><mml:mrow><mml:mi>L</mml:mi></mml:mrow><mml:mrow><mml:mi>R</mml:mi><mml:mi>e</mml:mi><mml:mi>g</mml:mi><mml:mi>i</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula>. The two class activation maps are merged using weights &#x003B2;<sub><italic>Denoising</italic></sub> and &#x003B2;<sub><italic>Region</italic></sub> for <inline-formula><mml:math id="M22"><mml:msubsup><mml:mrow><mml:mi>L</mml:mi></mml:mrow><mml:mrow><mml:mi>D</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:mi>o</mml:mi><mml:mi>i</mml:mi><mml:mi>s</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>g</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> and <inline-formula><mml:math id="M23"><mml:msubsup><mml:mrow><mml:mi>L</mml:mi></mml:mrow><mml:mrow><mml:mi>R</mml:mi><mml:mi>e</mml:mi><mml:mi>g</mml:mi><mml:mi>i</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula>, respectively. The overall process is illustrated in the &#x0201C;Activation Map Union&#x0201D; block of <xref ref-type="fig" rid="F1">Figure 1</xref>. In the following, we formulate this module in detail.</p>
<p>To combine the two types of activation maps using weights, we first need to determine their respective weights. The weight &#x003B2;<sub><italic>Denoising</italic></sub> is formulated as:</p>
<disp-formula id="E4"><label>(4)</label><mml:math id="M24"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:msub><mml:mrow><mml:mi>&#x003B2;</mml:mi></mml:mrow><mml:mrow><mml:mi>D</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:mi>o</mml:mi><mml:mi>i</mml:mi><mml:mi>s</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>g</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msup><mml:mrow><mml:mi>f</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi></mml:mrow></mml:msup><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msubsup><mml:mrow><mml:mi>L</mml:mi></mml:mrow><mml:mrow><mml:mi>D</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:mi>o</mml:mi><mml:mi>i</mml:mi><mml:mi>s</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>g</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi></mml:mrow></mml:msubsup><mml:mo>&#x025CB;</mml:mo><mml:msub><mml:mrow><mml:mi>I</mml:mi></mml:mrow><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>-</mml:mo><mml:msup><mml:mrow><mml:mi>f</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi></mml:mrow></mml:msup><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>I</mml:mi></mml:mrow><mml:mrow><mml:mi>b</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>,</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>Here, we perform the &#x000B0; operation on the denoised CAM <inline-formula><mml:math id="M25"><mml:msubsup><mml:mrow><mml:mi>L</mml:mi></mml:mrow><mml:mrow><mml:mi>D</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:mi>o</mml:mi><mml:mi>i</mml:mi><mml:mi>s</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>g</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> and the original image, which means that <inline-formula><mml:math id="M26"><mml:msubsup><mml:mrow><mml:mi>L</mml:mi></mml:mrow><mml:mrow><mml:mi>D</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:mi>o</mml:mi><mml:mi>i</mml:mi><mml:mi>s</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>g</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> is used as the mask to activate the corresponding part of the original image.</p>
<p><inline-formula><mml:math id="M27"><mml:msup><mml:mrow><mml:mi>f</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi></mml:mrow></mml:msup><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msubsup><mml:mrow><mml:mi>L</mml:mi></mml:mrow><mml:mrow><mml:mi>D</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:mi>o</mml:mi><mml:mi>i</mml:mi><mml:mi>s</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>g</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi></mml:mrow></mml:msubsup><mml:mo>&#x025CB;</mml:mo><mml:msub><mml:mrow><mml:mi>I</mml:mi></mml:mrow><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:math></inline-formula> denotes the activation image generated by using <inline-formula><mml:math id="M28"><mml:msubsup><mml:mrow><mml:mi>L</mml:mi></mml:mrow><mml:mrow><mml:mi>D</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:mi>o</mml:mi><mml:mi>i</mml:mi><mml:mi>s</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>g</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> as the mask and inputting it into the convolutional neural network for the corresponding target category <italic>c</italic>, and <inline-formula><mml:math id="M29"><mml:msup><mml:mrow><mml:mi>f</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi></mml:mrow></mml:msup><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>I</mml:mi></mml:mrow><mml:mrow><mml:mi>b</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:math></inline-formula> represents the score corresponding to the target category c obtained by inputting the all-black image <italic>I</italic><sub><italic>b</italic></sub> into the convolutional neural network. Therefore, &#x003B2;<sub><italic>Denoising</italic></sub> can be understood as the contribution of the <inline-formula><mml:math id="M30"><mml:msubsup><mml:mrow><mml:mi>L</mml:mi></mml:mrow><mml:mrow><mml:mi>D</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:mi>o</mml:mi><mml:mi>i</mml:mi><mml:mi>s</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>g</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> activation area to the score of the target category <italic>c</italic>. Similarly, &#x003B2;<sub><italic>Region</italic></sub> can be understood as the contribution of the <inline-formula><mml:math id="M31"><mml:msubsup><mml:mrow><mml:mi>L</mml:mi></mml:mrow><mml:mrow><mml:mi>R</mml:mi><mml:mi>e</mml:mi><mml:mi>g</mml:mi><mml:mi>i</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> activation region to the target category <italic>c</italic>, which can be formulated as:</p>
<disp-formula id="E5"><label>(5)</label><mml:math id="M32"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:msub><mml:mrow><mml:mi>&#x003B2;</mml:mi></mml:mrow><mml:mrow><mml:mi>R</mml:mi><mml:mi>e</mml:mi><mml:mi>g</mml:mi><mml:mi>i</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msup><mml:mrow><mml:mi>f</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi></mml:mrow></mml:msup><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msubsup><mml:mrow><mml:mi>L</mml:mi></mml:mrow><mml:mrow><mml:mi>R</mml:mi><mml:mi>e</mml:mi><mml:mi>g</mml:mi><mml:mi>i</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi></mml:mrow></mml:msubsup><mml:mo>&#x025CB;</mml:mo><mml:msub><mml:mrow><mml:mi>I</mml:mi></mml:mrow><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>-</mml:mo><mml:msup><mml:mrow><mml:mi>f</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi></mml:mrow></mml:msup><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>I</mml:mi></mml:mrow><mml:mrow><mml:mi>b</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>,</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>where <inline-formula><mml:math id="M33"><mml:msup><mml:mrow><mml:mi>f</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi></mml:mrow></mml:msup><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msubsup><mml:mrow><mml:mi>L</mml:mi></mml:mrow><mml:mrow><mml:mi>R</mml:mi><mml:mi>e</mml:mi><mml:mi>g</mml:mi><mml:mi>i</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi></mml:mrow></mml:msubsup><mml:mo>&#x025CB;</mml:mo><mml:msub><mml:mrow><mml:mi>I</mml:mi></mml:mrow><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:math></inline-formula> denotes the score of the target category <italic>c</italic> obtained by inputting the activation image generated using <inline-formula><mml:math id="M34"><mml:msubsup><mml:mrow><mml:mi>L</mml:mi></mml:mrow><mml:mrow><mml:mi>R</mml:mi><mml:mi>e</mml:mi><mml:mi>g</mml:mi><mml:mi>i</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> as the mask into the convolutional neural network, and <inline-formula><mml:math id="M35"><mml:msup><mml:mrow><mml:mi>f</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi></mml:mrow></mml:msup><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>I</mml:mi></mml:mrow><mml:mrow><mml:mi>b</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:math></inline-formula> represents the score of the target category <italic>c</italic> obtained by inputting the all-black image <italic>I</italic><sub><italic>b</italic></sub> into the convolutional neural network.</p>
<p>Having obtained the score contributions &#x003B2;<sub><italic>Denoising</italic></sub> and &#x003B2;<sub><italic>Region</italic></sub> of the <inline-formula><mml:math id="M36"><mml:msubsup><mml:mrow><mml:mi>L</mml:mi></mml:mrow><mml:mrow><mml:mi>D</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:mi>o</mml:mi><mml:mi>i</mml:mi><mml:mi>s</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>g</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> and <inline-formula><mml:math id="M37"><mml:msubsup><mml:mrow><mml:mi>L</mml:mi></mml:mrow><mml:mrow><mml:mi>R</mml:mi><mml:mi>e</mml:mi><mml:mi>g</mml:mi><mml:mi>i</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> activation regions to the target category <italic>c</italic>, respectively, we can merge the two types of activation maps using these contributions as weights:</p>
<disp-formula id="E6"><label>(6)</label><mml:math id="M38"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:msubsup><mml:mrow><mml:mi>L</mml:mi></mml:mrow><mml:mrow><mml:mi>D</mml:mi><mml:mi>e</mml:mi><mml:mo>-</mml:mo><mml:mi>R</mml:mi><mml:mi>e</mml:mi><mml:mi>g</mml:mi><mml:mi>i</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:msub><mml:mrow><mml:mi>&#x003B2;</mml:mi></mml:mrow><mml:mrow><mml:mi>D</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:mi>o</mml:mi><mml:mi>i</mml:mi><mml:mi>s</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>g</mml:mi></mml:mrow></mml:msub><mml:mo>&#x000B7;</mml:mo><mml:msubsup><mml:mrow><mml:mi>L</mml:mi></mml:mrow><mml:mrow><mml:mi>D</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:mi>o</mml:mi><mml:mi>i</mml:mi><mml:mi>s</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>g</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi></mml:mrow></mml:msubsup><mml:mo>&#x0002B;</mml:mo><mml:msub><mml:mrow><mml:mi>&#x003B2;</mml:mi></mml:mrow><mml:mrow><mml:mi>R</mml:mi><mml:mi>e</mml:mi><mml:mi>g</mml:mi><mml:mi>i</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mo>&#x000B7;</mml:mo><mml:msubsup><mml:mrow><mml:mi>L</mml:mi></mml:mrow><mml:mrow><mml:mi>R</mml:mi><mml:mi>e</mml:mi><mml:mi>g</mml:mi><mml:mi>i</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi></mml:mrow></mml:msubsup><mml:mo>.</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>By combining the two activation maps weighted by their respective contributions to the target category score, the resulting class activation map emphasizes the target object&#x00027;s main area (high-scoring part) in the original image while suppressing the background area (low-scoring part). This soft integration strategy enables the model to adaptively acquire meaningful features while enhancing its ability to understand and process complex data patterns. This approach helps to obtain a more complete representation of the target object while effectively reducing background activation, thereby improving the interpretability and localization accuracy of the class activation map.</p>
</sec>
<sec>
<title>3.3 Activation map select</title>
<p>The combination of the two activation maps using their respective scores as weights, as described in Section 3.2, does not always guarantee an improved explanatory power of the resulting activation map. One potential scenario is when the background area outside the target object in <inline-formula><mml:math id="M39"><mml:msubsup><mml:mrow><mml:mi>L</mml:mi></mml:mrow><mml:mrow><mml:mi>D</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:mi>o</mml:mi><mml:mi>i</mml:mi><mml:mi>s</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>g</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> is not entirely suppressed, and the weight &#x003B2;<sub><italic>Denoising</italic></sub> obtained from the CNN is greater than &#x003B2;<sub><italic>Region</italic></sub>. In this case, merging the two activation maps with the scores as weights may introduce redundant background components, which can negatively impact the final interpretation and localization accuracy of the class activation map.</p>
<p>To mitigate the above issue, we propose the Activation Map Selection (AMS) method. Considering both <inline-formula><mml:math id="M40"><mml:msubsup><mml:mrow><mml:mi>L</mml:mi></mml:mrow><mml:mrow><mml:mi>D</mml:mi><mml:mi>e</mml:mi><mml:mo>-</mml:mo><mml:mi>R</mml:mi><mml:mi>e</mml:mi><mml:mi>g</mml:mi><mml:mi>i</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> and <inline-formula><mml:math id="M41"><mml:msubsup><mml:mrow><mml:mi>L</mml:mi></mml:mrow><mml:mrow><mml:mi>R</mml:mi><mml:mi>e</mml:mi><mml:mi>g</mml:mi><mml:mi>i</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula>, AMS can choose the class activation map that provides a more interpretable representation of the target category. This capability enables AMS to select the CAM that yields a higher score for the target category, indicating better localization and interpretation of the target object. The overall workflow of the AMS method is illustrated in <xref ref-type="fig" rid="F2">Figure 2</xref>.</p>
<fig id="F2" position="float">
<label>Figure 2</label>
<caption><p>Activation map select. Based on the comparison between <italic>&#x003B2;</italic><sub><italic>De</italic>&#x02212;<italic>Region</italic></sub> and <italic>&#x003B2;</italic><sub><italic>Region</italic></sub>, we select the corresponding element from De-Region Map and Region Map to form the Union CAM.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fnbot-18-1490198-g0002.tif"/>
</fig>
<p>We subsequently formulate AMS, based on the score contribution &#x003B2;<sub><italic>Region</italic></sub> of the <inline-formula><mml:math id="M42"><mml:msubsup><mml:mrow><mml:mi>L</mml:mi></mml:mrow><mml:mrow><mml:mi>R</mml:mi><mml:mi>e</mml:mi><mml:mi>g</mml:mi><mml:mi>i</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> activation region to the target category c has been obtained from <xref ref-type="disp-formula" rid="E5">Equation 5</xref> and the combined class activation map <inline-formula><mml:math id="M43"><mml:msubsup><mml:mrow><mml:mi>L</mml:mi></mml:mrow><mml:mrow><mml:mi>D</mml:mi><mml:mi>e</mml:mi><mml:mo>-</mml:mo><mml:mi>R</mml:mi><mml:mi>e</mml:mi><mml:mi>g</mml:mi><mml:mi>i</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> is also obtained from <xref ref-type="disp-formula" rid="E6">Equation 6</xref>. To select the CAMs according to the interpretability of the target category, we must first get the score contribution &#x003B2;<sub><italic>De</italic>&#x02212;<italic>Region</italic></sub> of the <inline-formula><mml:math id="M44"><mml:msubsup><mml:mrow><mml:mi>L</mml:mi></mml:mrow><mml:mrow><mml:mi>D</mml:mi><mml:mi>e</mml:mi><mml:mo>-</mml:mo><mml:mi>R</mml:mi><mml:mi>e</mml:mi><mml:mi>g</mml:mi><mml:mi>i</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> activation region to the target category c. Similarly, <italic>w</italic><sub><italic>De</italic>&#x02212;<italic>Region</italic></sub> can be formulated as:</p>
<disp-formula id="E7"><label>(7)</label><mml:math id="M45"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:msub><mml:mrow><mml:mi>&#x003B2;</mml:mi></mml:mrow><mml:mrow><mml:mi>D</mml:mi><mml:mi>e</mml:mi><mml:mo>-</mml:mo><mml:mi>R</mml:mi><mml:mi>e</mml:mi><mml:mi>g</mml:mi><mml:mi>i</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msup><mml:mrow><mml:mi>f</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi></mml:mrow></mml:msup><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msubsup><mml:mrow><mml:mi>L</mml:mi></mml:mrow><mml:mrow><mml:mi>D</mml:mi><mml:mi>e</mml:mi><mml:mo>-</mml:mo><mml:mi>R</mml:mi><mml:mi>e</mml:mi><mml:mi>g</mml:mi><mml:mi>i</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi></mml:mrow></mml:msubsup><mml:mo>&#x025CB;</mml:mo><mml:msub><mml:mrow><mml:mi>I</mml:mi></mml:mrow><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>-</mml:mo><mml:msup><mml:mrow><mml:mi>f</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi></mml:mrow></mml:msup><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>I</mml:mi></mml:mrow><mml:mrow><mml:mi>b</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>After obtaining the score contribution &#x003B2;<sub><italic>De</italic>&#x02212;<italic>Region</italic></sub> of the <inline-formula><mml:math id="M46"><mml:msubsup><mml:mrow><mml:mi>L</mml:mi></mml:mrow><mml:mrow><mml:mi>D</mml:mi><mml:mi>e</mml:mi><mml:mo>-</mml:mo><mml:mi>R</mml:mi><mml:mi>e</mml:mi><mml:mi>g</mml:mi><mml:mi>i</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> activation region to the target category c, we can select the final CAM result according to the bigness of &#x003B2;<sub><italic>De</italic>&#x02212;<italic>Region</italic></sub> and &#x003B2;<sub><italic>Region</italic></sub> and its decision-making process can be formulated as:</p>
<disp-formula id="E8"><label>(8)</label><mml:math id="M47"><mml:mrow><mml:msubsup><mml:mi>L</mml:mi><mml:mrow><mml:mi>U</mml:mi><mml:mi>n</mml:mi><mml:mi>i</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi><mml:mi>C</mml:mi><mml:mi>A</mml:mi><mml:mi>M</mml:mi></mml:mrow><mml:mi>c</mml:mi></mml:msubsup><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:mtable columnalign='left'><mml:mtr columnalign='left'><mml:mtd columnalign='left'><mml:mrow><mml:msubsup><mml:mi>L</mml:mi><mml:mrow><mml:mi>D</mml:mi><mml:mi>e</mml:mi><mml:mo>&#x02212;</mml:mo><mml:mi>R</mml:mi><mml:mi>e</mml:mi><mml:mi>g</mml:mi><mml:mi>i</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi></mml:mrow><mml:mi>c</mml:mi></mml:msubsup></mml:mrow></mml:mtd><mml:mtd columnalign='left'><mml:mrow><mml:mtext>if&#x000A0;</mml:mtext><mml:msub><mml:mi>&#x003B2;</mml:mi><mml:mrow><mml:mi>D</mml:mi><mml:mi>e</mml:mi><mml:mo>&#x02212;</mml:mo><mml:mi>R</mml:mi><mml:mi>e</mml:mi><mml:mi>g</mml:mi><mml:mi>i</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mo>&#x0003E;</mml:mo><mml:msub><mml:mi>&#x003B2;</mml:mi><mml:mrow><mml:mi>R</mml:mi><mml:mi>e</mml:mi><mml:mi>g</mml:mi><mml:mi>i</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mo>;</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr columnalign='left'><mml:mtd columnalign='left'><mml:mrow><mml:msubsup><mml:mi>L</mml:mi><mml:mrow><mml:mi>R</mml:mi><mml:mi>e</mml:mi><mml:mi>g</mml:mi><mml:mi>i</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi></mml:mrow><mml:mi>c</mml:mi></mml:msubsup></mml:mrow></mml:mtd><mml:mtd columnalign='left'><mml:mrow><mml:mtext>otherwise</mml:mtext><mml:mo>.</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow></mml:mrow></mml:mrow></mml:math></disp-formula>
<p>As a combination of soft and hard selection strategy, AMS enables a more flexible dynamic integration of both gradient-based activation maps and region-based activation maps, dynamically adapting to different input characteristics. The &#x003B2;<sub><italic>Denosing</italic></sub> and &#x003B2;<sub><italic>Region</italic></sub> first softly select the denoising map and region map for integration, which sometimes can introduce noise signals, thus blurring the decision-making process. Compensatorily, <xref ref-type="disp-formula" rid="E8">Equation 8</xref> offers a hard selection to alleviate this issue, promoting the model to make more reliable decisions, which enhances this dynamic adaptability by more effectively capturing activation regions that are beneficial to the decision-making process.</p>
</sec>
</sec>
<sec id="s4">
<title>4 Experiments</title>
<p>In this section, we conduct experiments to evaluate the effectiveness of the proposed interpretation method. First, we provide a basic description of the datasets and data preprocessing for the experiments in Section 4.1. Second, in Section 4.2, we quantitatively evaluate UnionCAM against other mainstream class activation map methods using established evaluation metrics. Then, we qualitatively evaluate our method with visualizations on the ILSVRC2012 (Russakovsky et al., <xref ref-type="bibr" rid="B30">2015</xref>) in Section 4.3. Finally, in Section 4.4, we assess the effectiveness of each module proposed in this paper through ablation experiments.</p>
<sec>
<title>4.1 Experimental setup</title>
<p>Experiments are performed on commonly used computer vision datasets, including the validation set of ILSVRC2012 (Russakovsky et al., <xref ref-type="bibr" rid="B30">2015</xref>) and the VOC2007 test set (Everingham et al., <xref ref-type="bibr" rid="B10">2015</xref>), as shown in <xref ref-type="fig" rid="F3">Figure 3</xref>. For both datasets, all images were resized to 3 &#x000D7; 224 &#x000D7; 224, then converted to tensors, and normalized to the range [0,1]. No additional preprocessing was applied. We utilize the pretrained torchvision model VGG16 (Simonyan and Zisserman, <xref ref-type="bibr" rid="B34">2014</xref>) as the base classifier model. Unless stated otherwise, the &#x003B8; parameter in UnionCAM is set to 10. To ensure a fair comparison, all activation maps are upsampled to 224 &#x000D7; 224 by using bilinear interpolation.</p>
<fig id="F3" position="float">
<label>Figure 3</label>
<caption><p>Examples from the ILSVRC2012 and VOC2007 datasets.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fnbot-18-1490198-g0003.tif"/>
</fig>
</sec>
<sec>
<title>4.2 Quantitative evaluation of evaluation indicators</title>
<p>We initially evaluate the confidence of the activation maps generated by UnionCAM for the object recognition task employed in Chattopadhay et al. (<xref ref-type="bibr" rid="B6">2018</xref>). The original input activates specified regions in the given image through point-wise multiplication with activation maps to observe score changes in the target class. We adopt the metric from Chattopadhay et al. (<xref ref-type="bibr" rid="B6">2018</xref>), where the average drop is formulated as: <inline-formula><mml:math id="M48"><mml:munderover accentunder="false" accent="false"><mml:mrow><mml:mo>&#x02211;</mml:mo></mml:mrow><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:mfrac><mml:mrow><mml:mo class="qopname">max</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:munderover accentunder="false" accent="false"><mml:mrow><mml:mi>y</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi></mml:mrow></mml:munderover><mml:mo>-</mml:mo><mml:msubsup><mml:mrow><mml:mi>o</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi></mml:mrow></mml:msubsup></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:msubsup><mml:mrow><mml:mi>y</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi></mml:mrow></mml:msubsup></mml:mrow></mml:mfrac><mml:mo>&#x000D7;</mml:mo><mml:mn>100</mml:mn></mml:math></inline-formula>, and the average increase is formulated as: <inline-formula><mml:math id="M49"><mml:munderover accentunder="false" accent="false"><mml:mrow><mml:mo>&#x02211;</mml:mo></mml:mrow><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:mfrac><mml:mrow><mml:mstyle class="text"><mml:mtext class="textrm" mathvariant="normal">Sign</mml:mtext></mml:mstyle><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msubsup><mml:mrow><mml:mi>y</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi></mml:mrow></mml:msubsup><mml:mo>&#x0003C;</mml:mo><mml:msubsup><mml:mrow><mml:mi>o</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi></mml:mrow></mml:msubsup></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:mfrac><mml:mo>&#x000D7;</mml:mo><mml:mn>100</mml:mn></mml:math></inline-formula>. Here, <inline-formula><mml:math id="M50"><mml:msubsup><mml:mrow><mml:mi>y</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> denotes the score of category <italic>c</italic> predicted after inputting the original image into the network, and <inline-formula><mml:math id="M51"><mml:msubsup><mml:mrow><mml:mi>o</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> denotes the score predicted after the activation map activates certain parts of the original image. <italic>Sign</italic> is an indicator function that returns 1 if the input condition is true. Experiments are performed on the ImageNet (ILSVRC2012) validation set with 2,000 images randomly selected. Our algorithm consumes 2.22 GB of memory during operation, and the average processing time per image is 1.16 s, which is evaluated on an NVIDIA RTX A6000 GPU. The results are summarized in <xref ref-type="table" rid="T1">Table 1</xref>. Similarly, the experimental results on the VOC2007 test set are shown in <xref ref-type="table" rid="T2">Table 2</xref>.</p>
<table-wrap position="float" id="T1">
<label>Table 1</label>
<caption><p>Recognition evaluation results on the ILSVRC2012 dataset (the smaller the average drop, the better, and the larger the average increase, the better).</p></caption>
<table frame="box" rules="all">
<thead>
<tr style="background-color:#919498;color:#ffffff">
<th valign="top" align="left"><bold>Method</bold></th>
<th valign="top" align="center"><bold>GradCAM</bold></th>
<th valign="top" align="center"><bold>GradCAM&#x0002B;&#x0002B;</bold></th>
<th valign="top" align="center"><bold>ScoreCAM</bold></th>
<th valign="top" align="center"><bold>GroupCAM</bold></th>
<th valign="top" align="center"><bold>UnionCAM</bold></th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">Average drop (%)</td>
<td valign="top" align="center">72.30</td>
<td valign="top" align="center">67.62</td>
<td valign="top" align="center">56.11</td>
<td valign="top" align="center">63.46</td>
<td valign="top" align="center"><bold>43.15</bold></td>
</tr>
<tr>
<td valign="top" align="left">Average increase (%)</td>
<td valign="top" align="center">19.45</td>
<td valign="top" align="center">16.35</td>
<td valign="top" align="center">22.7</td>
<td valign="top" align="center">21.4</td>
<td valign="top" align="center"><bold>28.95</bold></td>
</tr></tbody>
</table>
<table-wrap-foot>
<p>The bold values indicate evaluation metric of the activation maps confidence.</p>
</table-wrap-foot>
</table-wrap>
<table-wrap position="float" id="T2">
<label>Table 2</label>
<caption><p>Recognition evaluation results on the VOC2007 dataset (the smaller the average drop, the better, and the larger the average increase, the better).</p></caption>
<table frame="box" rules="all">
<thead>
<tr style="background-color:#919498;color:#ffffff">
<th valign="top" align="left"><bold>Method</bold></th>
<th valign="top" align="center"><bold>GradCAM</bold></th>
<th valign="top" align="center"><bold>GradCAM&#x0002B;&#x0002B;</bold></th>
<th valign="top" align="center"><bold>ScoreCAM</bold></th>
<th valign="top" align="center"><bold>GroupCAM</bold></th>
<th valign="top" align="center"><bold>UnionCAM</bold></th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">Average Drop(%)</td>
<td valign="top" align="center">53.07</td>
<td valign="top" align="center">39.51</td>
<td valign="top" align="center">18.88</td>
<td valign="top" align="center">32.33</td>
<td valign="top" align="center"><bold>15.77</bold></td>
</tr>
<tr>
<td valign="top" align="left">Average Increase(%)</td>
<td valign="top" align="center">22.15</td>
<td valign="top" align="center">10.72</td>
<td valign="top" align="center">27.41</td>
<td valign="top" align="center">25.62</td>
<td valign="top" align="center"><bold>28.57</bold></td>
</tr></tbody>
</table>
<table-wrap-foot>
<p>The bold values indicate evaluation metric of the activation maps confidence.</p>
</table-wrap-foot>
</table-wrap>
<p>As shown in <xref ref-type="table" rid="T1">Table 1</xref>, the average drop rate and average increase rate of UnionCAM are 43.15 and 28.95%, respectively, which are superior to the previous methods. Good performance on recognition tasks shows that UnionCAM is able to successfully find the most recognizable regions of the target object, not just what humans consider important. Experimental results on recognition tasks show that UnionCAM can more realistically reveal the decision-making process of the original CNN model than previous methods.</p>
<p>In addition, to more fully explain the superiority of our method, we also evaluate the deletion and insertion metrics mentioned in Petsiuk et al. (<xref ref-type="bibr" rid="B26">2018</xref>). This metric is in addition to the Average Decline and Increase metrics. The removal metric measures the decreasing trend of the predicted category score by removing more and more important pixels from the original image using the activation map as a mask. A sharp drop will cause the area under the curve to become smaller, and the smaller the area under the curve, the better the interpretation of the activation map. The insertion metric is just the opposite, as more and more pixels are inserted into the input image, the predicted class score rises. The larger the area under the curve, the better the interpretation of the activation map.</p>
<p>There are several methods (Dabkowski and Gal, <xref ref-type="bibr" rid="B9">2017</xref>) for removing pixels from an image, all of which have different advantages and disadvantages. We took the same approach as Zhang et al. (<xref ref-type="bibr" rid="B43">2021a</xref>). We calculate the AUC of the classification score after Softmax as a quantitative measure. In addition, we calculated the over-all score composite evaluation deletion and insertion results, calculated as AUC(insertion)&#x02014;AUC(deletion). The sample pictures are shown in <xref ref-type="fig" rid="F4">Figure 4</xref>, and the average results calculated by randomly selecting 2,000 pictures on the ImageNet (ILSVRC2012) validation set are shown in <xref ref-type="table" rid="T3">Table 3</xref>. Our method achieves the best results.</p>
<fig id="F4" position="float">
<label>Figure 4</label>
<caption><p>GradCAM&#x0002B;&#x0002B;, ScoreCAM, and UnionCAM (ours) generate activation maps for representative images, respectively. And generate deletion and insertion curves according to the activation map, in the insertion curve, the prediction score grows faster, and in the deletion curve, the classification confidence decreases faster, which is a better explanation.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fnbot-18-1490198-g0004.tif"/>
</fig>
<table-wrap position="float" id="T3">
<label>Table 3</label>
<caption><p>In the ImageNet (ILSVRC2012) validation set, comparisons are made in terms of deletion (lower is better), insertion (higher is better) scores and over-all (<bold>higher is better</bold>) evaluation metrics.</p></caption>
<table frame="box" rules="all">
<thead>
<tr style="background-color:#919498;color:#ffffff">
<th valign="top" align="left"><bold>Method</bold></th>
<th valign="top" align="center"><bold>GradCAM</bold></th>
<th valign="top" align="center"><bold>GradCAM&#x0002B;&#x0002B;</bold></th>
<th valign="top" align="center"><bold>ScoreCAM</bold></th>
<th valign="top" align="center"><bold>GroupCAM</bold></th>
<th valign="top" align="center"><bold>UnionCAM</bold></th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">Insertion (%)</td>
<td valign="top" align="center">53.5</td>
<td valign="top" align="center">50.0</td>
<td valign="top" align="center">55.1</td>
<td valign="top" align="center">56.8</td>
<td valign="top" align="center"><bold>57.2</bold></td>
</tr>
<tr>
<td valign="top" align="left">Deletion (%)</td>
<td valign="top" align="center">13.3</td>
<td valign="top" align="center">14.8</td>
<td valign="top" align="center"><bold>11.5</bold></td>
<td valign="top" align="center">12.3</td>
<td valign="top" align="center">11.9</td>
</tr>
<tr>
<td valign="top" align="left">Over-all (%)</td>
<td valign="top" align="center">40.2</td>
<td valign="top" align="center">35.2</td>
<td valign="top" align="center">43.6</td>
<td valign="top" align="center">44.5</td>
<td valign="top" align="center"><bold>45.3</bold></td>
</tr></tbody>
</table>
<table-wrap-foot>
<p>The best results are marked in bold. The best results are marked in bold.</p>
</table-wrap-foot>
</table-wrap>
</sec>
<sec>
<title>4.3 Visual qualitative evaluation</title>
<p>We qualitatively compare the activation maps generated by our method with those from other state-of-the-art models. Our method produces activation maps that are relatively complete and exhibit less noise compared to those generated by GroupCAM and ScoreCAM. As shown in <xref ref-type="fig" rid="F5">Figure 5</xref>, GradCAM sometimes focuses on irrelevant regions, leading to confusion in identifying key regions, such as the table area in the first row and the sky area in the second row. In contrast, GradCAM&#x0002B;&#x0002B; aims to concentrate more on relevant areas, but it may inadvertently neglect some meaningful regions, resulting in incomplete interpretations. For instance, in the fourth row, GradCAM&#x0002B;&#x0002B; has poor performance in capturing the meaningful area of the train. ScoreCAM occasionally has limited emphasis on target regions, as seen in the third row, potentially overlooking significant areas that contribute to the overall understanding of the model&#x00027;s decisions. GroupCAM sometimes fails to effectively focus on the target object, and its attention on large areas can dilute the focus on meaningful regions. In contrast, our method can often not only enhance the clarity of the activation maps but also ensure a more balanced focus on both relevant and meaningful regions. Our method effectively integrates useful information from different maps through a combination of soft and hard fusion techniques. This adaptive integration mechanism allows for a dynamic refinement of the activation maps, ensuring that the relevant and informative features are retained.</p>
<fig id="F5" position="float">
<label>Figure 5</label>
<caption><p>Visualization results of GradCAM, GradCAM&#x0002B;&#x0002B;, ScoreCAM, GorupCAM, and UnionCAM.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fnbot-18-1490198-g0005.tif"/>
</fig>
<p>We further examine whether UnionCAM can distinguish between different classes. As shown in <xref ref-type="fig" rid="F6">Figure 6</xref>, when VGG16 is used to classify the input as &#x0201C;bulldog&#x0201D; and &#x0201C;tabby cat,&#x0201D; UnionCAM provides distinct and accurate localization for each category, despite different confidence levels. As shown in <xref ref-type="fig" rid="F6">Figure 6</xref>, VGG16 classifies the input as &#x0201C;bulldog&#x0201D; (47.08% confidence) and &#x0201C;tabby cat&#x0201D; (41% confidence). Although the confidence of the latter is lower than that of the former, UnionCAM can correctly provide the explanation positions corresponding to the two categories.</p>
<fig id="F6" position="float">
<label>Figure 6</label>
<caption><p>Category discrimination results. The middle graph is generated based on the input category of &#x0201C;bulldog,&#x0201D; and the graph on the right is generated based on the input category of &#x0201C;tabby cat.&#x0201D;</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fnbot-18-1490198-g0006.tif"/>
</fig>
<p>UnionCAM not only accurately localizes single objects but also excels in identifying multiple objects within the same scene (two birds are located), outperforming previous methods. <xref ref-type="fig" rid="F7">Figure 7</xref> illustrates the superior multi-target detection capability of UnionCAM compared to GradCAM and ScoreCAM. However, the activation map generated by UnionCAM is more complete and focused compared to ScoreCAM.</p>
<fig id="F7" position="float">
<label>Figure 7</label>
<caption><p>Multi-target detection results. From the results, GradCAM can usually locate only one object, while both ScoreCAM and UnionCAM can locate multiple objects, and UnionCAM is more interpretable.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fnbot-18-1490198-g0007.tif"/>
</fig>
</sec>
<sec>
<title>4.4 Ablations</title>
<p>We conduct ablation experiments on the ImageNet (ILSVRC2012) validation set to deeply investigate the effects of the denoising threshold &#x003B8; and the activation map union weights &#x003B2;<sub><italic>Denoising</italic></sub> and &#x003B2;<sub><italic>Region</italic></sub> on the results. The experimental results are shown in <xref ref-type="fig" rid="F8">Figure 8</xref> and <xref ref-type="table" rid="T3">Table 3</xref>. The baseline at this stage is the network with only the Activation Map Selection (AMS) module added, and the Activation Map Union (AMU) module directly sums the two activation maps without any weighting.</p>
<fig id="F8" position="float">
<label>Figure 8</label>
<caption><p>In the ImageNet (ILSVRC2012) validation set, the ablation experiments on the filter threshold <italic>&#x003B8;</italic> are evaluated in terms of average drop (lower is better), average increase (higher is better), and over-all (lower is better) evaluation metrics performance.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fnbot-18-1490198-g0008.tif"/>
</fig>
<p>From <xref ref-type="fig" rid="F8">Figure 8</xref>, we can see that the threshold &#x003B8; has a significant impact on the UnionCAM results. The <italic>overall</italic> score is calculated as <italic>Average Drop</italic>&#x02212;<italic>Average Increase</italic>, so a lower value indicates better performance. When &#x003B8; is relatively small, the <italic>overall</italic> score decreases. However, when &#x003B8;&#x0003E;10, the <italic>overall</italic> score begins to increase sharply. To obtain better activation map quality, we set the default value of &#x003B8; to 10.</p>
<p>We also experimented with adding weights &#x003B2;<sub><italic>Denoising</italic></sub> and &#x003B2;<sub><italic>Region</italic></sub> to combine the two activation maps in the AMU module, and compared the results with the baseline. The results show that both <italic>Average Drop</italic> and <italic>Average Increase</italic> have achieved better performance than the baseline after adding weights. The aggregated results are shown in <xref ref-type="table" rid="T4">Table 4</xref>.</p>
<table-wrap position="float" id="T4">
<label>Table 4</label>
<caption><p>In the ImageNet (ILSVRC2012) validation set, comparisons are made in terms of deletion (lower is better), insertion (higher is better) scores, and overall (higher is better) evaluation metrics.</p></caption>
<table frame="box" rules="all">
<thead>
<tr style="background-color:#919498;color:#ffffff">
<th valign="top" align="left"><bold>Method</bold></th>
<th valign="top" align="center"><bold>Average drop</bold></th>
<th valign="top" align="center"><bold>Average increase</bold></th>
<th valign="top" align="center"><bold>Overall</bold></th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">Base (%)</td>
<td valign="top" align="center">45.21</td>
<td valign="top" align="center">28.20</td>
<td valign="top" align="center">17.01</td>
</tr>
<tr>
<td valign="top" align="left">Base &#x0002B; de-noising 10 (%)</td>
<td valign="top" align="center">44.64</td>
<td valign="top" align="center">28.85</td>
<td valign="top" align="center">15.79</td>
</tr>
<tr>
<td valign="top" align="left">Base &#x0002B; Weight (%)</td>
<td valign="top" align="center">43.71</td>
<td valign="top" align="center">28.75</td>
<td valign="top" align="center">14.96</td>
</tr>
<tr>
<td valign="top" align="left">Base &#x0002B; de-no &#x0002B; Weight (%)</td>
<td valign="top" align="center"><bold>43.15</bold></td>
<td valign="top" align="center"><bold>28.95</bold></td>
<td valign="top" align="center"><bold>14.20</bold></td>
</tr></tbody>
</table>
<table-wrap-foot>
<p>The best results are marked in bold.</p>
</table-wrap-foot>
</table-wrap>
</sec>
</sec>
<sec sec-type="conclusions" id="s5">
<title>5 Conclusions</title>
<p>In this paper, we propose a novel visual interpretation method called UnionCAM for explaining the decision-making process of deep convolutional neural networks. UnionCAM addresses the limitations of existing methods by introducing a &#x0201C;denoising-union-selection&#x0201D; strategy to generate class activation maps (CAMs). The proposed method consists of three key modules: (1) an Activation Map Denoising (AMD) module to remove meaningless background noise from the gradient-based CAMs; (2) an Activation Map Union (AMU) module to combine the denoised CAMs with region-based CAMs using a learnable weight; and (3) an Activation Map Selection (AMS) module to adaptively select the most informative CAM for visual interpretation. We evaluate the proposed UnionCAM on two benchmark datasets, ILSVRC2012 and VOC2007, using four widely-used evaluation metrics: insertion, deletion, average drop, and average increase. The extensive experimental results demonstrate that UnionCAM outperforms the state-of-the-art methods by a significant margin. In particular, UnionCAM achieves a better balance between removing irrelevant background noise and preserving the complete object activation region, resulting in more accurate and human-interpretable visual explanations.</p>
<p>The proposed UnionCAM provides a novel perspective on interpreting the behavior of deep neural networks. By combining the strengths of both gradient-based and region-based methods, UnionCAM offers a more comprehensive and reliable approach to generate visual explanations. We believe that the insights gained from this work can facilitate the development of more transparent and trustworthy deep learning models, especially in critical domains such as healthcare and autonomous driving. While UnionCAM presents significant advantages, such as enhanced interpretability and improved activation map quality, it is important to also consider its limitations that may impact its effectiveness in various applications. The weighted fusion strategy, although effective, may struggle with complex scenes or overlapping objects, potentially leading to less accurate activation maps. This highlights the need for further refinement of the fusion mechanism to handle diverse visual challenges. In addition, The quality of region-based activation maps sometimes can impact the performance of the algorithm. Consequently, enhancing the quality of these maps is crucial for improving not only the interpretability but also the overall effectiveness of the algorithm.</p>
<p>In future work, we plan to extend UnionCAM to other types of neural networks, such as recurrent neural networks and graph neural networks, to provide a unified framework for interpretable deep learning. We will also explore the potential of integrating UnionCAM with other explanation techniques, such as feature visualization and concept activation vectors, to further enhance the interpretability of deep neural networks.</p>
</sec>
</body>
<back>
<sec sec-type="data-availability" id="s6">
<title>Data availability statement</title>
<p>The datasets presented in this study can be found in online repositories. The names of the repository/repositories and accession number(s) can be found in the article/supplementary material.</p>
</sec>
<sec sec-type="author-contributions" id="s7">
<title>Author contributions</title>
<p>HH: Conceptualization, Data curation, Methodology, Software, Validation, Writing &#x02013; original draft, Writing &#x02013; review &#x00026; editing. RW: Conceptualization, Supervision, Validation, Writing &#x02013; review &#x00026; editing. HL: Validation, Writing &#x02013; review &#x00026; editing. HY: Data curation, Writing &#x02013; review &#x00026; editing.</p>
</sec>
<sec sec-type="funding-information" id="s8">
<title>Funding</title>
<p>The author(s) declare financial support was received for the research, authorship, and/or publication of this article. This research was funded by Science and Technology Research and Development Plan of China State Railway Group Co., Ltd. (grant number: K2023T003).</p>
</sec>
<sec sec-type="COI-statement" id="conf1">
<title>Conflict of interest</title>
<p>HH, RW, and HY were employed by China Academy of Railway Sciences Corporation Ltd. The remaining author declares that the research was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest.</p>
</sec>
<sec sec-type="disclaimer" id="s9">
<title>Publisher&#x00027;s note</title>
<p>All claims expressed in this article are solely those of the authors and do not necessarily represent those of their affiliated organizations, or those of the publisher, the editors and the reviewers. Any product that may be evaluated in this article, or claim that may be made by its manufacturer, is not guaranteed or endorsed by the publisher.</p>
</sec>
<ref-list>
<title>References</title>
<ref id="B1">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Adebayo</surname> <given-names>J.</given-names></name> <name><surname>Gilmer</surname> <given-names>J.</given-names></name> <name><surname>Goodfellow</surname> <given-names>I.</given-names></name> <name><surname>Kim</surname> <given-names>B.</given-names></name></person-group> (<year>2018</year>). <article-title>Local explanation methods for deep neural networks lack sensitivity to parameter values</article-title>. <source>arXiv preprint arXiv:1810.03307</source>. <pub-id pub-id-type="doi">10.48550/arXiv.1810.03307</pub-id></citation>
</ref>
<ref id="B2">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Ahn</surname> <given-names>J.</given-names></name> <name><surname>Cho</surname> <given-names>S.</given-names></name> <name><surname>Kwak</surname> <given-names>S.</given-names></name></person-group> (<year>2019</year>). <article-title>&#x0201C;Weakly supervised learning of instance segmentation with inter-pixel relations,&#x0201D;</article-title> in <source>Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition</source> (<publisher-loc>Long Beach, CA</publisher-loc>: <publisher-name>IEEE</publisher-name>), <fpage>2209</fpage>&#x02013;<lpage>2218</lpage>.</citation>
</ref>
<ref id="B3">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Bau</surname> <given-names>D.</given-names></name> <name><surname>Zhu</surname> <given-names>J.-Y.</given-names></name> <name><surname>Strobelt</surname> <given-names>H.</given-names></name> <name><surname>Zhou</surname> <given-names>B.</given-names></name> <name><surname>Tenenbaum</surname> <given-names>J. B.</given-names></name> <name><surname>Freeman</surname> <given-names>W. T.</given-names></name> <etal/></person-group>. (<year>2018</year>). <article-title>GAN dissection: visualizing and understanding generative adversarial networks</article-title>. <source>arXiv preprint arXiv:1811.10597</source>. <pub-id pub-id-type="doi">10.48550/arXiv.1811.10597</pub-id></citation>
</ref>
<ref id="B4">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Byun</surname> <given-names>S.-Y.</given-names></name> <name><surname>Lee</surname> <given-names>W.</given-names></name></person-group> (<year>2022</year>). <article-title>Recipro-CAM: fast gradient-free visual explanations for convolutional neural networks</article-title>. <source>arXiv preprint arXiv:2209.14074</source>. <pub-id pub-id-type="doi">10.48550/arXiv.2209.14074</pub-id></citation>
</ref>
<ref id="B5">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Byun</surname> <given-names>S.-Y.</given-names></name> <name><surname>Lee</surname> <given-names>W.</given-names></name></person-group> (<year>2023</year>). <article-title>ViT-ReciproCAM: gradient and attention-free visual explanations for vision transformer</article-title>. <source>arXiv preprint arXiv:2310.02588</source>. <pub-id pub-id-type="doi">10.48550/arXiv.2310.02588</pub-id></citation>
</ref>
<ref id="B6">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Chattopadhay</surname> <given-names>A.</given-names></name> <name><surname>Sarkar</surname> <given-names>A.</given-names></name> <name><surname>Howlader</surname> <given-names>P.</given-names></name> <name><surname>Balasubramanian</surname> <given-names>V. N.</given-names></name></person-group> (<year>2018</year>). <article-title>&#x0201C;Grad-CAM&#x0002B;&#x0002B;: generalized gradient-based visual explanations for deep convolutional networks,&#x0201D;</article-title> in <source>2018 IEEE Winter Conference on Applications of Computer Vision (WACV)</source> (<publisher-loc>Lake Tahoe, NV</publisher-loc>: <publisher-name>IEEE</publisher-name>), <fpage>839</fpage>&#x02013;<lpage>847</lpage>.</citation>
</ref>
<ref id="B7">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Clement</surname> <given-names>F.</given-names></name> <name><surname>Yang</surname> <given-names>J.</given-names></name> <name><surname>Cheng</surname> <given-names>I.</given-names></name></person-group> (<year>2024</year>). <article-title>Feature CAM: interpretable ai in image classification</article-title>. <source>arXiv preprint arXiv:2403.05658</source>. <pub-id pub-id-type="doi">10.48550/arXiv.2403.05658</pub-id></citation>
</ref>
<ref id="B8">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Cui</surname> <given-names>Y.</given-names></name> <name><surname>Yan</surname> <given-names>L.</given-names></name> <name><surname>Cao</surname> <given-names>Z.</given-names></name> <name><surname>Liu</surname> <given-names>D.</given-names></name></person-group> (<year>2021</year>). <article-title>&#x0201C;Tf-blender: temporal feature blender for video object detection,&#x0201D;</article-title> in <source>Proceedings of the IEEE/CVF International Conference on Computer Vision</source> (<publisher-loc>Montreal, QC</publisher-loc>: <publisher-name>IEEE</publisher-name>), <fpage>8138</fpage>&#x02013;<lpage>8147</lpage>.</citation>
</ref>
<ref id="B9">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Dabkowski</surname> <given-names>P.</given-names></name> <name><surname>Gal</surname> <given-names>Y.</given-names></name></person-group> (<year>2017</year>). <article-title>Real time image saliency for black box classifiers</article-title>. <source>Adv. Neural Inform. Process. Syst</source>. <volume>30</volume>:<fpage>7857</fpage>. <pub-id pub-id-type="doi">10.48550/arXiv.1705.07857</pub-id></citation>
</ref>
<ref id="B10">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Everingham</surname> <given-names>M.</given-names></name> <name><surname>Eslami</surname> <given-names>S. A.</given-names></name> <name><surname>Van Gool</surname> <given-names>L.</given-names></name> <name><surname>Williams</surname> <given-names>C. K.</given-names></name> <name><surname>Winn</surname> <given-names>J.</given-names></name> <name><surname>Zisserman</surname> <given-names>A.</given-names></name></person-group> (<year>2015</year>). <article-title>The pascal visual object classes challenge: a retrospective</article-title>. <source>Int. J. Comput. Vis</source>. <volume>111</volume>, <fpage>98</fpage>&#x02013;<lpage>136</lpage>. <pub-id pub-id-type="doi">10.1007/s11263-014-0733-5</pub-id></citation>
</ref>
<ref id="B11">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Fu</surname> <given-names>R.</given-names></name> <name><surname>Hu</surname> <given-names>Q.</given-names></name> <name><surname>Dong</surname> <given-names>X.</given-names></name> <name><surname>Guo</surname> <given-names>Y.</given-names></name> <name><surname>Gao</surname> <given-names>Y.</given-names></name> <name><surname>Li</surname> <given-names>B.</given-names></name></person-group> (<year>2020</year>). <article-title>Axiom-based Grad-CAM: towards accurate visualization and explanation of CNNs</article-title>. <source>arXiv preprint arXiv:2008.02312</source>. <pub-id pub-id-type="doi">10.48550/arXiv.2008.02312</pub-id></citation>
</ref>
<ref id="B12">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Jiang</surname> <given-names>P.-T.</given-names></name> <name><surname>Zhang</surname> <given-names>C.-B.</given-names></name> <name><surname>Hou</surname> <given-names>Q.</given-names></name> <name><surname>Cheng</surname> <given-names>M.-M.</given-names></name> <name><surname>Wei</surname> <given-names>Y.</given-names></name></person-group> (<year>2021</year>). <article-title>LayerCAM: exploring hierarchical class activation maps for localization</article-title>. <source>IEEE Trans. Image Process</source>. <volume>30</volume>, <fpage>5875</fpage>&#x02013;<lpage>5888</lpage>. <pub-id pub-id-type="doi">10.1109/TIP.2021.3089943</pub-id><pub-id pub-id-type="pmid">34156941</pub-id></citation></ref>
<ref id="B13">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Jiao</surname> <given-names>J.</given-names></name> <name><surname>Cao</surname> <given-names>Y.</given-names></name> <name><surname>Song</surname> <given-names>Y.</given-names></name> <name><surname>Lau</surname> <given-names>R.</given-names></name></person-group> (<year>2018</year>). <article-title>&#x0201C;Look deeper into depth: monocular depth estimation with semantic booster and attention-driven loss,&#x0201D;</article-title> in <source>Proceedings of the European Conference on Computer Vision (ECCV)</source>, 53&#x02013;69. <pub-id pub-id-type="doi">10.1007/978-3-030-01267-0_4</pub-id></citation>
</ref>
<ref id="B14">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Kapishnikov</surname> <given-names>A.</given-names></name> <name><surname>Bolukbasi</surname> <given-names>T.</given-names></name> <name><surname>Vi&#x000E9;gas</surname> <given-names>F.</given-names></name> <name><surname>Terry</surname> <given-names>M.</given-names></name></person-group> (<year>2019</year>). <article-title>&#x0201C;XRAI: Better attributions through regions,&#x0201D;</article-title> in <source>Proceedings of the IEEE/CVF International Conference on Computer Vision</source> (<publisher-loc>Seoul</publisher-loc>: <publisher-name>IEEE</publisher-name>), <fpage>4948</fpage>&#x02013;<lpage>4957</lpage>.</citation>
</ref>
<ref id="B15">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Lang</surname> <given-names>O.</given-names></name> <name><surname>Gandelsman</surname> <given-names>Y.</given-names></name> <name><surname>Yarom</surname> <given-names>M.</given-names></name> <name><surname>Wald</surname> <given-names>Y.</given-names></name> <name><surname>Elidan</surname> <given-names>G.</given-names></name> <name><surname>Hassidim</surname> <given-names>A.</given-names></name> <etal/></person-group>. (<year>2021</year>). <article-title>&#x0201C;Explaining in style: training a gan to explain a classifier in stylespace,&#x0201D;</article-title> in <source>Proceedings of the IEEE/CVF International Conference on Computer Vision</source> (<publisher-loc>Montreal, ON</publisher-loc>: <publisher-name>IEEE</publisher-name>), <fpage>693</fpage>&#x02013;<lpage>702</lpage>.</citation>
</ref>
<ref id="B16">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Li</surname> <given-names>H.</given-names></name> <name><surname>Li</surname> <given-names>Z.</given-names></name> <name><surname>Ma</surname> <given-names>R.</given-names></name> <name><surname>Wu</surname> <given-names>T.</given-names></name></person-group> (<year>2022</year>). <article-title>&#x0201C;FD-CAM: improving faithfulness and discriminability of visual explanation for CNNs,&#x0201D;</article-title> in <source>2022 26th International Conference on Pattern Recognition (ICPR)</source> (<publisher-loc>Montreal, QC</publisher-loc>: <publisher-name>IEEE</publisher-name>), <fpage>1300</fpage>&#x02013;<lpage>1306</lpage>.</citation>
</ref>
<ref id="B17">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Li</surname> <given-names>J.</given-names></name> <name><surname>Zhang</surname> <given-names>D.</given-names></name> <name><surname>Meng</surname> <given-names>B.</given-names></name> <name><surname>Li</surname> <given-names>Y.</given-names></name> <name><surname>Luo</surname> <given-names>L.</given-names></name></person-group> (<year>2023</year>). <article-title>FIMF score-CAM: fast score-cam based on local multi-feature integration for visual interpretation of CNNs</article-title>. <source>IET Image Process</source>. <volume>17</volume>, <fpage>761</fpage>&#x02013;<lpage>772</lpage>. <pub-id pub-id-type="doi">10.1049/ipr2.12670</pub-id></citation>
</ref>
<ref id="B18">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Li</surname> <given-names>Y.</given-names></name> <name><surname>Kuang</surname> <given-names>Z.</given-names></name> <name><surname>Liu</surname> <given-names>L.</given-names></name> <name><surname>Chen</surname> <given-names>Y.</given-names></name> <name><surname>Zhang</surname> <given-names>W.</given-names></name></person-group> (<year>2021</year>). <article-title>&#x0201C;Pseudo-mask matters in weakly-supervised semantic segmentation,&#x0201D;</article-title> in <source>Proceedings of the IEEE/CVF International Conference on Computer Vision</source> (<publisher-loc>Montreal, QC</publisher-loc>: <publisher-name>IEEE</publisher-name>), <fpage>6964</fpage>&#x02013;<lpage>6973</lpage>.</citation>
</ref>
<ref id="B19">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Liang</surname> <given-names>J.</given-names></name> <name><surname>Wang</surname> <given-names>Y.</given-names></name> <name><surname>Chen</surname> <given-names>Y.</given-names></name> <name><surname>Yang</surname> <given-names>B.</given-names></name> <name><surname>Liu</surname> <given-names>D.</given-names></name></person-group> (<year>2022</year>). <article-title>A triangulation-based visual localization for field robots</article-title>. <source>IEEE/CAA J. Automat. Sin</source>. <volume>9</volume>, <fpage>1083</fpage>&#x02013;<lpage>1086</lpage>. <pub-id pub-id-type="doi">10.1109/JAS.2022.105632</pub-id></citation>
</ref>
<ref id="B20">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Liu</surname> <given-names>D.</given-names></name> <name><surname>Cui</surname> <given-names>Y.</given-names></name> <name><surname>Guo</surname> <given-names>X.</given-names></name> <name><surname>Ding</surname> <given-names>W.</given-names></name> <name><surname>Yang</surname> <given-names>B.</given-names></name> <name><surname>Chen</surname> <given-names>Y.</given-names></name></person-group> (<year>2021a</year>). <article-title>&#x0201C;Visual localization for autonomous driving: mapping the accurate location in the city maze,&#x0201D;</article-title> in <source>2020 25th International Conference on Pattern Recognition (ICPR)</source> (<publisher-loc>Milan</publisher-loc>: <publisher-name>IEEE</publisher-name>), <fpage>3170</fpage>&#x02013;<lpage>3177</lpage>.</citation>
</ref>
<ref id="B21">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Liu</surname> <given-names>D.</given-names></name> <name><surname>Cui</surname> <given-names>Y.</given-names></name> <name><surname>Yan</surname> <given-names>L.</given-names></name> <name><surname>Mousas</surname> <given-names>C.</given-names></name> <name><surname>Yang</surname> <given-names>B.</given-names></name> <name><surname>Chen</surname> <given-names>Y.</given-names></name></person-group> (<year>2021b</year>). <article-title>DenserNet: weakly supervised visual localization using multi-scale feature aggregation</article-title>. <source>Proc. AAAI Conf. Artif. Intell</source>. <volume>35</volume>, <fpage>6101</fpage>&#x02013;<lpage>6109</lpage>. <pub-id pub-id-type="doi">10.48550/arXiv.2012.02366</pub-id><pub-id pub-id-type="pmid">39236124</pub-id></citation></ref>
<ref id="B22">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Lu</surname> <given-names>Y.</given-names></name> <name><surname>Wang</surname> <given-names>Q.</given-names></name> <name><surname>Ma</surname> <given-names>S.</given-names></name> <name><surname>Geng</surname> <given-names>T.</given-names></name> <name><surname>Chen</surname> <given-names>Y. V.</given-names></name> <name><surname>Chen</surname> <given-names>H.</given-names></name> <name><surname>Liu</surname> <given-names>D.</given-names></name></person-group> (<year>2023</year>). <article-title>&#x0201C;TransFlow: Transformer as flow learner,&#x0201D;</article-title> in <source>Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition</source> (<publisher-loc>Vancouver, BC</publisher-loc>: <publisher-name>IEEE</publisher-name>), <fpage>18063</fpage>&#x02013;<lpage>18073</lpage>.<pub-id pub-id-type="pmid">39361459</pub-id></citation></ref>
<ref id="B23">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Morbidelli</surname> <given-names>P.</given-names></name> <name><surname>Carrera</surname> <given-names>D.</given-names></name> <name><surname>Rossi</surname> <given-names>B.</given-names></name> <name><surname>Fragneto</surname> <given-names>P.</given-names></name> <name><surname>Boracchi</surname> <given-names>G.</given-names></name></person-group> (<year>2020</year>). <article-title>&#x0201C;Augmented Grad-CAM: heat-maps super resolution through augmentation,&#x0201D;</article-title> in <source>ICASSP 2020-2020 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)</source> (<publisher-loc>Barcelona</publisher-loc>: <publisher-name>IEEE</publisher-name>), <fpage>4067</fpage>&#x02013;<lpage>4071</lpage>.</citation>
</ref>
<ref id="B24">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Naidu</surname> <given-names>R.</given-names></name> <name><surname>Ghosh</surname> <given-names>A.</given-names></name> <name><surname>Maurya</surname> <given-names>Y.</given-names></name> <name><surname>Nayak</surname> <given-names>S. R.</given-names></name> <name><surname>Kundu</surname> <given-names>S. S.</given-names></name></person-group> (<year>2020</year>). <article-title>IS-CAM: integrated score-cam for axiomatic-based explanations</article-title>. <source>arXiv preprint arXiv:2010.03023</source>. <pub-id pub-id-type="doi">10.48550/arXiv.2010.03023</pub-id></citation>
</ref>
<ref id="B25">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Omeiza</surname> <given-names>D.</given-names></name> <name><surname>Speakman</surname> <given-names>S.</given-names></name> <name><surname>Cintas</surname> <given-names>C.</given-names></name> <name><surname>Weldermariam</surname> <given-names>K.</given-names></name></person-group> (<year>2019</year>). <article-title>Smooth Grad-CAM&#x0002B;&#x0002B;: an enhanced inference level visualization technique for deep convolutional neural network models</article-title>. <source>arXiv preprint arXiv:1908.01224</source>. <pub-id pub-id-type="doi">10.48550/arXiv.1908.01224</pub-id></citation>
</ref>
<ref id="B26">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Petsiuk</surname> <given-names>V.</given-names></name> <name><surname>Das</surname> <given-names>A.</given-names></name> <name><surname>Saenko</surname> <given-names>K.</given-names></name></person-group> (<year>2018</year>). <article-title>Rise: randomized input sampling for explanation of black-box models</article-title>. <source>arXiv preprint arXiv:1806.07421</source>. <pub-id pub-id-type="doi">10.48550/arXiv.1806.07421</pub-id></citation>
</ref>
<ref id="B27">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Qian</surname> <given-names>D.</given-names></name> <name><surname>Zeng</surname> <given-names>H.</given-names></name> <name><surname>Cheng</surname> <given-names>W.</given-names></name> <name><surname>Liu</surname> <given-names>Y.</given-names></name> <name><surname>Bikki</surname> <given-names>T.</given-names></name> <name><surname>Pan</surname> <given-names>J.</given-names></name></person-group> (<year>2024</year>). <article-title>NeuroDM: decoding and visualizing human brain activity with eeg-guided diffusion model</article-title>. <source>Comput. Methods Programs Biomed</source>. <volume>251</volume>:<fpage>108213</fpage>. <pub-id pub-id-type="doi">10.1016/j.cmpb.2024.108213</pub-id><pub-id pub-id-type="pmid">38744056</pub-id></citation></ref>
<ref id="B28">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Ramaswamy</surname> <given-names>H. G.</given-names></name></person-group> (<year>2020</year>). <article-title>&#x0201C;Ablation-CAM: visual explanations for deep convolutional network via gradient-free localization,&#x0201D;</article-title> in <source>proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision</source> (<publisher-loc>Snowmass, CO</publisher-loc>: <publisher-name>IEEE</publisher-name>), <fpage>983</fpage>&#x02013;<lpage>991</lpage>.</citation>
</ref>
<ref id="B29">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Ranjan</surname> <given-names>A.</given-names></name> <name><surname>Jampani</surname> <given-names>V.</given-names></name> <name><surname>Balles</surname> <given-names>L.</given-names></name> <name><surname>Kim</surname> <given-names>K.</given-names></name> <name><surname>Sun</surname> <given-names>D.</given-names></name> <name><surname>Wulff</surname> <given-names>J.</given-names></name> <etal/></person-group>. (<year>2019</year>). <article-title>&#x0201C;Competitive collaboration: joint unsupervised learning of depth, camera motion, optical flow and motion segmentation,&#x0201D;</article-title> in <source>Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition</source> (<publisher-loc>Long Beach, CA</publisher-loc>: <publisher-name>IEEE</publisher-name>), <fpage>12240</fpage>&#x02013;<lpage>12249</lpage>.</citation>
</ref>
<ref id="B30">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Russakovsky</surname> <given-names>O.</given-names></name> <name><surname>Deng</surname> <given-names>J.</given-names></name> <name><surname>Su</surname> <given-names>H.</given-names></name> <name><surname>Krause</surname> <given-names>J.</given-names></name> <name><surname>Satheesh</surname> <given-names>S.</given-names></name> <name><surname>Ma</surname> <given-names>S.</given-names></name> <etal/></person-group>. (<year>2015</year>). <article-title>ImageNet large scale visual recognition challenge</article-title>. <source>Int. J. Comput. Vis</source>. <volume>115</volume>, <fpage>211</fpage>&#x02013;<lpage>252</lpage>. <pub-id pub-id-type="doi">10.48550/arXiv.1409.0575</pub-id></citation>
</ref>
<ref id="B31">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Salama</surname> <given-names>A.</given-names></name> <name><surname>Adly</surname> <given-names>N.</given-names></name> <name><surname>Torki</surname> <given-names>M.</given-names></name></person-group> (<year>2022</year>). <article-title>&#x0201C;Ablation-CAM&#x0002B;&#x0002B;: grouped recursive visual explanations for deep convolutional networks,&#x0201D;</article-title> in <source>2022 IEEE International Conference on Image Processing (ICIP)</source> (<publisher-loc>Bordeaux</publisher-loc>: <publisher-name>IEEE</publisher-name>), <fpage>2011</fpage>&#x02013;<lpage>2015</lpage>.</citation>
</ref>
<ref id="B32">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Sattarzadeh</surname> <given-names>S.</given-names></name> <name><surname>Sudhakar</surname> <given-names>M.</given-names></name> <name><surname>Plataniotis</surname> <given-names>K. N.</given-names></name> <name><surname>Jang</surname> <given-names>J.</given-names></name> <name><surname>Jeong</surname> <given-names>Y.</given-names></name> <name><surname>Kim</surname> <given-names>H.</given-names></name></person-group> (<year>2021</year>). <article-title>&#x0201C;Integrated Grad-CAM: Sensitivity-aware visual explanation of deep convolutional networks via integrated gradient-based scoring,&#x0201D;</article-title> in <source>ICASSP 2021-2021 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)</source> (<publisher-loc>Toronto, ON</publisher-loc>: <publisher-name>IEEE</publisher-name>), <fpage>1775</fpage>&#x02013;<lpage>1779</lpage>.</citation>
</ref>
<ref id="B33">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Selvaraju</surname> <given-names>R. R.</given-names></name> <name><surname>Cogswell</surname> <given-names>M.</given-names></name> <name><surname>Das</surname> <given-names>A.</given-names></name> <name><surname>Vedantam</surname> <given-names>R.</given-names></name> <name><surname>Parikh</surname> <given-names>D.</given-names></name> <name><surname>Batra</surname> <given-names>D.</given-names></name></person-group> (<year>2017</year>). <article-title>&#x0201C;Grad-CAM: visual explanations from deep networks via gradient-based localization,&#x0201D;</article-title> in <source>Proceedings of the IEEE International Conference on Computer Vision</source> (<publisher-loc>Venice</publisher-loc>: <publisher-name>IEEE</publisher-name>), <fpage>618</fpage>&#x02013;<lpage>626</lpage>.</citation>
</ref>
<ref id="B34">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Simonyan</surname> <given-names>K.</given-names></name> <name><surname>Zisserman</surname> <given-names>A.</given-names></name></person-group> (<year>2014</year>). <article-title>Very deep convolutional networks for large-scale image recognition</article-title>. <source>arXiv preprint arXiv:1409.1556</source>. <pub-id pub-id-type="doi">10.48550/arXiv.1409.1556</pub-id></citation>
</ref>
<ref id="B35">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Soomro</surname> <given-names>S.</given-names></name> <name><surname>Niaz</surname> <given-names>A.</given-names></name> <name><surname>Choi</surname> <given-names>K. N.</given-names></name></person-group> (<year>2024</year>). <article-title>Grad&#x0002B;&#x0002B; ScoreCAM: enhancing visual explanations of deep convolutional networks using incremented gradient and score-weighted methods</article-title>. <source>IEEE Access</source> <volume>12</volume>, <fpage>61104</fpage>&#x02013;<lpage>61112</lpage>. <pub-id pub-id-type="doi">10.1109/ACCESS.2024.3392853</pub-id></citation>
</ref>
<ref id="B36">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Springenberg</surname> <given-names>J. T.</given-names></name> <name><surname>Dosovitskiy</surname> <given-names>A.</given-names></name> <name><surname>Brox</surname> <given-names>T.</given-names></name> <name><surname>Riedmiller</surname> <given-names>M.</given-names></name></person-group> (<year>2014</year>). <article-title>Striving for simplicity: the all convolutional net</article-title>. <source>arXiv preprint arXiv:1412.6806</source>. <pub-id pub-id-type="doi">10.48550/arXiv.1412.6806</pub-id></citation>
</ref>
<ref id="B37">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Sundararajan</surname> <given-names>M.</given-names></name> <name><surname>Taly</surname> <given-names>A.</given-names></name> <name><surname>Yan</surname> <given-names>Q.</given-names></name></person-group> (<year>2017</year>). <article-title>&#x0201C;Axiomatic attribution for deep networks,&#x0201D;</article-title> in <source>International Conference on Machine Learning</source>, 3319&#x02013;3328. <pub-id pub-id-type="doi">10.48550/arXiv.1703.01365</pub-id></citation>
</ref>
<ref id="B38">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Wang</surname> <given-names>H.</given-names></name> <name><surname>Naidu</surname> <given-names>R.</given-names></name> <name><surname>Michael</surname> <given-names>J.</given-names></name> <name><surname>Kundu</surname> <given-names>S. S.</given-names></name></person-group> (<year>2020a</year>). <article-title>SS-CAM: smoothed score-cam for sharper visual feature localization</article-title>. <source>arXiv preprint arXiv:2006.14255</source>. <pub-id pub-id-type="doi">10.48550/arXiv.2006.14255</pub-id></citation>
</ref>
<ref id="B39">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Wang</surname> <given-names>H.</given-names></name> <name><surname>Wang</surname> <given-names>Z.</given-names></name> <name><surname>Du</surname> <given-names>M.</given-names></name> <name><surname>Yang</surname> <given-names>F.</given-names></name> <name><surname>Zhang</surname> <given-names>Z.</given-names></name> <name><surname>Ding</surname> <given-names>S.</given-names></name> <etal/></person-group>. (<year>2020b</year>). <article-title>&#x0201C;Score-CAM: score-weighted visual explanations for convolutional neural networks,&#x0201D;</article-title> in <source>Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops</source> (<publisher-loc>Seattle, WA</publisher-loc>: <publisher-name>IEEE</publisher-name>), <fpage>24</fpage>&#x02013;<lpage>25</lpage>.</citation>
</ref>
<ref id="B40">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Yan</surname> <given-names>L.</given-names></name> <name><surname>Cui</surname> <given-names>Y.</given-names></name> <name><surname>Chen</surname> <given-names>Y.</given-names></name> <name><surname>Liu</surname> <given-names>D.</given-names></name></person-group> (<year>2021</year>). <article-title>&#x0201C;Hierarchical attention fusion for geo-localization,&#x0201D;</article-title> in <source>ICASSP 2021-2021 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)</source> (<publisher-loc>Toronto, ON</publisher-loc>: <publisher-name>IEEE</publisher-name>), <fpage>2220</fpage>&#x02013;<lpage>2224</lpage>.</citation>
</ref>
<ref id="B41">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Yu</surname> <given-names>W.</given-names></name> <name><surname>Lei</surname> <given-names>B.</given-names></name> <name><surname>Wang</surname> <given-names>S.</given-names></name> <name><surname>Liu</surname> <given-names>Y.</given-names></name> <name><surname>Feng</surname> <given-names>Z.</given-names></name> <name><surname>Hu</surname> <given-names>Y.</given-names></name> <etal/></person-group>. (<year>2022</year>). <article-title>Morphological feature visualization of Alzheimer&#x00027;s disease via multidirectional perception GAN</article-title>. <source>IEEE Trans. Neural Netw. Learn. Syst</source>. <volume>34</volume>, <fpage>4401</fpage>&#x02013;<lpage>4415</lpage>. <pub-id pub-id-type="doi">10.1109/TNNLS.2021.3118369</pub-id><pub-id pub-id-type="pmid">35320106</pub-id></citation></ref>
<ref id="B42">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Zeiler</surname> <given-names>M. D.</given-names></name> <name><surname>Fergus</surname> <given-names>R.</given-names></name></person-group> (<year>2014</year>). <article-title>&#x0201C;Visualizing and understanding convolutional networks,&#x0201D;</article-title> in <source>European Conference on Computer Vision</source> (<publisher-loc>Berlin</publisher-loc>: <publisher-name>Springer</publisher-name>), <fpage>818</fpage>&#x02013;<lpage>833</lpage>.</citation>
</ref>
<ref id="B43">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Zhang</surname> <given-names>Q.</given-names></name> <name><surname>Rao</surname> <given-names>L.</given-names></name> <name><surname>Yang</surname> <given-names>Y.</given-names></name></person-group> (<year>2021a</year>). <article-title>Group-CAM: group score-weighted visual explanations for deep convolutional networks</article-title>. <source>arXiv preprint arXiv:2103.13859</source>. <pub-id pub-id-type="doi">10.48550/arXiv.2103.13859</pub-id></citation>
</ref>
<ref id="B44">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Zhang</surname> <given-names>Q.</given-names></name> <name><surname>Rao</surname> <given-names>L.</given-names></name> <name><surname>Yang</surname> <given-names>Y.</given-names></name></person-group> (<year>2021b</year>). <article-title>A novel visual interpretability for deep neural networks by optimizing activation maps with perturbation</article-title>. <source>Proc. AAAI Conf. Artif. Intell</source>. <volume>35</volume>, <fpage>3377</fpage>&#x02013;<lpage>3384</lpage>. <pub-id pub-id-type="doi">10.1609/aaai.v35i4.16450</pub-id></citation>
</ref>
<ref id="B45">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Zhang</surname> <given-names>X.</given-names></name> <name><surname>Wei</surname> <given-names>Y.</given-names></name> <name><surname>Kang</surname> <given-names>G.</given-names></name> <name><surname>Yang</surname> <given-names>Y.</given-names></name> <name><surname>Huang</surname> <given-names>T.</given-names></name></person-group> (<year>2018</year>). <article-title>&#x0201C;Self-produced guidance for weakly-supervised object localization,&#x0201D;</article-title> in <source>Proceedings of the European Conference on Computer Vision (ECCV)</source>, 597&#x02013;613. <pub-id pub-id-type="doi">10.1007/978-3-030-01258-8_37</pub-id></citation>
</ref>
<ref id="B46">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Zhao</surname> <given-names>W.</given-names></name> <name><surname>Rao</surname> <given-names>Y.</given-names></name> <name><surname>Liu</surname> <given-names>Z.</given-names></name> <name><surname>Liu</surname> <given-names>B.</given-names></name> <name><surname>Zhou</surname> <given-names>J.</given-names></name> <name><surname>Lu</surname> <given-names>J.</given-names></name></person-group> (<year>2023</year>). <article-title>&#x0201C;Unleashing text-to-image diffusion models for visual perception,&#x0201D;</article-title> in <source>Proceedings of the IEEE/CVF International Conference on Computer Vision</source> (<publisher-loc>Paris</publisher-loc>: <publisher-name>IEEE</publisher-name>), <fpage>5729</fpage>&#x02013;<lpage>5739</lpage>.</citation>
</ref>
<ref id="B47">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Zhou</surname> <given-names>B.</given-names></name> <name><surname>Khosla</surname> <given-names>A.</given-names></name> <name><surname>Lapedriza</surname> <given-names>A.</given-names></name> <name><surname>Oliva</surname> <given-names>A.</given-names></name> <name><surname>Torralba</surname> <given-names>A.</given-names></name></person-group> (<year>2016</year>). <article-title>&#x0201C;Learning deep features for discriminative localization,&#x0201D;</article-title> in <source>Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition</source> (<publisher-loc>Las Vegas, NV</publisher-loc>: <publisher-name>IEEE</publisher-name>), <fpage>2921</fpage>&#x02013;<lpage>2929</lpage>.</citation>
</ref>
<ref id="B48">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Zong</surname> <given-names>Y.</given-names></name> <name><surname>Zuo</surname> <given-names>Q.</given-names></name> <name><surname>Ng</surname> <given-names>M. K.-P.</given-names></name> <name><surname>Lei</surname> <given-names>B.</given-names></name> <name><surname>Wang</surname> <given-names>S.</given-names></name></person-group> (<year>2024</year>). <article-title>A new brain network construction paradigm for brain disorder via diffusion-based graph contrastive learning</article-title>. <source>IEEE Trans. Patt. Anal. Machine Intell</source>. <volume>2024</volume>:<fpage>3442811</fpage>. <pub-id pub-id-type="doi">10.1109/TPAMI.2024.3442811</pub-id><pub-id pub-id-type="pmid">39137077</pub-id></citation></ref>
</ref-list>
</back>
</article>