<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD Journal Publishing DTD v2.3 20070202//EN" "journalpublishing.dtd">
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" article-type="research-article" dtd-version="2.3" xml:lang="EN">
<front>
<journal-meta>
<journal-id journal-id-type="publisher-id">Front. Plant Sci.</journal-id>
<journal-title>Frontiers in Plant Science</journal-title>
<abbrev-journal-title abbrev-type="pubmed">Front. Plant Sci.</abbrev-journal-title>
<issn pub-type="epub">1664-462X</issn>
<publisher>
<publisher-name>Frontiers Media S.A.</publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="doi">10.3389/fpls.2022.1056711</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Plant Science</subject>
<subj-group>
<subject>Original Research</subject>
</subj-group>
</subj-group>
</article-categories>
<title-group>
<article-title>RADFNet: An infrared and visible image fusion framework based on distributed network</article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname>Feng</surname>
<given-names>Siling</given-names>
</name>
<xref ref-type="aff" rid="aff1">
<sup>1</sup>
</xref>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Wu</surname>
<given-names>Can</given-names>
</name>
<xref ref-type="aff" rid="aff1">
<sup>1</sup>
</xref>
<uri xlink:href="https://loop.frontiersin.org/people/2021660"/>
</contrib>
<contrib contrib-type="author" corresp="yes">
<name>
<surname>Lin</surname>
<given-names>Cong</given-names>
</name>
<xref ref-type="aff" rid="aff1">
<sup>1</sup>
</xref>
<xref ref-type="author-notes" rid="fn001">
<sup>*</sup>
</xref>
<uri xlink:href="https://loop.frontiersin.org/people/2030381"/>
</contrib>
<contrib contrib-type="author" corresp="yes">
<name>
<surname>Huang</surname>
<given-names>Mengxing</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="author-notes" rid="fn001">
<sup>*</sup>
</xref>
<uri xlink:href="https://loop.frontiersin.org/people/998341"/>
</contrib>
</contrib-group>
<aff id="aff1">
<sup>1</sup>
<institution>College of Information and Communication Engineering, Hainan University</institution>, <addr-line>Haikou</addr-line>, <country>China</country>
</aff>
<aff id="aff2">
<sup>2</sup>
<institution>State Key Laboratory of Marine Resource Utilization in South China Sea, Hainan University</institution>, <addr-line>Haikou</addr-line>, <country>China</country>
</aff>
<author-notes>
<fn fn-type="edited-by">
<p>Edited by: Mehedi Masud, Taif University, Saudi Arabia</p>
</fn>
<fn fn-type="edited-by">
<p>Reviewed by: Ahmad Hasnain, Nanjing Normal University, China; Marcin Wozniak, Silesian University of Technology, Poland; Chuan Yue, Guangdong Ocean University, China; Haoen Huang, Huazhong University of Science and Technology, China</p>
</fn>
<fn fn-type="corresp" id="fn001">
<p>*Correspondence: Cong Lin, <email xlink:href="mailto:lincong@hainanu.edu.cn">lincong@hainanu.edu.cn</email>; Mengxing Huang, <email xlink:href="mailto:huangmx09@163.com">huangmx09@163.com</email>
</p>
</fn>
<fn fn-type="other" id="fn002">
<p>This article was submitted to Technical Advances in Plant Science, a section of the journal Frontiers in Plant Science</p>
</fn>
</author-notes>
<pub-date pub-type="epub">
<day>24</day>
<month>01</month>
<year>2023</year>
</pub-date>
<pub-date pub-type="collection">
<year>2022</year>
</pub-date>
<volume>13</volume>
<elocation-id>1056711</elocation-id>
<history>
<date date-type="received">
<day>29</day>
<month>09</month>
<year>2022</year>
</date>
<date date-type="accepted">
<day>28</day>
<month>12</month>
<year>2022</year>
</date>
</history>
<permissions>
<copyright-statement>Copyright &#xa9; 2023 Feng, Wu, Lin and Huang</copyright-statement>
<copyright-year>2023</copyright-year>
<copyright-holder>Feng, Wu, Lin and Huang</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>
<sec>
<title>Introduction</title>
<p>The fusion of infrared and visible images can improve image quality and eliminate the impact of changes in the agricultural working environment on the information perception of intelligent agricultural systems.</p>
</sec>
<sec>
<title>Methods</title>
<p>In this paper, a distributed fusion architecture for infrared and visible image fusion is proposed, termed RADFNet, based on residual CNN (RDCNN), edge attention, and multiscale channel attention. The RDCNN-based network realizes image fusion through three channels. It employs a distributed fusion framework to make the most of the fusion output of the previous step. Two channels utilize residual modules with multiscale channel attention to extract the features from infrared and visible images, which are used for fusion in the other channel. Afterward, the extracted features and the fusion results from the previous step are fed to the fusion channel, which can reduce the loss in the target information from the infrared image and the texture information from the visible image. To improve the feature learning effect of the module and information quality in the fused image, we design two loss functions, namely, pixel strength with texture loss and structure similarity with texture loss.</p>
</sec>
<sec>
<title>Results and discussion</title>
<p>Extensive experimental results on public datasets demonstrate that our model has superior performance in improving the fusion quality and has achieved comparable results over the state-of-the-art image fusion algorithms in terms of visual effect and quantitative metrics.</p>
</sec>
</abstract>
<kwd-group>
<kwd>distributed fusion</kwd>
<kwd>multiscale channel attention</kwd>
<kwd>edge attention</kwd>
<kwd>image enhancement</kwd>
<kwd>intelligent agriculture</kwd>
</kwd-group>
<counts>
<fig-count count="12"/>
<table-count count="2"/>
<equation-count count="19"/>
<ref-count count="63"/>
<page-count count="15"/>
<word-count count="7891"/>
</counts>
</article-meta>
</front>
<body>
<sec id="s1" sec-type="intro">
<title>1 Introduction</title>
<p>Infrared images and visible images are important sensing information for intelligent agricultural systems. The key to intelligent agricultural systems is to utilize perceptual data for intelligent analysis and decision-making. The infrared imaging technology with anti-interference solid ability uses the radiation energy released by the target so it can penetrate smoke, fog, rain, snow, etc., in the environment. However, the visible light sensor uses light reflectivity to image with much spectral information and high-resolution characteristics. As the application range in intelligent agricultural equipment gradually broadens and the perceived information environment is usually changeable, a single image imaging technology cannot sufficiently perceive the environmental information. It results in the inability of intelligent agricultural equipment to perceive enough information, which leads to the failure of intelligent agricultural systems to work regularly. Therefore, it is of great significance to study the complementary use of infrared and visible image imaging technology to enhance the information perception ability of intelligent agricultural equipment (<xref ref-type="bibr" rid="B1">Aamir et&#xa0;al., 2021</xref>).</p>
<p>High-quality enhanced images can be obtained by fusing infrared and visible images to improve the information perception ability in intelligent agricultural equipment and meet various subsequent visual tasks for intelligent agricultural systems. As a branch of information fusion, image fusion has played an essential role in computer vision since it can generate more informative images for high-level vision tasks such as recognition (<xref ref-type="bibr" rid="B2">Basak et&#xa0;al., 2022</xref>), detection (<xref ref-type="bibr" rid="B51">Wieczorek et&#xa0;al., 2022</xref>), tracking (<xref ref-type="bibr" rid="B8">Bhatti et&#xa0;al., 2022d</xref>; <xref ref-type="bibr" rid="B56">Yan and Wo&#x17a;niak, 2022</xref>), and surveillance (<xref ref-type="bibr" rid="B11">Chen et&#xa0;al., 2021</xref>; <xref ref-type="bibr" rid="B12">Chen et&#xa0;al., 2022b</xref>). Significantly, infrared and visible image fusion is a considerable problem and has striking advantages. It is a task that aims to integrate salient features extracted from source images into a single image by appropriate methods (<xref ref-type="bibr" rid="B26">Li et&#xa0;al., 2017</xref>). Generally, visible images contain texture information with high spatial resolution and often lose effectiveness under dark or extreme environmental conditions. On the contrary, infrared images can highlight thermal targets in low light or severe weather and contain little texture information because of their low spatial resolution. Infrared and visible image fusion can integrate the complementary virtues from infrared and visible images into synthetic images, which not only conform to human visual perception but also adapt to the application in various vision systems (<xref ref-type="bibr" rid="B5">Bhatti et&#xa0;al., 2022a</xref>; <xref ref-type="bibr" rid="B6">Bhatti et&#xa0;al., 2022b</xref>).</p>
<p>According to the abstract degree in image information, image fusion is divided into three levels: pixel level, feature level, and decision level (<xref ref-type="bibr" rid="B31">Ma et&#xa0;al., 2019a</xref>). In this work, we mainly study pixel-level image fusion methods because they can retain the information from the source image to the maximum extent. In the past decades, scholars have proposed numerous infrared and visible image fusion techniques. These approaches can be broadly classified into two categories: traditional and deep learning-based methods (<xref ref-type="bibr" rid="B31">Ma et&#xa0;al., 2019a</xref>). Most traditional infrared and visible image fusion algorithms belonging to pixel-level fusion directly perform mathematical operations on the image pairs after image registration, which have achieved good performance. However, infrared and visible image fusion methods based on deep learning have emerged with tremendous potential and even better performance in recent years.</p>
<p>The traditional methods, in general, cover five approaches: multi-scale transform methods (MST) (<xref ref-type="bibr" rid="B63">Zhu et&#xa0;al., 2018</xref>), sparse representation methods (SR) (<xref ref-type="bibr" rid="B13">Cui et&#xa0;al., 2015</xref>; <xref ref-type="bibr" rid="B57">Zhang et&#xa0;al., 2018</xref>), saliency methods, subspace methods, and other methods (<xref ref-type="bibr" rid="B18">Gangapure et&#xa0;al., 2018</xref>). In general, MST-based methods first decompose the source images into multiple scales, and then the multi-scale features are fused using the appropriate fusion rule. Finally, an inverse operation is performed to reconstruct the fused image. The MST based methods usually adopt Laplacian pyramid transform (LP) (<xref ref-type="bibr" rid="B9">Bulanon et&#xa0;al., 2009</xref>), wavelet transform (Wavelet) (<xref ref-type="bibr" rid="B30">Mallat, 1989</xref>), nonsubsampled contourlet transform (NSCT) (<xref ref-type="bibr" rid="B14">Da Cunha et&#xa0;al., 2006</xref>), edge-preserving filter (EPF) (<xref ref-type="bibr" rid="B17">Farbman et&#xa0;al., 2008</xref>), curvelet transform (CVT) (<xref ref-type="bibr" rid="B40">Nencini et&#xa0;al., 2007</xref>), and multi-resolution singular value decomposition (MSVD) (<xref ref-type="bibr" rid="B38">Naidu, 2011</xref>). Sparse representation methods (SR) generally comprise four steps (<xref ref-type="bibr" rid="B31">Ma et&#xa0;al., 2019a</xref>): First, a sliding window strategy is adopted to decompose the source image into several overlapping patches. Then a learned over-complete dictionary is used for sparse coding on each patch to obtain the sparse representation coefficients. Thirdly, a reasonable fusion strategy is designed to fuse sparse representation coefficients. Finally, the learned over-complete dictionary produces a marked effect in reconstructing the fused image using the fused coefficients. Among them, the construction of the over-complete dictionary is key in SR (<xref ref-type="bibr" rid="B31">Ma et&#xa0;al., 2019a</xref>). The saliency-based methods can highlight regional activity and significance (<xref ref-type="bibr" rid="B35">Meng et&#xa0;al., 2017</xref>; <xref ref-type="bibr" rid="B60">Zhang et&#xa0;al., 2017</xref>). The subspace-based methods, including the principal component analysis (<xref ref-type="bibr" rid="B3">Bavirisetti et&#xa0;al., 2017</xref>), independent component analysis (<xref ref-type="bibr" rid="B36">Mitianoudis et&#xa0;al., 2013</xref>), and non-negative matrix factorization (<xref ref-type="bibr" rid="B24">Kong et&#xa0;al., 2014</xref>) can remove the redundant information existing in most natural images by converting high dimensional input images into low dimensional spaces or subspaces. Although the existing traditional fusion methods have indicated great performance, these methods require the highly manual design in decomposition and fusion strategies. Their application is subject to unpredictable constraints in some tasks, and their performance deteriorates when the source images are complex due to the degradation of representation (<xref ref-type="bibr" rid="B10">Chen et&#xa0;al., 2022a</xref>).</p>
<p>In the past several years, deep learning has been widely applied in infrared and visible image fusion to solve the shortcomings in traditional fusion methods. The application of deep learning-based methods for infrared and visible image fusion mainly reflects in convolutional neural network CNN-based network frameworks, such as convolutional sparse representation (CSR) and generative adversarial network (GAN). The CNN-based fusion frameworks for infrared and visible image fusion are divided into two categories: the depth extraction for image features and the construction for fusion networks. In depth feature extraction, VGG-19 (<xref ref-type="bibr" rid="B43">Ren et&#xa0;al., 2018</xref>), ResNet18, ResNet34, ResNet50, ResNet101, and ResNet152 (<xref ref-type="bibr" rid="B46">Szegedy et&#xa0;al., 2017</xref>) have been proposed, among which VGG-19 and ResNet152 are commonly applied. The depth of ResNet152 is deeper than that of VGG-19, and deepening network depth improves the depth features in the image. Nevertheless, the more convolution layer parameter maps cause the problems in increasing the number of parameters, the amount of calculation, and the high requirement for computing hardware. The CSR-based methods generally combine PCNN, wavelet transform, and NSCT to construct a fusion network structure, which has been widely used in infrared and visible image fusion. They can effectively represent the salient features in the source images. However, the local modeling approach adopted by image fusion methods based on sparse representation is prone to lead to two major defects: loss of contextualized information and low tolerance of fault matching. The GAN-based fusion algorithms adopt the CNN network structure as the framework with strong feature extraction ability, significantly improve the fusion quality, and use the confrontation between the source image and the generated image to realize the supervision in the source image on the learning parameters. Ma et&#xa0;al. introduced the GAN in the infrared and visible image fusion task for the first time, namely FusionGAN (<xref ref-type="bibr" rid="B33">Ma et&#xa0;al., 2019b</xref>), and then more GAN-based fusion frameworks are proposed (<xref ref-type="bibr" rid="B32">Ma et&#xa0;al., 2020</xref>; <xref ref-type="bibr" rid="B25">Li et&#xa0;al., 2021b</xref>; <xref ref-type="bibr" rid="B34">Ma et&#xa0;al., 2021</xref>). Nevertheless, they are limited by the size of the convolution kernel and the depth of the network, ignoring the correlation between the feature map channels.</p>
<p>Although a variety of networks to improve the performance in image fusion have been proposed by many scholars. The CNN-based network frameworks, such as convolutional sparse representation (CSR), generative adversarial network (GAN), and other many network architectures are applied in infrared and visible image fusion. However, the CNN-based fusion frameworks for infrared and visible image fusion are divided into two categories: the depth extraction for image features and the construction of fusion networks. The extraction for depth features requires a deeper network structure, resulting in weak interpretability, extensive computation, and other problems. The construction of the fusion network is also complex and difficult to control. Although many modelsare superficially similar to RADFNet, they have not abandoned these two categories. To get rid of the dilemma in these two kinds of fusion categories, the RADFNet employs a distributed fusion framework to make the most of the fusion output from the previous step. Two channels utilize residual modules with multiscale channel attention to extract the features from infrared and visible images, which are used for fusion in the other channel. Because it adopts distributed fusion, the fusion network does not entirely rely on the extraction in deep features, and the fusion network is simple to construct, showing strong robustness. The RADFNet solves the limitations from most current fusion networks and shows strong adaptability. The main contributions of our work are summarized as follows:</p>
<list list-type="simple">
<list-item>
<p>(A) A distributed fusion framework based on residual CNN (RDCNN) for infrared and visible image fusion is proposed in this paper. The distributed fusion framework is distinct from the existing fusion framework in infrared and visible image fusion. It adopts three channels to realize image fusion, wherein two channels are applied to feature extraction and the other channel realizes feature fusion.</p>
</list-item>
<list-item>
<p>(B) To obtain coarse-to-fine features and compensate edge information for fused images, the attention mechanism is discussed. In this way, the fused images retain more prominent information and lose less edge information from source images.</p>
</list-item>
<list-item>
<p>(C) Two loss functions, including the pixel intensity with texture loss and the structural similarity (SSIM) with texture loss, are designed to train the RADFNet. Through experiments, it is found that networks trained by the two loss functions have their own advantages.</p>
</list-item>
<list-item>
<p>(D) Extensive experiments are conducted on public infrared and visible image fusion datasets. Compared with existing state-of-the-art fusion methods, our fusion framework has a promising even better performance in accordance with visual effect and quantitative metrics. In addition, we perform ablation experiments to verify the function in the corresponding module. Last but not least, unregistered source image pairs are fed into the proposed network, emerging the robustness of the proposed framework.</p>
</list-item>
</list>
</sec>
<sec id="s2" sec-type="materials|methods">
<title>2 Materials and methods</title>
<sec id="s2_1">
<title>2.1 Related works</title>
<sec id="s2_1_1">
<title>2.1.1 Distributed fusion architecture</title>
<p>Distributed fusion architecture is a classical and typical structure in multi-sensor fusion due to its high speed and reliability (<xref ref-type="bibr" rid="B45">Sun et&#xa0;al., 2017</xref>). In distributed fusion, the measurement results of each sensor are processed to obtain local estimates and error covariance. Then the processing results are sent to the fusion node to conflate them into global state estimation and the estimated error covariance (<xref ref-type="bibr" rid="B52">Wu et al., 2021</xref>). <xref ref-type="fig" rid="f1">
<bold>Figure&#xa0;1</bold>
</xref> shows a distributed model for the fusion in radar and infrared sensors (<xref ref-type="bibr" rid="B55">Yang et&#xa0;al., 2016</xref>). For single target tracking, radar and infrared sensors track the target respectively and generate dependent target trajectories in their local information processing center, then send the local trajectory information to the fusion center for data fusion.</p>
<fig id="f1" position="float">
<label>Figure&#xa0;1</label>
<caption>
<p>A distributed fusion model for radar and infrared sensors.</p>
</caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fpls-13-1056711-g001.tif"/>
</fig>
</sec>
<sec id="s2_1_2">
<title>2.1.2 Residual network</title>
<p>In some tasks, deeper neural networks can extract higher-level features and perform excellently. However, too deep networks may cause the notorious problem of vanishing or exploding gradients and degrade the accuracy. To solve these problems, He et&#xa0;al. proposed a residual network composed of a series of residual blocks (<xref ref-type="bibr" rid="B20">He et&#xa0;al., 2016a</xref>). <xref ref-type="fig" rid="f2">
<bold>Figure&#xa0;2A</bold>
</xref> shows the original residual module, which can be expressed as (<xref ref-type="bibr" rid="B21">He et&#xa0;al., 2016b</xref>).</p>
<fig id="f2" position="float">
<label>Figure&#xa0;2</label>
<caption>
<p>Three different residual units: <bold>(A)</bold> Original residual unit; <bold>(B)</bold> Conv residual unit; <bold>(C)</bold> Improved residual unit.</p>
</caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fpls-13-1056711-g002.tif"/>
</fig>
<disp-formula>
<label>(1)</label>
<mml:math display="block" id="M1">
<mml:mrow>
<mml:mtable>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:msub>
<mml:mi>y</mml:mi>
<mml:mi>l</mml:mi>
</mml:msub>
<mml:mo>=</mml:mo>
<mml:mi>h</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mi>l</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>+</mml:mo>
<mml:mi>&#x2131;</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mi>l</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>W</mml:mi>
<mml:mi>l</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mrow>
<mml:mi>l</mml:mi>
<mml:mo>+</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>=</mml:mo>
<mml:mi>f</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>y</mml:mi>
<mml:mi>l</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:mtd>
</mml:mtr>
</mml:mtable>
</mml:mrow>
</mml:math>
</disp-formula>
<p>where <italic>x<sub>l</sub>
</italic> and <italic>x<sub>l+1</sub>
</italic> are the input and output in the <italic>l</italic>-th layer, and &#x2131; is the residual function. <italic>f</italic> is a ReLU (<xref ref-type="bibr" rid="B39">Nair and Hinton, 2010</xref>) function. The residual block contains two parts: identity mapping and residual mapping. The left part of <xref ref-type="fig" rid="f2">
<bold>Figure&#xa0;2A</bold>
</xref> is the identity mapping, and the right part of <xref ref-type="fig" rid="f2">
<bold>Figure&#xa0;2A</bold>
</xref> is the residual part expressed as &#x2131;(<italic>x<sub>l</sub>
</italic>, <italic>W<sub>l</sub>
</italic>), which usually contains 2 or 3 convolutional layers. In many cases, the dimensions of input <italic>x<sub>l</sub>
</italic> and output <italic>x<sub>l+1</sub>
</italic> are discrepant, so it is necessary to employ a 1&#xd7;1 convolution operation to maintain the dimension in input and output consistent, whose schematic diagram is shown in <xref ref-type="fig" rid="f2">
<bold>Figure&#xa0;2B</bold>
</xref>, which can be expressed as (<xref ref-type="bibr" rid="B21">He et&#xa0;al., 2016b</xref>).</p>
<disp-formula>
<label>(2)</label>
<mml:math display="block" id="M2">
<mml:mrow>
<mml:mtable>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mrow>
<mml:mi>l</mml:mi>
<mml:mo>+</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>=</mml:mo>
<mml:mi>h</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mi>l</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>+</mml:mo>
<mml:mi>&#x2131;</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mi>l</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>W</mml:mi>
<mml:mi>l</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mi>h</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mi>l</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>=</mml:mo>
<mml:msubsup>
<mml:mi>W</mml:mi>
<mml:mi>l</mml:mi>
<mml:mo>'</mml:mo>
</mml:msubsup>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mi>l</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mtd>
</mml:mtr>
</mml:mtable>
</mml:mrow>
</mml:math>
</disp-formula>
<p>where h(<italic>x<sub>l</sub>
</italic>) is the identity skip connection and <inline-formula>
<mml:math display="inline" id="im1">
<mml:mrow>
<mml:msubsup>
<mml:mi>W</mml:mi>
<mml:mi>l</mml:mi>
<mml:mo>'</mml:mo>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> is the 1&#xd7;1 convolution kernel.</p>
<p>The residual network can be formulated as (<xref ref-type="bibr" rid="B21">He et&#xa0;al., 2016b</xref>)</p>
<disp-formula>
<label>(3)</label>
<mml:math display="block" id="M3">
<mml:mrow>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mi>L</mml:mi>
</mml:msub>
<mml:mo>=</mml:mo>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mi>l</mml:mi>
</mml:msub>
<mml:mo>+</mml:mo>
<mml:mstyle displaystyle="true">
<mml:munderover>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>=</mml:mo>
<mml:mi>l</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>L</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:munderover>
<mml:mrow>
<mml:mi>&#x2131;</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>W</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:mstyle>
</mml:mrow>
</mml:math>
</disp-formula>
<p>for any deeper block <italic>L</italic> and any shallower block <italic>l</italic>. The formula 3 indicates the feature <italic>x<sub>L</sub>
</italic> in any deeper residual block <italic>L</italic> which can be represented as the feature <italic>x<sub>l</sub>
</italic> in any shallower block <italic>l</italic> add the residual function, which leads to nice backward propagation properties that the gradient of layers will not vanish even when the weights are arbitrarily small (<xref ref-type="bibr" rid="B21">He et&#xa0;al., 2016b</xref>). Moreover, experiments with the various usages of activation function were carried out in (<xref ref-type="bibr" rid="B21">He et&#xa0;al., 2016b</xref>). The order of the activation function in the network will affect the performance of the residual network. The structure of the improved residual unit shown in <xref ref-type="fig" rid="f2">
<bold>Figure&#xa0;2C</bold>
</xref> has the best performance. In this structure, the batch normalization (BN) and ReLU activation function are placed before the convolution layer, and the activation function after addition is moved to the residual part.</p>
</sec>
<sec id="s2_1_3">
<title>2.1.3 Attention mechanism in deep learning</title>
<p>Attention mechanism can be traced to the last century, which was mostly applied to machine translation tasks. It has become an essential concept in artificial intelligence because it conforms to some laws of human cognition and can improve the interpretability of neural networks. Therefore, the attention mechanism is widely applied, such as natural language processing, speech recognition and computer vision (<xref ref-type="bibr" rid="B37">Mnih et&#xa0;al., 2014</xref>; <xref ref-type="bibr" rid="B48">Vaswani et&#xa0;al., 2017</xref>; <xref ref-type="bibr" rid="B7">Bhatti et&#xa0;al., 2022c</xref>). In the computer vision domain, many researchers have studied attention mechanism and proposed corresponding methods to acquire nice performance. A residual attention network built by stacking attention modules is proposed in (<xref ref-type="bibr" rid="B50">Wang et&#xa0;al., 2017</xref>) which are designed to generate attention-aware features, achieving outstanding recognition performance. A novel architecture unit termed the <bold>&#x201c;</bold>Squeeze-and-Excitatio<bold>&#x201d;</bold>(SE) block that adaptively recalibrates the channel feature strength by explicitly modelling the interdependence between channels is introduced in (<xref ref-type="bibr" rid="B22">Hu et&#xa0;al., 2020</xref>). The structure of SE block is shown in <xref ref-type="fig" rid="f3">
<bold>Figure&#xa0;3</bold>
</xref>, where U is a feature map with the size of W&#xd7;H&#xd7;C, &#x2a02; and refers to channel-wise multiplication, so X and U have the same size. Moreover, edge-guided attention mechanisms which can produce visually appealing images also attract the attention of many researchers (<xref ref-type="bibr" rid="B4">Bhatti et&#xa0;al., 2021</xref>). Zhao et&#xa0;al. (<xref ref-type="bibr" rid="B61">Zhao et&#xa0;al., 2019a</xref>) propose an edge guidance network (EGNet) which solves the problems of rough boundary in object detection through the complementarity of the object and salient edge information.</p>
<fig id="f3" position="float">
<label>Figure&#xa0;3</label>
<caption>
<p>A Squeeze-and-Excitation block, where GP means global average pooling, FC refers to fully-connected layers, ReLU refers to the ReLU function, and Sigmoid refers to the sigmoid function.</p>
</caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fpls-13-1056711-g003.tif"/>
</fig>
</sec>
</sec>
<sec id="s2_2">
<title>2.2 Methods</title>
<sec id="s2_2_1">
<title>2.2.1 Overall framework</title>
<p>Enlighted by the advantages of distributed structure and the residual module, we propose a novel distributed fusion architecture for infrared and visible images based on the residual module and attention of edge and multiscale channel, RADFNet. The RADFNet is an end-to-end fusion network, the overall structure of which is shown in <xref ref-type="fig" rid="f4">
<bold>Figure&#xa0;4</bold>
</xref>. It contains four parts: the feature extraction for the visible image, the feature extraction for the infrared image, the fusion for features, and the compensation for edge information. The infrared and visible image fusion process is formulated as follows.</p>
<fig id="f4" position="float">
<label>Figure&#xa0;4</label>
<caption>
<p>The overall structure for infrared and visible image fusion.</p>
</caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fpls-13-1056711-g004.tif"/>
</fig>
<p>The visible image features extraction branch can be formulated as</p>
<disp-formula>
<label>(4)</label>
<mml:math display="block" id="M4">
<mml:mrow>
<mml:msub>
<mml:mi>V</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>=</mml:mo>
<mml:mi>A</mml:mi>
<mml:mi>T</mml:mi>
<mml:msub>
<mml:mi>T</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mi>V</mml:mi>
<mml:msub>
<mml:mi>R</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>V</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>&#x24dc;</mml:mo>
<mml:msub>
<mml:mi>E</mml:mi>
<mml:mrow>
<mml:msub>
<mml:mi>V</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:msub>
<mml:mtext>&#x2003;</mml:mtext>
<mml:mi>i</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>,</mml:mo>
<mml:mn>2</mml:mn>
<mml:mo>,</mml:mo>
<mml:mn>3</mml:mn>
<mml:mo>,</mml:mo>
<mml:mn>4</mml:mn>
</mml:mrow>
</mml:math>
</disp-formula>
<disp-formula>
<label>(5)</label>
<mml:math display="block" id="M5">
<mml:mrow>
<mml:msub>
<mml:mi>E</mml:mi>
<mml:mrow>
<mml:msub>
<mml:mi>V</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:msub>
<mml:mo>=</mml:mo>
<mml:mi>E</mml:mi>
<mml:mi>A</mml:mi>
<mml:msub>
<mml:mi>T</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>E</mml:mi>
<mml:mrow>
<mml:msub>
<mml:mi>V</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:msub>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mtext>&#x2003;</mml:mtext>
<mml:mi>i</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>,</mml:mo>
<mml:mn>2</mml:mn>
<mml:mo>,</mml:mo>
<mml:mn>3</mml:mn>
<mml:mo>,</mml:mo>
<mml:mn>4</mml:mn>
</mml:mrow>
</mml:math>
</disp-formula>
<p>where <italic>V</italic>
<sub>0</sub>, the visible image input in the architecture, is the V in the <xref ref-type="fig" rid="f4">
<bold>Figure&#xa0;4</bold>
</xref>. <italic>V<sub>i</sub>
</italic> is the representation of <italic>V</italic>
<sub>0</sub> after the residual module, multiscale channel attention and compensation of edge information. <italic>VR<sub>i</sub>
</italic> means the residual module acting on the <italic>V<sub>i</sub>
</italic>
<sub>-1</sub> and <italic>ATT<sub>i</sub>
</italic> is the multiscale channel attention module designed to obtain coarse-to-fine features from the outcome of <italic>VR<sub>i</sub>
</italic>
<sub>-1</sub>. Vi represents the features in different levels of V<sub>0</sub> with different scales, wherein V<sub>i</sub> has a higher level than <italic>V<sub>i-</sub>
</italic>
<sub>1</sub>
<italic>. E<sub>Vi</sub>
</italic> is the edge information feature map obtained by <italic>EAT<sub>i</sub>
</italic> with input <italic>E</italic>
<sub>
<italic>V</italic>
<sub>
<italic>i</italic>&#x2212;1</sub>
</sub> configured to compensate for the edge information of the feature map achieved by residual module and multiscale channel attention module. &#x24dc; refers to the maximum value in the homologous channel and position in the feature map. The features in the visible image with separate scales are extracted through the above steps. Then, they are fed into the fusion channel to fuse at each layer, which can fully utilize the multi-scale information from perceptible images. In this method, more texture information with high spatial resolution retains, which can enhance the quality of the fused image.</p>
<p>The infrared image feature extraction branch can be formulated as</p>
<disp-formula>
<label>(6)</label>
<mml:math display="block" id="M6">
<mml:mrow>
<mml:msub>
<mml:mi>I</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>=</mml:mo>
<mml:mi>A</mml:mi>
<mml:mi>T</mml:mi>
<mml:msub>
<mml:mi>T</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:munder>
<mml:mrow>
<mml:mtext>IR</mml:mtext>
</mml:mrow>
<mml:mi>i</mml:mi>
</mml:munder>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>I</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>&#x24dc;</mml:mo>
<mml:mtext>&#xa0;</mml:mtext>
<mml:msub>
<mml:mi>E</mml:mi>
<mml:mrow>
<mml:msub>
<mml:mi>I</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:msub>
<mml:mtext>&#x2003;</mml:mtext>
<mml:mi>i</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>,</mml:mo>
<mml:mn>2</mml:mn>
<mml:mo>,</mml:mo>
<mml:mn>3</mml:mn>
<mml:mo>,</mml:mo>
<mml:mn>4</mml:mn>
</mml:mrow>
</mml:math>
</disp-formula>
<disp-formula>
<label>(7)</label>
<mml:math display="block" id="M7">
<mml:mrow>
<mml:msub>
<mml:mi>E</mml:mi>
<mml:mrow>
<mml:msub>
<mml:mi>I</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:msub>
<mml:mo>=</mml:mo>
<mml:mi>E</mml:mi>
<mml:mi>A</mml:mi>
<mml:msub>
<mml:mi>T</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>E</mml:mi>
<mml:mrow>
<mml:msub>
<mml:mi>I</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:msub>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mtext>&#x2003;</mml:mtext>
<mml:mi>i</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>,</mml:mo>
<mml:mn>2</mml:mn>
<mml:mo>,</mml:mo>
<mml:mn>3</mml:mn>
<mml:mo>,</mml:mo>
<mml:mn>4</mml:mn>
</mml:mrow>
</mml:math>
</disp-formula>
<p>where <italic>I</italic>
<sub>0</sub>, the infrared image input in the architecture, is the I in <xref ref-type="fig" rid="f4">
<bold>Figure&#xa0;4</bold>
</xref>. <italic>I<sub>i</sub>
</italic> is the representation of <italic>I</italic>
<sub>0</sub> after the residual module, multiscale channel attention and compensation of edge information. <italic>IR<sub>i</sub>
</italic> means the residual module acting on the <italic>I<sub>i-1</sub>
</italic> and <italic>ATT<sub>i</sub>
</italic> is the multiscale channel attention module designed to obtain coarse-to-fine features from the outcome of <italic>IR<sub>i</sub>
</italic>
<sub>-1</sub>
<italic>. I<sub>i</sub>
</italic> represents the features in different levels of <italic>I</italic>
<sub>0</sub> with different scales, wherein <italic>I</italic>
<sub>i</sub> has ahigher level than <italic>I<sub>i</sub>
</italic>
<sub>-1</sub>. <italic>E</italic>
<sub>
<italic>I</italic>
<sub>
<italic>i</italic>
</sub>
</sub> is the edge information feature map obtained by <italic>EAT<sub>i</sub>
</italic> with input <italic>E</italic>
<sub>
<italic>I</italic>
<sub>
<italic>i</italic>&#x2212;1</sub>
</sub> configured to compensate for the edge information of the feature map achieved by residual module and multiscale channel attention module. &#x24dc; refers to the maximum value in the homologous channel and position in the feature map. The features in the infrared image with distinct scales are extracted through the above steps. Then they are constituted into the fusion channel to fuse at each layer, which can fully utilize the multi-scale information from infrared images. As a result, rich target information is used for highlighting the target in the fused image.</p>
<p>The channel of feature fusion can be defined as</p>
<disp-formula>
<label>(8)</label>
<mml:math display="block" id="M8">
<mml:mrow>
<mml:mi>F</mml:mi>
<mml:mi>U</mml:mi>
<mml:msub>
<mml:mi>I</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>=</mml:mo>
<mml:mrow>
<mml:mo>{</mml:mo>
<mml:mrow>
<mml:mtable>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:msub>
<mml:mi>F</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>V</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>I</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:mtd>
<mml:mtd>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>0</mml:mn>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:msub>
<mml:mi>F</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>V</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>I</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mi>F</mml:mi>
<mml:mi>U</mml:mi>
<mml:msub>
<mml:mi>I</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:mtd>
<mml:mtd>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>,</mml:mo>
<mml:mn>2</mml:mn>
<mml:mo>,</mml:mo>
<mml:mn>3</mml:mn>
<mml:mo>,</mml:mo>
<mml:mn>4</mml:mn>
</mml:mrow>
</mml:mtd>
</mml:mtr>
</mml:mtable>
</mml:mrow>
</mml:mrow>
</mml:mrow>
</mml:math>
</disp-formula>
<p>where <italic>V</italic>
<sub>0</sub> and <italic>I</italic>
<sub>0</sub>, which are visible image and infrared image inputs in the fusion architecture, are the V and I in <xref ref-type="fig" rid="f4">
<bold>Figure&#xa0;4</bold>
</xref> respectively. <italic>FUI</italic>
<sub>1</sub>
<italic>, FUI</italic>
<sub>2</sub>
<italic>, FUI</italic>
<sub>3</sub>, and <italic>FUI</italic>
<sub>4</sub> are the fusion results with different level features using corresponding rules. <italic>F<sub>i</sub>
</italic> refers to the fusion rule of the relevant layer features. <italic>FUI<sub>i</sub>
</italic> is the fusion result of the i-th extracted features <italic>V<sub>i</sub>
</italic>, <italic>I</italic>
<sub>i</sub> and the different scales from previous fusion result <italic>FUI<sub>i</sub>
</italic>
<sub>-1</sub>. It realizes the layer-by-layer fusion so it can make the best use of the information from multisource images and then improve the quality of the fused image.</p>
</sec>
<sec id="s2_2_2">
<title>2.2.2 Network structure</title>
<p>The infrared and visible image fusion model RADFNet set out in the present paper is constituted of three channels. The RADFNet structure is exhibited in <xref ref-type="fig" rid="f5">
<bold>Figure&#xa0;5</bold>
</xref>. RADFNet contains four parts: the features extraction branch of the visible image and infrared image, the features fusion branch, and the edge attention module compensating edge information for the extracted features. The left and right branches in <xref ref-type="fig" rid="f5">
<bold>Figure&#xa0;5</bold>
</xref> are intended to extract the features in visible and infrared images respectively. The middle branch fuses the features extracted by the two branches with the results from the previous step layer by layer, and the last layer generates the fused image. For a convolutional layer, <italic>&#x2018;k&#xd7;k,(in,out)&#x2019;</italic> means the kernel size is <italic>k&#xd7;k</italic>, the input channel is <italic>in</italic> and the output channel is <italic>out</italic>. In the network, BN indicates batch normalization that is utilized to speed up the training and make the training more stable, and ReLU denotes the linear rectification function.</p>
<fig id="f5" position="float">
<label>Figure&#xa0;5</label>
<caption>
<p>The structure of RADFNet. &#x2018;ATT<sub>1&#x2212;4</sub>&#x2019; denote the multiscale channel attention module and &#x2018;EAT<sub>1&#x2212;4</sub>&#x2019; denote the edge attention module. &#x2018;3 &#xd7; 3,(1, 32)&#x2019; means the kernel size is 3 &#xd7; 3, input channel is 1 and output channel is 32 in a convolutional layer.</p>
</caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fpls-13-1056711-g005.tif"/>
</fig>
<p>The RADFNet adopts four-layers network structure. The VR<sub>1&#x2212;4</sub> and IR<sub>1&#x2212;4</sub> are the residual networks which extract image features. Because the residual network has the advantages of mitigating gradient disappearance or gradient explosion and protecting the information integrity, the networks we designed can extract meaningful features and ensure the information integrity simultaneously. Besides, ATT<italic>i</italic> processes the features extracted by residual block VR<italic>i</italic> or IR<italic>i</italic> to obtain coarse-to-fine features. EAT<italic>i</italic> acquires the edge information and then compensates edge information for the extracted feature map. The &#x24dc; refers to the operation for achieving the maximum value in the homologous channel and the homologous position in the feature map. The FUP<italic>i</italic> generates FUI<italic>i</italic> by fusing features extracted by the other two branches with the FUI<sub>i&#x2212;1</sub> generated by FUP<sub>i&#x2212;1</sub> when <italic>i</italic> is not 1. When <italic>i</italic> is 1, the concatenated infrared and visible image is fed into the FUP1 to generate FUI<sub>1</sub>. The &#x2295; is the concatenation operation in channel-wise, and the 1&#xd7;1 244 convolution layer in the last fusion layer constructs fusion images.</p>
</sec>
<sec id="s2_2_3">
<title>2.2.3 Multiscale channel attention network</title>
<p>In the process of infrared and visible image fusion, image feature extraction is exceptionally significant. However, in practical situations, numerous detailed information loses in the process of feature extraction. Inspired by SENet (<xref ref-type="bibr" rid="B22">Hu et&#xa0;al., 2020</xref>), the multiscale channel attention network is proposed to process the features extracted by the residual network to obtain the coarse-to-fine features, which can retain more detailed information in the feature map. As shown in <xref ref-type="fig" rid="f6">
<bold>Figure&#xa0;6</bold>
</xref>, the structure enclosed by the dotted line is the multiscale channel attention module. The features which lose a lot of details extracted by VR<italic>i</italic> or IR<italic>i</italic> are used as input in ATT<italic>i</italic>. Then, the 1&#xd7;1, 2&#xd7;2, and 4&#xd7;4 average pooling operations are performed to generate multiscale features which contain more necessary spatial information. Moreover, the channel attention mechanism is utilized to enhance channel correlation information between features. The multiscale channel attention network is trained to learn the weight <inline-formula>
<mml:math display="inline" id="im2">
<mml:mrow>
<mml:msubsup>
<mml:mi>W</mml:mi>
<mml:mrow>
<mml:msub>
<mml:mi>t</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mi>k</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> for the k-th feature <inline-formula>
<mml:math display="inline" id="im3">
<mml:mrow>
<mml:msubsup>
<mml:mi>f</mml:mi>
<mml:mrow>
<mml:msub>
<mml:mi>t</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mi>k</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> of the t-th pooling scale in the ATT<italic>i</italic> which can be formulated as</p>
<fig id="f6" position="float">
<label>Figure&#xa0;6</label>
<caption>
<p>The multiscale channel attention network. The features extracted by residual network(VR<italic>i</italic> or IR<italic>i</italic>) are fed into the ATT<italic>i</italic> to generate attention map. GP, FC, RL, SG denote the global average pooling operation, fully connected layer, ReLUfunction and sigmoid function respectively. &#x22b2; stands for the up-sample operation and &#x2a02; denotes the element-wise multiplication.</p>
</caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fpls-13-1056711-g006.tif"/>
</fig>
<disp-formula>
<label>(9)</label>
<mml:math display="block" id="M9">
<mml:mrow>
<mml:msubsup>
<mml:mi>W</mml:mi>
<mml:mrow>
<mml:msub>
<mml:mi>t</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mi>k</mml:mi>
</mml:msubsup>
<mml:mo>=</mml:mo>
<mml:mi>&#x3c3;</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>w</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
<mml:mi>&#x3b4;</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>w</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mi>G</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>z</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</disp-formula>
<disp-formula>
<label>(10)</label>
<mml:math display="block" id="M10">
<mml:mrow>
<mml:mi>G</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>z</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>=</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:msub>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>x</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>y</mml:mi>
</mml:mrow>
</mml:msub>
<mml:msubsup>
<mml:mi>f</mml:mi>
<mml:mrow>
<mml:msub>
<mml:mi>t</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mi>k</mml:mi>
</mml:msubsup>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mi>x</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>y</mml:mi>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mrow>
<mml:mi>H</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>W</mml:mi>
</mml:mrow>
</mml:mfrac>
</mml:mrow>
</mml:math>
</disp-formula>
<p>where <italic>G</italic>(<italic>z</italic>) denotes the global average pooling operation. <inline-formula>
<mml:math display="inline" id="im4">
<mml:mrow>
<mml:msub>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>x</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>y</mml:mi>
</mml:mrow>
</mml:msub>
<mml:msubsup>
<mml:mi>f</mml:mi>
<mml:mrow>
<mml:msub>
<mml:mi>t</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mi>k</mml:mi>
</mml:msubsup>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mi>x</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>y</mml:mi>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula> means the sum of the k-th feature with the <italic>t-</italic>th pooling scale in ATT<italic>i.</italic> (<italic>x</italic>, <italic>y</italic>) refers to the position in feature map, and H,W means the height and width of the feature map. <italic>&#x3b4;</italic> refers to the ReLU function, <italic>w</italic>
<sub>1</sub>&#x2208;<italic>&#x211d;</italic>
<sup>
<italic>k</italic>&#xd7;<italic>k</italic>
</sup> and <italic>w</italic>
<sub>2</sub>&#x2208;<italic>&#x211d;</italic>
<sup>
<italic>k</italic>&#xd7;<italic>k</italic>
</sup> , &#x3c3; denotes the sigmoid function. Then the channel-wise multiplication is implemented between <inline-formula>
<mml:math display="inline" id="im5">
<mml:mrow>
<mml:msubsup>
<mml:mi>W</mml:mi>
<mml:mrow>
<mml:msub>
<mml:mi>t</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mi>k</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> and the up-sampled features which can be expressed as <inline-formula>
<mml:math display="inline" id="im6">
<mml:mrow>
<mml:mi>U</mml:mi>
<mml:mi>P</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:msubsup>
<mml:mi>f</mml:mi>
<mml:mrow>
<mml:msub>
<mml:mi>t</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mi>k</mml:mi>
</mml:msubsup>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula> , ensuring the multiscale features have the same size as the input. Based on this, the reweighted features are obtained and then the attention map can be achieved as follows:</p>
<disp-formula>
<label>(11)</label>
<mml:math display="block" id="M11">
<mml:mrow>
<mml:msub>
<mml:mi>F</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>=</mml:mo>
<mml:mi>&#x3c0;</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:msubsup>
<mml:mi>W</mml:mi>
<mml:mrow>
<mml:msub>
<mml:mn>1</mml:mn>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mi>k</mml:mi>
</mml:msubsup>
<mml:mo>*</mml:mo>
<mml:mi>U</mml:mi>
<mml:mi>P</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:msubsup>
<mml:mi>f</mml:mi>
<mml:mrow>
<mml:msub>
<mml:mn>1</mml:mn>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mi>k</mml:mi>
</mml:msubsup>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>&#x24dc;</mml:mo>
<mml:mtext>&#xa0;</mml:mtext>
<mml:mi>&#x3c0;</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:msubsup>
<mml:mi>W</mml:mi>
<mml:mrow>
<mml:msub>
<mml:mn>2</mml:mn>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mi>k</mml:mi>
</mml:msubsup>
<mml:mo>*</mml:mo>
<mml:mi>U</mml:mi>
<mml:mi>P</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:msubsup>
<mml:mi>f</mml:mi>
<mml:mrow>
<mml:msub>
<mml:mn>2</mml:mn>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mi>k</mml:mi>
</mml:msubsup>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>&#x24dc;</mml:mo>
<mml:mtext>&#xa0;</mml:mtext>
<mml:mi>&#x3c0;</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:msubsup>
<mml:mi>W</mml:mi>
<mml:mrow>
<mml:msub>
<mml:mn>3</mml:mn>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mi>k</mml:mi>
</mml:msubsup>
<mml:mo>*</mml:mo>
<mml:mi>U</mml:mi>
<mml:mi>P</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:msubsup>
<mml:mi>f</mml:mi>
<mml:mrow>
<mml:msub>
<mml:mn>3</mml:mn>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mi>k</mml:mi>
</mml:msubsup>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</disp-formula>
<p>where <italic>&#x3c0;</italic> denotes the instance normalization (<xref ref-type="bibr" rid="B47">Ulyanov et&#xa0;al., 2016</xref>) and &#x24dc; refers to the operation for acquiring the maximum value in the homologous channel and position in the feature map. Through the above method, the coarse-to-fine attention map <italic>Fi</italic> is obtained. The attention map not only emphasizes more critical features and neglects secondary ones but also reserves more necessarily detailed information.</p>
</sec>
<sec id="s2_2_4">
<title>2.2.4 Edge attention module</title>
<p>Generally, the edge information of an image refers to the sudden change in local grayscale value, color component and texture structure. The edge information from images which is helpful to distinguish objects, can effectively attract attention of people due to human visual characteristics. Enlightened by previous work, we utilize an edge feature map extraction model from the shallower to deeper to obtain the enhanced edge maps, which are designed to compensate for textural information for the fused image.</p>
<p>For the sake of acquiring the edge information used to compensate fused images, we obtain the gradient map from the source images. The process of obtaining the gradient maps &#x2207;<italic>g</italic> by inputting a gray-scale image <italic>f</italic> with the size <italic>h</italic>
<bold>&#xd7;</bold>
<italic>w</italic> is defined as</p>
<disp-formula>
<label>(12)</label>
<mml:math display="block" id="M12">
<mml:mrow>
<mml:mo>&#x2207;</mml:mo>
<mml:mi>g</mml:mi>
<mml:mo>=</mml:mo>
<mml:mstyle displaystyle="true">
<mml:munderover>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>x</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>,</mml:mo>
<mml:mi>y</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:mi>x</mml:mi>
<mml:mo>=</mml:mo>
<mml:mi>h</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>,</mml:mo>
<mml:mi>y</mml:mi>
<mml:mo>=</mml:mo>
<mml:mi>w</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:munderover>
<mml:mrow>
<mml:msqrt>
<mml:mrow>
<mml:msup>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mo>&#x2207;</mml:mo>
<mml:msup>
<mml:mi>g</mml:mi>
<mml:mi>h</mml:mi>
</mml:msup>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mi>x</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>y</mml:mi>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mn>2</mml:mn>
</mml:msup>
<mml:mo>+</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mo>&#x2207;</mml:mo>
<mml:msup>
<mml:mi>g</mml:mi>
<mml:mi>w</mml:mi>
</mml:msup>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mi>x</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>y</mml:mi>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mn>2</mml:mn>
</mml:msup>
</mml:mrow>
</mml:msqrt>
</mml:mrow>
</mml:mstyle>
</mml:mrow>
</mml:math>
</disp-formula>
<disp-formula>
<label>(13)</label>
<mml:math display="block" id="M13">
<mml:mrow>
<mml:mtable>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mo>&#x2207;</mml:mo>
<mml:msup>
<mml:mi>g</mml:mi>
<mml:mi>h</mml:mi>
</mml:msup>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mi>x</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>y</mml:mi>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>=</mml:mo>
<mml:mi>f</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mi>x</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>y</mml:mi>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>f</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mi>x</mml:mi>
<mml:mo>+</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>,</mml:mo>
<mml:mi>y</mml:mi>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mo>&#x2207;</mml:mo>
<mml:msup>
<mml:mi>g</mml:mi>
<mml:mi>w</mml:mi>
</mml:msup>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mi>x</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>y</mml:mi>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>=</mml:mo>
<mml:mi>f</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mi>x</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>y</mml:mi>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>f</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mi>x</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>y</mml:mi>
<mml:mo>+</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:mtd>
</mml:mtr>
</mml:mtable>
</mml:mrow>
</mml:math>
</disp-formula>
<p>where <italic>f</italic>(<italic>x</italic>, <italic>y</italic>) means the pixel at position (<italic>x</italic>, <italic>y</italic>). Moreover, we perform the enhanced operation to obtain the more obvious gradient information:</p>
<disp-formula>
<label>(14)</label>
<mml:math display="block" id="M14">
<mml:mrow>
<mml:mi>G</mml:mi>
<mml:mo>=</mml:mo>
<mml:munder>
<mml:mrow>
<mml:mi>max</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>y</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mi>W</mml:mi>
</mml:mrow>
</mml:munder>
<mml:mi>&#xa0;</mml:mi>
<mml:munder>
<mml:mrow>
<mml:mi>max</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>x</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mi>H</mml:mi>
</mml:mrow>
</mml:munder>
<mml:mo stretchy="false">(</mml:mo>
<mml:mo>&#x2207;</mml:mo>
<mml:mi>g</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mi>x</mml:mi>
<mml:mo>+</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>,</mml:mo>
<mml:mi>y</mml:mi>
<mml:mo>+</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>,</mml:mo>
<mml:mo>&#x2207;</mml:mo>
<mml:mi>g</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mi>x</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>y</mml:mi>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo stretchy="false">)</mml:mo>
<mml:mo>.</mml:mo>
</mml:mrow>
</mml:math>
</disp-formula>
<p>where <italic>H</italic>={1,&#x2026;,<italic>h</italic>&#x2013;1} and <italic>W</italic>={1,&#x2026;,<italic>w</italic>&#x2013;1}. The (<italic>x</italic>, <italic>y</italic>) represent the position at the gradient map. Through the above steps, we get the gradient image G with the abundant enhanced edge information.</p>
<p>Subsequently, we feed the gradient images from infrared and visible images into the edge attention module to generate edge attention feature maps with enhanced edge information. Then, the feature maps will be entered into the extraction branch to compensate edge information for the extracted features by IR<italic>i</italic> or VR<italic>i</italic>. The structure diagram of the edge attention module is shown in <xref ref-type="fig" rid="f7">
<bold>Figure&#xa0;7</bold>
</xref>. The edge attention module generates E<italic>
<sub>Vi</sub>
</italic> and E<italic>
<sub>Ii</sub>
</italic> layer by layer, which is then used to compensate edge information for the feature maps <italic>V<sub>i</sub>
</italic> and <italic>I<sub>i</sub>
</italic> extracted by VR<italic>
<sub>i</sub>
</italic> and IR<italic>
<sub>i</sub>
</italic> respectively. Therefore, compensated feature maps fused to generate the fused images retain more edge information.</p>
<fig id="f7" position="float">
<label>Figure&#xa0;7</label>
<caption>
<p>The architecture of edge attention module. The <italic>EAT</italic>
<sub>1-4</sub> are designed to generate shallow to deep edge feature maps <italic>E</italic>
<sub>
<italic>V</italic>
<sub>1&#x2212;4</sub>
</sub> or <italic>E</italic>
<sub>
<italic>I</italic>
<sub>1&#x2212;4</sub>
</sub>. For convolution layer, the &#x2018;<italic>k</italic>&#xd7;<italic>k</italic>,(<italic>in</italic>,<italic>out</italic>)&#x2018; means that the convolution kernel size is <italic>k</italic>&#xd7;<italic>k</italic> , the input channel is <italic>in</italic> and output channel is <italic>out</italic>. In addition, the &#x2018;rate 2&#x2019; denotes the dilated convolution operator with a dilation rate of two.</p>
</caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fpls-13-1056711-g007.tif"/>
</fig>
</sec>
<sec id="s2_2_5">
<title>2.2.5 Loss function</title>
<p>For infrared and visible image fusion, it is difficult to provide the ground truth of fused images for networks to train a model. However, the requirement to retain salient target information in the infrared image and the texture information in the visible image is determined. Inspired by this requirement, the loss function we employ is as follows:</p>
<disp-formula>
<label>(15)</label>
<mml:math display="block" id="M15">
<mml:mrow>
<mml:msub>
<mml:mi>L</mml:mi>
<mml:mi>F</mml:mi>
</mml:msub>
<mml:mo>=</mml:mo>
<mml:msub>
<mml:mi>L</mml:mi>
<mml:mrow>
<mml:mtext>pixel</mml:mtext>
</mml:mrow>
</mml:msub>
<mml:mo>+</mml:mo>
<mml:mi>a</mml:mi>
<mml:msub>
<mml:mi>L</mml:mi>
<mml:mrow>
<mml:mtext>texture</mml:mtext>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</disp-formula>
<p>where the <italic>L<sub>pixel</sub>
</italic> constrains the fused image to contain more target information from the image pair facilitating target tracking and the <italic>L<sub>texture</sub>
</italic> forces the fused images to contain more texture details which can effectively improve the identification of objects in images.</p>
<p>Specifically, the exact definition of <italic>L<sub>pixel</sub>
</italic> is expressed as follows:</p>
<disp-formula>
<label>(16)</label>
<mml:math display="block" id="M16">
<mml:mrow>
<mml:msub>
<mml:mi>L</mml:mi>
<mml:mrow>
<mml:mtext>pixel</mml:mtext>
</mml:mrow>
</mml:msub>
<mml:mo>=</mml:mo>
<mml:mfrac>
<mml:mn>1</mml:mn>
<mml:mi>m</mml:mi>
</mml:mfrac>
<mml:mstyle displaystyle="true">
<mml:munderover>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>m</mml:mi>
</mml:munderover>
<mml:mrow>
<mml:mo>&#x2225;</mml:mo>
<mml:msubsup>
<mml:mi>I</mml:mi>
<mml:mi>f</mml:mi>
<mml:mi>j</mml:mi>
</mml:msubsup>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>max</mml:mi>
<mml:mtext>&#xa0;</mml:mtext>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:msubsup>
<mml:mi>I</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>r</mml:mi>
</mml:mrow>
<mml:mi>j</mml:mi>
</mml:msubsup>
<mml:mo>,</mml:mo>
<mml:msubsup>
<mml:mi>I</mml:mi>
<mml:mrow>
<mml:mi>v</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>s</mml:mi>
</mml:mrow>
<mml:mi>j</mml:mi>
</mml:msubsup>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:msup>
<mml:mo>&#x2225;</mml:mo>
<mml:mn>2</mml:mn>
</mml:msup>
</mml:mrow>
</mml:mstyle>
</mml:mrow>
</mml:math>
</disp-formula>
<p>where <italic>m</italic> is the batch size that is the number of training samples used in each iteration. The I<sub>f</sub> means the fused image with the input image pair {<italic>I<sub>ir</sub>
</italic>, <italic>I<sub>vis</sub>
</italic>}, and the max (&#xb7;) denotes the element-wise maximum selection. Through the maximum selection strategy, the fused images have the prominent target information.</p>
<p>Moreover, we hope the fused images contain significant target information and simultaneously preserve great textural details from source images. However, the <italic>L<sub>pixel</sub>
</italic> has very limited constraints on textural details. Therefore, the <italic>L<sub>texture</sub>
</italic>is introduced to force the fused image to retain more textural information and the <italic>L<sub>texture</sub>
</italic> is defined as:</p>
<disp-formula>
<label>(17)</label>
<mml:math display="block" id="M17">
<mml:mrow>
<mml:msub>
<mml:mi>L</mml:mi>
<mml:mrow>
<mml:mtext>texture</mml:mtext>
</mml:mrow>
</mml:msub>
<mml:mo>=</mml:mo>
<mml:mfrac>
<mml:mn>1</mml:mn>
<mml:mi>m</mml:mi>
</mml:mfrac>
<mml:mstyle displaystyle="true">
<mml:munderover>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>m</mml:mi>
</mml:munderover>
<mml:mrow>
<mml:mo>&#x2225;</mml:mo>
<mml:mrow>
<mml:mo>|</mml:mo>
<mml:mrow>
<mml:mo>&#x2207;</mml:mo>
<mml:msubsup>
<mml:mi>I</mml:mi>
<mml:mi>f</mml:mi>
<mml:mi>j</mml:mi>
</mml:msubsup>
</mml:mrow>
<mml:mo>|</mml:mo>
</mml:mrow>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>max</mml:mi>
<mml:mtext>&#xa0;</mml:mtext>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mrow>
<mml:mo>|</mml:mo>
<mml:mrow>
<mml:mo>&#x2207;</mml:mo>
<mml:msubsup>
<mml:mi>I</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>r</mml:mi>
</mml:mrow>
<mml:mi>j</mml:mi>
</mml:msubsup>
</mml:mrow>
<mml:mo>|</mml:mo>
</mml:mrow>
<mml:mo>,</mml:mo>
<mml:mrow>
<mml:mo>|</mml:mo>
<mml:mrow>
<mml:mo>&#x2207;</mml:mo>
<mml:msubsup>
<mml:mi>I</mml:mi>
<mml:mrow>
<mml:mi>v</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>s</mml:mi>
</mml:mrow>
<mml:mi>j</mml:mi>
</mml:msubsup>
</mml:mrow>
<mml:mo>|</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:msup>
<mml:mo>&#x2225;</mml:mo>
<mml:mn>2</mml:mn>
</mml:msup>
</mml:mrow>
</mml:mstyle>
</mml:mrow>
</mml:math>
</disp-formula>
<p>where the <italic>m</italic> is the batch size, the <italic>I<sub>f</sub>
</italic> means the fused image with the input image pair {<italic>I<sub>ir</sub>
</italic>, <italic>I<sub>vis</sub>
</italic>}, and the max (&#xb7;) denotes the element-wise maximum selection. The &#x2207; indicates the Sobel gradient operator and the |&#xb7;| means the absolute operation. The element-wise maximum selection strategy can make the fused images obtain the most significant edge textural information.</p>
</sec>
</sec>
</sec>
<sec id="s3">
<title>3 Experimental results and analysis</title>
<sec id="s3_1">
<title>3.1 Experimental configurations</title>
<p>To evaluate the proposed fusion algorithm in many aspects, we conduct extensively qualitative and quantitative experiments on the RoadScene (<xref ref-type="bibr" rid="B53">Xu et&#xa0;al., 2020</xref>) dataset. We evaluate the performance of our method by making a comparison with six state-of-the-art approaches, including two Nest-based methods, i.e., NestFuse (<xref ref-type="bibr" rid="B28">Li et&#xa0;al., 2020</xref>) and RFN-Nest (<xref ref-type="bibr" rid="B29">Li et&#xa0;al., 2021a</xref>), and four CNN-based methods: DenseFuse (<xref ref-type="bibr" rid="B27">Li and Wu, 2018</xref>), IFCNN (<xref ref-type="bibr" rid="B58">Zhang et&#xa0;al., 2020</xref>), U2Fusion (<xref ref-type="bibr" rid="B54">Xu et&#xa0;al., 2022</xref>), and SDNet (<xref ref-type="bibr" rid="B59">Zhang and Ma, 2021</xref>). The subjective visual perception system is vulnerable to human factors, such as personal emotion and visual environment, and the fused images using different approaches resemble somewhat. Therefore, there are six evaluation statistical metrics which are selected to quantify the evaluation, including mutual information(MI) (<xref ref-type="bibr" rid="B42">Qu et&#xa0;al., 2002</xref>), entropy(EN) (<xref ref-type="bibr" rid="B44">Roberts et&#xa0;al., 2008</xref>), visual information fidelity(VIF) (<xref ref-type="bibr" rid="B19">Han et&#xa0;al., 2013</xref>), stand deviation (SD), spatial frequency(SF) (<xref ref-type="bibr" rid="B16">Eskicioglu and Fisher, 1995</xref>) and average gradient(AG) (<xref ref-type="bibr" rid="B62">Zhao et&#xa0;al., 2019b</xref>). MI quantifies the amount of information obtained from the source image by the fused image, and EN assesses the amount of information contained in the fused image based on information theory. VIF mainly computes information fidelity in a fused image, which is in line with human visual perception. SD reflects the contrast of an image based on statical concepts, a larger SD value indicates a higher contrast distribution in an image, and the image carries more information. SF reflects the change rate of image gray scale. AG can measure the fused image clarity, which can be considered that the greater AG, the better the image clarity and the better the fused image quality. EN, SF and SD are reference-free metrics. Moreover, a fusion method with larger MI, EN, VIF, SD, SF, and AG represents better performance.</p>
</sec>
<sec id="s3_2">
<title>3.2 Details of implementation</title>
<p>In the training process of the RADFNet model, we use images from the OSU (<xref ref-type="bibr" rid="B15">Davis and Sharma, 2007</xref>) dataset to construct the training dataset. Due to different imaging sensors, the image pairs in the OSU dataset are not strictly registered resulting in black edges in infrared images. Therefore, we crop both infrared and visible images at the same size 280 &#xd7; 200. Based on the above operations, we can get 8,544 image pairs. It is worth nothing that the visible images in the OSU dataset are color images, but the infrared images are grayscale. To make the number of channels with the input image pair the same, we perform the process that converts the visible images to grayscale images in advance. Moreover, all images are normalized to [0,1] before being fed into the network to accelerate model convergence. The hyper-parameter of the loss is set as <italic>a</italic> = 10. Adam optimizer (<xref ref-type="bibr" rid="B23">Kingma and Ba, 2015</xref>) with <italic>&#x3b2;</italic>1 of 0.9, <italic>&#x3b2;</italic>2 of 0.999, epsilon of 10<sup>&#x2212;8</sup>, weight decay of 0, the initial learning rate of 0.001 is used to optimize our fusion model with the guidance of loss function <italic>L<sub>F</sub>
</italic>. All experiments are conducted on the Quadro RTX6000 GPU and 2.90 GHz Intel(R) Xeon(R) Gold 6226R CPU.</p>
<p>The RoadScene dataset contains color visible images, but we employ the input grayscale images to train the proposed network. To get better visuals in the test phase, we adopt the strategy (<xref ref-type="bibr" rid="B41">Prabhakar et&#xa0;al., 2017</xref>) to process color images instead of converting the input color images to grayscale images. Precisely, we first convert the color image to the YCbCr color space, then the infrared image and the Y channel of visible image are entered into the RADFNet. Finally, the fusion result is concatenated with Cb andCr channels from visible image along channel-wise and then converted into the RGB color image. The RGB color image is the result of the proposed network.</p>
</sec>
<sec id="s3_3" sec-type="results">
<title>3.3 Results analysis on RoadScene datasets</title>
<p>To fully evaluate the performance of the RADFNet, we compare the RADFNet with the other six methods on the Roadscene dataset. The Roadscene dataset mainly contains road scenes, including pedestrians and cars, in the daytime and at night. We select two images in the daytime and two in the nighttime for evaluation subjectively so as to exhibit some intuitive fused images on the fusion performance. The fused images of the proposed RADFNet and the other six methods are presented in <xref ref-type="fig" rid="f8">
<bold>Figure&#xa0;8</bold>
</xref>. In the daytime scenes, the fused images with exceptional visual quality have rich texture information from visible images and enhanced prominent target information from infrared images. In the first column images in <xref ref-type="fig" rid="f8">
<bold>Figure&#xa0;8</bold>
</xref>, RADFNet makes the pedestrians in the image have the most incredible vigorous light intensity. The fused images of U2fusion and SDnet show they tend to darken the entire color of the images. For example, the color of the sky is darker than the fusion images with other methods. In the second column, all six methods enhance the pedestrian. Still, all other methods, except the RADFNet, dim the streetlamp to a certain extent, thus losing information. Moreover, the fusion image of the proposed approach has more obvious color contrast and texture details, so the buildings in our fused image have a richer structure sense than the fused images with other methods. In the nighttime scenes, the ability of both infrared images and visible images to provide information is limited. Therefore, sufficiently retaining meaningful data from the source images is challenging. In the third column, all fusion methods inevitably integrate useless information into the fused image, which degrades the visual quality of the image. Regardless, the proposed approach best protects the information from the visible image while using the meaningful information from the infrared image to enhance the target information. In the last column, compared with other fused images, the fused image in the proposed method failsto remove the halo on the streetlamp altogether. Nonetheless, the signs on the road are most conspicuous in the fusion image, while signs on the street in other images even tend to disappear. In a word, the proposed method can efficiently utilize the information of the infrared and visible images to generate high-quality fused images.</p>
<fig id="f8" position="float">
<label>Figure&#xa0;8</label>
<caption>
<p>The visual results comparison with different methods on the Roadscene dataset.</p>
</caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fpls-13-1056711-g008.tif"/>
</fig>
<p>To avoid human factors and other factors affecting the subjective evaluation. We conduct quantitative assessments with the six approaches and the proposed method. The results of six metrics on the Roadscene dataset, which contains 221 image pairs, are shown in <xref ref-type="fig" rid="f9">
<bold>Figure&#xa0;9</bold>
</xref>. It can be noted that our results achieve better performance on six metrics. The best MI means that our method transfers the most information from the source image to the fused image and the best EN represents the fused image thatcontains the most information. The proposed method represents the best on VIF, which indicates our fused image gets a better human visual perception effect. The best SF and AG suggest that the proposed approach generates the clearest image with remarkable quality. In addition, our RADFNet displays the best SD, illustrating our fused images have the highest contrast. Combined with subjective and quantitative evaluation results, these results prove that RADFNet can convert more meaningful information from infrared and visible images to fused images while ensuring the best quality.</p>
<fig id="f9" position="float">
<label>Figure&#xa0;9</label>
<caption>
<p>The quantization results of six metrics on the 221 image pairs from the Roadscene dataset. The abscissa x refers to the number of image pairs and the ordinate y refers to the metric value.</p>
</caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fpls-13-1056711-g009.tif"/>
</fig>
</sec>
<sec id="s3_4">
<title>3.4 Ablation experiment</title>
<p>To verify the effectiveness of the edge attention module, we conduct ablation experiments. We employ edge attention and ignore edge attention to create two models, then the same image pair is used as input to test the difference between the two models, and the visual results are presented in <xref ref-type="fig" rid="f10">
<bold>Figure&#xa0;10</bold>
</xref>. The red and green box parts are magnified for a more intuitive comparison. In the first row, the telegraph pole in the red box with edge attention has a clearer texture, while that without edge attention even becomes blurred. In addition, the leaves with edge attention in the green box also have more precise texture details than that not using edge attention. The words in the red box of the images in the second row are difficult to identify because of the blurred source image. In contrast, words in the fused image using edge attention are more beneficial to observe than that in the image not using edge attention because the edge attention module compensates for the edge information for the fused image.</p>
<fig id="f10" position="float">
<label>Figure&#xa0;10</label>
<caption>
<p>The results of ablation study about the influence of edge attention module in two image pairs from the Roadscene dataset.</p>
</caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fpls-13-1056711-g010.tif"/>
</fig>
<p>In addition, to comprehensively evaluate the impact of edge attention in fused images, we make quantitative evaluations for the four images in <xref ref-type="fig" rid="f10">
<bold>Figure&#xa0;10</bold>
</xref>, and the result is listed in <xref ref-type="table" rid="T1">
<bold>Table&#xa0;1</bold>
</xref>. It is noted that only the fused images with edge attention have a slightly lower metric SD than that without edge attention. The fused images with edge attention are higher for the other five metrics, i.e., EN, SF, SD, MI, VIF, and AG in both Street and House images. The results show that the generated edge information from the edge attention module compensating for the fused image can improve the image quality effectively.</p>
<table-wrap id="T1" position="float">
<label>Table&#xa0;1</label>
<caption>
<p>The quantitative results on the four images shown in <xref ref-type="fig" rid="f10">
<bold>Figure&#xa0;10</bold>
</xref>.</p>
</caption>
<table frame="hsides">
<thead>
<tr>
<th valign="top" align="left"/>
<th valign="top" align="center"/>
<th valign="top" align="center">EN</th>
<th valign="top" align="center">SF</th>
<th valign="top" align="center">SD</th>
<th valign="top" align="center">MI</th>
<th valign="top" align="center">VIF</th>
<th valign="top" align="center">AG</th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" rowspan="2" align="left">Street</td>
<td valign="top" align="left">Edge</td>
<td valign="top" align="center">7.514</td>
<td valign="top" align="center">0.077</td>
<td valign="top" align="center">10.492</td>
<td valign="top" align="center">3.890</td>
<td valign="top" align="center">0.730</td>
<td valign="top" align="center">7.763</td>
</tr>
<tr>
<td valign="top" align="left">No-Edge</td>
<td valign="top" align="center">7.533</td>
<td valign="top" align="center">0.061</td>
<td valign="top" align="center">10.721</td>
<td valign="top" align="center">2.376</td>
<td valign="top" align="center">0.590</td>
<td valign="top" align="center">5.905</td>
</tr>
<tr>
<td valign="top" rowspan="2" align="left">House</td>
<td valign="top" align="left">Edge</td>
<td valign="top" align="center">7.586</td>
<td valign="top" align="center">0.072</td>
<td valign="top" align="center">10.334</td>
<td valign="top" align="center">3.946</td>
<td valign="top" align="center">0.937</td>
<td valign="top" align="center">6.846</td>
</tr>
<tr>
<td valign="top" align="left">No-Edge</td>
<td valign="top" align="center">7.573</td>
<td valign="top" align="center">0.056</td>
<td valign="top" align="center">10.605</td>
<td valign="top" align="center">2.686</td>
<td valign="top" align="center">0.709</td>
<td valign="top" align="center">5.427</td>
</tr>
</tbody>
</table>
<table-wrap-foot>
<p>The Street means the first row images and House denotes the second row images. Edge and No-Edge refer to edge attention and no edge attention during image fusion, respectively.</p>
</table-wrap-foot>
</table-wrap>
</sec>
<sec id="s3_5" sec-type="discussion">
<title>3.5 Discussion on loss function</title>
<p>For the sake of comprehensively considering the improvement in model training on fused image quality, we design another loss function L<sub>FS</sub>, which can be defined as follows:</p>
<disp-formula>
<label>(18)</label>
<mml:math display="block" id="M18">
<mml:mrow>
<mml:msub>
<mml:mi>L</mml:mi>
<mml:mrow>
<mml:mi>F</mml:mi>
<mml:mi>S</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>=</mml:mo>
<mml:mi>&#x3b2;</mml:mi>
<mml:msub>
<mml:mi>L</mml:mi>
<mml:mrow>
<mml:mi>S</mml:mi>
<mml:mi>S</mml:mi>
<mml:mi>I</mml:mi>
<mml:mi>M</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>+</mml:mo>
<mml:msub>
<mml:mi>L</mml:mi>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>x</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>u</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>e</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</disp-formula>
<p>where <italic>L<sub>texture</sub>
</italic> is represented by Equation 17, the value of <italic>&#x3b2;</italic> is 5, and the <italic>L<sub>SSIM</sub>
</italic> is the structural similarity (SSIM) loss, which can be expressed as</p>
<disp-formula>
<label>(19)</label>
<mml:math display="block" id="M19">
<mml:mrow>
<mml:msub>
<mml:mi>L</mml:mi>
<mml:mrow>
<mml:mi>S</mml:mi>
<mml:mi>S</mml:mi>
<mml:mi>I</mml:mi>
<mml:mi>M</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>=</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>&#x2212;</mml:mo>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mi>w</mml:mi>
<mml:mo>&#xb7;</mml:mo>
<mml:mtext>SSIM&#xa0;</mml:mtext>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>F</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>I</mml:mi>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>+</mml:mo>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>w</mml:mi>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>&#xb7;</mml:mo>
<mml:mtext>SSIM&#xa0;</mml:mtext>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>F</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>V</mml:mi>
<mml:mo stretchy="false">)</mml:mo>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:math>
</disp-formula>
<p>where the <italic>SSIM</italic>(&#xb7;) means the structural similarity (<xref ref-type="bibr" rid="B49">Wang et&#xa0;al., 2004</xref>). <italic>F</italic> denotes the output result from the proposed model. <italic>V</italic> and <italic>I</italic> refer to the homologous input visible and infrared images respectively. In addition, to balance the structural similarity loss between the fused image and infrared and visible image, the weight <italic>w</italic> is taken as 0.5.</p>
<p>The loss functions <italic>L<sub>F</sub>
</italic> and <italic>L<sub>FS</sub>
</italic> are used to train the proposed network respectively, and the results are exhibited in <xref ref-type="fig" rid="f11">
<bold>Figure&#xa0;11</bold>
</xref>. In the first row, the zebra crossing in the green box of fused image output after the network trained with <italic>L<sub>F</sub>
</italic> is more prominent than that trained with <italic>L<sub>FS</sub>
</italic>. However, the halo on the streetlamp in the red box in the image output by the network trained by <italic>L<sub>F</sub>
</italic> is not completely removed. In the second row, it can be seen that no matter the definition of the whole image or the details, the network output image using <italic>L<sub>F</sub>
</italic> training is better. In a word, the output image from the network trained by <italic>L<sub>F</sub>
</italic> can highlight more important information in the nighttime scenes. But that trained by <italic>L<sub>FS</sub>
</italic> can essentially eliminate the halo in the image. In the daytime scenes, the quality of the output images from the network trained by <italic>L<sub>F</sub>
</italic> is better in both overall and detail. Therefore, we choose fusion loss <italic>L<sub>F</sub>
</italic> as the training loss function in our experimental test.</p>
<fig id="f11" position="float">
<label>Figure&#xa0;11</label>
<caption>
<p>The results of RADFNet trained by SSIM loss <italic>L<sub>FS</sub>
</italic> and Fusion loss <italic>L<sub>F</sub>
</italic>.</p>
</caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fpls-13-1056711-g011.tif"/>
</fig>
<p>To set the best optimal coefficients for the proposed method, the parameter <italic>a</italic> is set as 1, 10, 50 and 100. The epoch and batch size are 4 and 4, respectively. One <italic>a</italic> is needed to choose for the image fusion task based on the test images. Six metrics are employed to evaluate the performance of RADFNet with different <italic>a</italic>. The values are shown in <xref ref-type="table" rid="T2">
<bold>Table&#xa0;2</bold>
</xref>. The best values are indicated in red and the second-best values are denoted in blue. It is worth nothing that three of the six metrics are best when <italic>a</italic>=1. However, the metrics MI and VIF are unstable. When <italic>a</italic>=10, the values of all metrics are considerable and stable, which indicates the proposed network can achieve better fusion performance than other values of <italic>a</italic>. So, <italic>a</italic> is set as 10 in experiments.</p>
<table-wrap id="T2" position="float">
<label>Table&#xa0;2</label>
<caption>
<p>The quantitative results on the RoadScene dataset with different <italic>a</italic>.</p>
</caption>
<table frame="hsides">
<thead>
<tr>
<th valign="top" align="left"/>
<th valign="top" align="center">
<italic>a=</italic>1</th>
<th valign="top" align="center">
<italic>a</italic>=10</th>
<th valign="top" align="center">
<italic>a</italic>=50</th>
<th valign="top" align="center">
<italic>a=</italic>100</th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">EN</td>
<td valign="top" align="center">7.612254</td>
<td valign="top" align="center">7.604088</td>
<td valign="top" align="center">7.5805</td>
<td valign="top" align="center">7.58722</td>
</tr>
<tr>
<td valign="top" align="left">SF</td>
<td valign="top" align="center">0.088493</td>
<td valign="top" align="center">0.075895</td>
<td valign="top" align="center">0.076245</td>
<td valign="top" align="center">0.073816</td>
</tr>
<tr>
<td valign="top" align="left">SD</td>
<td valign="top" align="center">10.41727</td>
<td valign="top" align="center">10.50972</td>
<td valign="top" align="center">10.35863</td>
<td valign="top" align="center">10.38415</td>
</tr>
<tr>
<td valign="top" align="left">MI</td>
<td valign="top" align="center">2.670785</td>
<td valign="top" align="center">3.468535</td>
<td valign="top" align="center">3.501638</td>
<td valign="top" align="center">3.156152</td>
</tr>
<tr>
<td valign="top" align="left">VIF</td>
<td valign="top" align="center">0.698988</td>
<td valign="top" align="center">0.836942</td>
<td valign="top" align="center">0.832764</td>
<td valign="top" align="center">0.787895</td>
</tr>
<tr>
<td valign="top" align="left">AG</td>
<td valign="top" align="center">8.19272</td>
<td valign="top" align="center">7.033987</td>
<td valign="top" align="center">6.88297</td>
<td valign="top" align="center">6.939895</td>
</tr>
</tbody>
</table>
<table-wrap-foot>
<p>The red word represents the best, and the blue word represents the second best.</p>
</table-wrap-foot>
</table-wrap>
</sec>
<sec id="s3_6">
<title>3.6 Fusion of unregistered image pairs</title>
<p>In general, it is difficult to obtain the source image pairs that have been strictly registered for image fusion because the imaging characteristics of different sensors are quite different. Therefore, at the training stage, we train our model without using the infrared and visible image pairs that are strictly registered. Aiming to verify that our method performs well in fusing image pairs without strict registration, we randomly translate the infrared images in the source image pairs with [-5,5], [-8,8]and [-10,10] pixels on the Roadscene dataset to get the misregistered infrared and visible image pairs, and then use the proposed method to fuse these misregistered image pairs. The fusion results of these unregistered images are displayed in <xref ref-type="fig" rid="f12">
<bold>Figure&#xa0;12</bold>
</xref>. From these fusion results, the proposed method can preserve the target information from the source image. At the same time, the texture details from the source images are also fused into the fused image, which improves the quality of the fused image. The numbers in the red box of the fused images are still vivid, even under different unregistered degrees. The experimental results demonstrate the proposed method with strong robustness still has good performance in fusing images without registration.</p>
<fig id="f12" position="float">
<label>Figure&#xa0;12</label>
<caption>
<p>The results of fusing unregistered images with the proposed method on the Roadscene dataset. The infrared images are randomly translated, which causes the black edge in the images. The infrared images from top to bottom are translated with [-5,5],[-8,8],[-10,10] pixels.</p>
</caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fpls-13-1056711-g012.tif"/>
</fig>
</sec>
</sec>
<sec id="s4" sec-type="discussion">
<title>4 Discussion</title>
<p>For the sake of avoiding the impact of changes in the agricultural working environment on the information perception for the intelligent agricultural system, we utilize infrared and visible image fusion to improve the image quality, so that the fused images can be used normally and even efficiently for various subsequent vision tasks in the intelligent agricultural system. Specifically, we propose a distributed fusion architecture for infrared and visible image fusion, termed RADFNet, which fuses images through three channels based on residual (RDCNN), edge attention, and multiscale channel attention. The proposed method can most retain the salient target information in the infrared image and the textural details information in the visible image. In addition, we introduce the multiscale channel attention module, which can extract coarse-to-fine features to preserve more information from source images to fused images. We also adopt an edge attention module that can compensate edge information for the fusedimage to make the fused image lose less edge information from source images. The comparative experiments are conducted on the Roadscene dataset, and the results demonstrate that the proposed method has superior performance in improving the fusion qualityand has achieved comparable results over the state-of-the-art image fusion algorithms in terms of visual effect and quantitative metrics. Finally, we send the unregistered image pairs into our network, and the results demonstrate that our method with strong robustness still performs well in fusing images without registration. The RADFNet performs well for infrared and visible image fusion due to the robust feature extraction ability of the network. The distributed fusion framework endows it with strong robustness, but the network parameters are still relatively large, which is not simple enough in the actual project deployment. In the future, it is necessary to improve the parameters of the network and the actual deployment of the model.</p>
</sec>
<sec id="s5" sec-type="data-availability">
<title>Data availability statement</title>
<p>The original contributions presented in the study are included in the article/supplementary material. Further inquiries can be directed to the corresponding authors.</p>
</sec>
<sec id="s6" sec-type="author-contributions">
<title>Author contributions</title>
<p>SF is responsible for the writing and theoretical design of the thesis, CW is responsible for the experimental test, and CL and MH are responsible for the verification of the experimental scheme, the analysis of the results and the project funding. All authors contributed to the article and approved the submitted version.</p>
</sec>
</body>
<back>
<sec id="s7" sec-type="funding-information">
<title>Funding</title>
<p>This work is supported by Hainan Provincial Natural Science Foundation of China (621MS019), National Natural Science Foundation of China (Grant #: 82260362), Major Science and Technology Project of Haikou (Grant: 2020-009), Innovative Research Project of Postgraduates in Hainan Province (Qhyb2021-10), National Natural Science Foundation of China (Grant: 62062030) and Key R&amp;D Project of Hainan province (Grant: ZDYF2021SHFZ243).</p>
</sec>
<sec id="s8" sec-type="COI-statement">
<title>Conflict of interest</title>
<p>The authors declare 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 id="s9" sec-type="disclaimer">
<title>Publisher&#x2019;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>Aamir</surname> <given-names>M.</given-names>
</name>
<name>
<surname>Li</surname> <given-names>Z.</given-names>
</name>
<name>
<surname>Bazai</surname> <given-names>S.</given-names>
</name>
<name>
<surname>Wagan</surname> <given-names>R. A.</given-names>
</name>
<name>
<surname>Bhatti</surname> <given-names>U. A.</given-names>
</name>
<name>
<surname>Nizamani</surname> <given-names>M. M.</given-names>
</name>
<etal/>
</person-group>. (<year>2021</year>). <article-title>Spatiotemporal change of air-quality patterns in hubei province&#x2013;a pre- to post-covid-19 analysis using path analysis and regression</article-title>. <source>Atmosphere</source> <volume>12</volume>. doi:&#xa0;<pub-id pub-id-type="doi">10.3390/atmos12101338atmos12101338</pub-id>
</citation>
</ref>
<ref id="B2">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Basak</surname> <given-names>H.</given-names>
</name>
<name>
<surname>Kundu</surname> <given-names>R.</given-names>
</name>
<name>
<surname>Singh</surname> <given-names>P.</given-names>
</name>
<name>
<surname>Ijaz</surname> <given-names>M. F.</given-names>
</name>
<name>
<surname>Wo&#x17a;niak</surname> <given-names>M.</given-names>
</name>
<name>
<surname>Sarkar</surname> <given-names>R.</given-names>
</name>
</person-group> (<year>2022</year>). <article-title>A union of deep learning and swarm-based optimization for 3d human action recognition</article-title>. <source>Sci. Rep.</source> <volume>12</volume>. doi:&#xa0;<pub-id pub-id-type="doi">10.1038/s41598-022-09293-8</pub-id>
</citation>
</ref>
<ref id="B3">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Bavirisetti</surname> <given-names>D. P.</given-names>
</name>
<name>
<surname>Xiao</surname> <given-names>G.</given-names>
</name>
<name>
<surname>Liu</surname> <given-names>G.</given-names>
</name>
</person-group> (<year>2017</year>). &#x201c;<article-title>Multi-sensor image fusion based on fourth order partial differential equations</article-title>,&#x201d; in <conf-name>2017 20th International Conference on Information Fusion (Fusion)</conf-name>. (<publisher-loc>Xi'an, China</publisher-loc>:<publisher-name>IEEE</publisher-name>) <fpage>1</fpage>&#x2013;<lpage>9</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.23919/ICIF.2017.8009719</pub-id>
</citation>
</ref>
<ref id="B4">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Bhatti</surname> <given-names>U. A.</given-names>
</name>
<name>
<surname>Ming-Quan</surname> <given-names>Z.</given-names>
</name>
<name>
<surname>Qing-Song</surname> <given-names>H.</given-names>
</name>
<name>
<surname>Ali</surname> <given-names>S.</given-names>
</name>
<name>
<surname>Hussain</surname> <given-names>A.</given-names>
</name>
<name>
<surname>Yuhuan</surname> <given-names>Y.</given-names>
</name>
<etal/>
</person-group>. (<year>2021</year>). <article-title>Advanced color edge detection using clifford algebra in satellite images</article-title>. <source>IEEE Photonics J.</source> <volume>13</volume>, <fpage>1</fpage>&#x2013;<lpage>20</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1109/JPHOT.2021.3059703</pub-id>
</citation>
</ref>
<ref id="B5">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Bhatti</surname> <given-names>U. A.</given-names>
</name>
<name>
<surname>Nizamani</surname> <given-names>M. M.</given-names>
</name>
<name>
<surname>Mengxing</surname> <given-names>H.</given-names>
</name>
</person-group> (<year>2022</year>a). <article-title>Climate change threatens pakistan's snow leopards</article-title>. <source>Science</source> <volume>377</volume>, <fpage>585</fpage>&#x2013;<lpage>586</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1126/science.add9065</pub-id>
</citation>
</ref>
<ref id="B6">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Bhatti</surname> <given-names>U. A.</given-names>
</name>
<name>
<surname>Wu</surname> <given-names>G.</given-names>
</name>
<name>
<surname>Bazai</surname> <given-names>S. U.</given-names>
</name>
<name>
<surname>Ali Nawaz</surname> <given-names>S.</given-names>
</name>
<name>
<surname>Baryalai</surname> <given-names>M.</given-names>
</name>
<name>
<surname>Bhatti</surname> <given-names>M. A.</given-names>
</name>
<etal/>
</person-group>. (<year>2022</year>b). <article-title>A pre- to post-covid-19 change of air quality patterns in anhui province using path analysis and regression</article-title>. <source>Polish J. Environ. Stud.</source> <volume>31</volume>, <fpage>4029</fpage>&#x2013;<lpage>4042</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.15244/pjoes/148065</pub-id>
</citation>
</ref>
<ref id="B7">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Bhatti</surname> <given-names>U. A.</given-names>
</name>
<name>
<surname>Yu</surname> <given-names>Z.</given-names>
</name>
<name>
<surname>Chanussot</surname> <given-names>J.</given-names>
</name>
<name>
<surname>Zeeshan</surname> <given-names>Z.</given-names>
</name>
<name>
<surname>Yuan</surname> <given-names>L.</given-names>
</name>
<name>
<surname>Luo</surname> <given-names>W.</given-names>
</name>
<etal/>
</person-group>. (<year>2022</year>c). <article-title>Local similarity-based spatial&#x2013;spectral fusion hyperspectral image classification with deep cnn and gabor filtering</article-title>. <source>IEEE Trans. Geosci. Remote Sens.</source> <volume>60</volume>, <fpage>1</fpage>&#x2013;<lpage>15</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1109/TGRS.2021.3090410</pub-id>
</citation>
</ref>
<ref id="B8">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Bhatti</surname> <given-names>U. A.</given-names>
</name>
<name>
<surname>Zeeshan</surname> <given-names>Z.</given-names>
</name>
<name>
<surname>Nizamani</surname> <given-names>M. M.</given-names>
</name>
<name>
<surname>Bazai</surname> <given-names>S.</given-names>
</name>
<name>
<surname>Yu</surname> <given-names>Z.</given-names>
</name>
<name>
<surname>Yuan</surname> <given-names>L.</given-names>
</name>
</person-group> (<year>2022</year>d). <article-title>Assessing the change of ambient air quality patterns in jiangsu province of china pre-to post-covid-19</article-title>. <source>Chemosphere</source> <volume>288</volume>, <elocation-id>132569</elocation-id>. doi:&#xa0;<pub-id pub-id-type="doi">10.1016/j.chemosphere.2021.132569</pub-id>
</citation>
</ref>
<ref id="B9">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Bulanon</surname> <given-names>D.</given-names>
</name>
<name>
<surname>Burks</surname> <given-names>T.</given-names>
</name>
<name>
<surname>Alchanatis</surname> <given-names>V.</given-names>
</name>
</person-group> (<year>2009</year>). <article-title>Image fusion of visible and thermal images for fruit detection</article-title>. <source>Biosyst. Eng.</source> <volume>103</volume>, <fpage>12</fpage>&#x2013;<lpage>22</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1016/j.biosystemseng.2009.02.009</pub-id>
</citation>
</ref>
<ref id="B10">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Chen</surname> <given-names>Q.</given-names>
</name>
<name>
<surname>Ding</surname> <given-names>W.</given-names>
</name>
<name>
<surname>Huang</surname> <given-names>X.</given-names>
</name>
<name>
<surname>Wang</surname> <given-names>H.</given-names>
</name>
</person-group> (<year>2022</year>a). <article-title>Generalized interval type ii fuzzy rough model based feature discretization for mixed pixels</article-title>. <source>IEEE Trans. Fuzzy Syst.</source>, <fpage>1</fpage>&#x2013;<lpage>15</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1109/TFUZZ.2022.3190625</pub-id>
</citation>
</ref>
<ref id="B11">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Chen</surname> <given-names>Q.</given-names>
</name>
<name>
<surname>Huang</surname> <given-names>M.</given-names>
</name>
<name>
<surname>Wang</surname> <given-names>H.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>A feature discretization method for classification of high-resolution remote sensing images in coastal areas</article-title>. <source>IEEE Trans. Geosci. Remote Sens.</source> <volume>59</volume>, <fpage>8584</fpage>&#x2013;<lpage>8598</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1109/TGRS.2020.3016526</pub-id>
</citation>
</ref>
<ref id="B12">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Chen</surname> <given-names>Q.</given-names>
</name>
<name>
<surname>Huang</surname> <given-names>M.</given-names>
</name>
<name>
<surname>Wang</surname> <given-names>H.</given-names>
</name>
<name>
<surname>Xu</surname> <given-names>G.</given-names>
</name>
</person-group> (<year>2022</year>b). <article-title>A feature discretization method based on fuzzy rough sets for high-resolution remote sensing big data under linear spectral model</article-title>. <source>IEEE Trans. Fuzzy Syst.</source> <volume>30</volume>, <fpage>1328</fpage>&#x2013;<lpage>1342</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1109/TFUZZ.2021.3058020</pub-id>
</citation>
</ref>
<ref id="B13">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Cui</surname> <given-names>G.</given-names>
</name>
<name>
<surname>Feng</surname> <given-names>H.</given-names>
</name>
<name>
<surname>Xu</surname> <given-names>Z.</given-names>
</name>
<name>
<surname>Li</surname> <given-names>Q.</given-names>
</name>
<name>
<surname>Chen</surname> <given-names>Y.</given-names>
</name>
</person-group> (<year>2015</year>). <article-title>Detail preserved fusion of visible and infrared images using regional saliency extraction and multi-scale image decomposition</article-title>. <source>Optics Commun.</source> <volume>341</volume>, <fpage>199</fpage>&#x2013;<lpage>209</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1016/j.optcom.2014.12.032</pub-id>
</citation>
</ref>
<ref id="B14">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Da Cunha</surname> <given-names>A.</given-names>
</name>
<name>
<surname>Zhou</surname> <given-names>J.</given-names>
</name>
<name>
<surname>Do</surname> <given-names>M.</given-names>
</name>
</person-group> (<year>2006</year>). <article-title>The nonsubsampled contourlet transform: Theory, design, and applications</article-title>. <source>IEEE Trans. Image Process.</source> <volume>15</volume>, <fpage>3089</fpage>&#x2013;<lpage>3101</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1109/TIP.2006.877507</pub-id>
</citation>
</ref>
<ref id="B15">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Davis</surname> <given-names>J.</given-names>
</name>
<name>
<surname>Sharma</surname> <given-names>V.</given-names>
</name>
</person-group> (<year>2007</year>). <article-title>Background-subtraction using contour-based fusion of thermal and visible imagery</article-title>. <source>Comput. Vision Image Understanding</source> <volume>106</volume>, <fpage>162</fpage>&#x2013;<lpage>182</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1016/j.cviu.2006.06.010</pub-id>
</citation>
</ref>
<ref id="B16">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Eskicioglu</surname> <given-names>A.</given-names>
</name>
<name>
<surname>Fisher</surname> <given-names>P.</given-names>
</name>
</person-group> (<year>1995</year>). <article-title>Image quality measures and their performance</article-title>. <source>IEEE Trans. Commun.</source> <volume>43</volume>, <fpage>2959</fpage>&#x2013;<lpage>2965</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1109/26.477498</pub-id>
</citation>
</ref>
<ref id="B17">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Farbman</surname> <given-names>Z.</given-names>
</name>
<name>
<surname>Fattal</surname> <given-names>R.</given-names>
</name>
<name>
<surname>Lischinski</surname> <given-names>D.</given-names>
</name>
<name>
<surname>Szeliski</surname> <given-names>R.</given-names>
</name>
</person-group> (<year>2008</year>). <article-title>Edge-preserving decompositions for multi-scale tone and detail manipulation</article-title>. <source>ACM Trans. Graph.</source> <volume>27</volume>, <fpage>1</fpage>&#x2013;<lpage>10</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1145/1360612.1360666</pub-id>
</citation>
</ref>
<ref id="B18">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Gangapure</surname> <given-names>V. N.</given-names>
</name>
<name>
<surname>Nanda</surname> <given-names>S.</given-names>
</name>
<name>
<surname>Chowdhury</surname> <given-names>A. S.</given-names>
</name>
</person-group> (<year>2018</year>). <article-title>Superpixel-based causal multisensor video fusion</article-title>. <source>IEEE Trans. Circuits Syst. Video Technol.</source> <volume>28</volume>, <fpage>1263</fpage>&#x2013;<lpage>1272</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1109/TCSVT.2017.2662743</pub-id>
</citation>
</ref>
<ref id="B19">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Han</surname> <given-names>Y.</given-names>
</name>
<name>
<surname>Cai</surname> <given-names>Y.</given-names>
</name>
<name>
<surname>Cao</surname> <given-names>Y.</given-names>
</name>
<name>
<surname>Xu</surname> <given-names>X.</given-names>
</name>
</person-group> (<year>2013</year>). <article-title>A new image fusion performance metric based on visual information fidelity</article-title>. <source>Inf. Fusion</source> <volume>14</volume>, <fpage>&#x2013;</fpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1016/j.inffus.2011.08.002</pub-id>
</citation>
</ref>
<ref id="B20">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>He</surname> <given-names>K.</given-names>
</name>
<name>
<surname>Zhang</surname> <given-names>X.</given-names>
</name>
<name>
<surname>Ren</surname> <given-names>S.</given-names>
</name>
<name>
<surname>Sun</surname> <given-names>J.</given-names>
</name>
</person-group> (<year>2016</year>a). &#x201c;<article-title>Deep residual learning for image recognition</article-title>,&#x201d; in <conf-name>2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)</conf-name>. (<publisher-loc>Las Vegas, NV, USA</publisher-loc>:<publisher-name>IEEE</publisher-name>) <fpage>770</fpage>&#x2013;<lpage>778</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1109/CVPR.2016.90</pub-id>
</citation>
</ref>
<ref id="B21">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>He</surname> <given-names>K.</given-names>
</name>
<name>
<surname>Zhang</surname> <given-names>X.</given-names>
</name>
<name>
<surname>Ren</surname> <given-names>S.</given-names>
</name>
<name>
<surname>Sun</surname> <given-names>J.</given-names>
</name>
</person-group> (<year>2016</year>b). &#x201c;<article-title>Identity mappings in deep residual networks</article-title>,&#x201d; in <source>Computer vision &#x2013; ECCV 2016</source>. Eds. <person-group person-group-type="editor">
<name>
<surname>Leibe</surname> <given-names>B.</given-names>
</name>
<name>
<surname>Matas</surname> <given-names>J.</given-names>
</name>
<name>
<surname>Sebe</surname> <given-names>N.</given-names>
</name>
<name>
<surname>Welling</surname> <given-names>M.</given-names>
</name>
</person-group> (<publisher-loc>Cham</publisher-loc>: <publisher-name>Springer International Publishing</publisher-name>), <fpage>630</fpage>&#x2013;<lpage>645</lpage>.</citation>
</ref>
<ref id="B22">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Hu</surname> <given-names>J.</given-names>
</name>
<name>
<surname>Shen</surname> <given-names>L.</given-names>
</name>
<name>
<surname>Albanie</surname> <given-names>S.</given-names>
</name>
<name>
<surname>Sun</surname> <given-names>G.</given-names>
</name>
<name>
<surname>Wu</surname> <given-names>E.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>Squeeze-and-excitation networks</article-title>. <source>IEEE Trans. Pattern Anal. Mach. Intell.</source> <volume>42</volume>, <fpage>2011</fpage>&#x2013;<lpage>2023</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1109/TPAMI.2019.2913372</pub-id>
</citation>
</ref>
<ref id="B23">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Kingma</surname> <given-names>D. P.</given-names>
</name>
<name>
<surname>Ba</surname> <given-names>J.</given-names>
</name>
</person-group> (<year>2015</year>). <source>. Adam: A method for stochastic optimization. CoRR abs/1412.6980</source>.</citation>
</ref>
<ref id="B24">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Kong</surname> <given-names>W.</given-names>
</name>
<name>
<surname>Lei</surname> <given-names>Y.</given-names>
</name>
<name>
<surname>Zhao</surname> <given-names>H.</given-names>
</name>
</person-group> (<year>2014</year>). <article-title>Adaptive fusion method of visible light and infrared images based on non-subsampled shearlet transform and fast non-negative matrix factorization</article-title>. <source>Infrared Phys. Technol.</source> <volume>67</volume>, <fpage>161</fpage>&#x2013;<lpage>172</lpage>. doi: <pub-id pub-id-type="doi">10.1016/j.infrared.2014.07.019</pub-id>
</citation>
</ref>
<ref id="B25">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Li</surname> <given-names>J.</given-names>
</name>
<name>
<surname>Huo</surname> <given-names>H.</given-names>
</name>
<name>
<surname>Li</surname> <given-names>C.</given-names>
</name>
<name>
<surname>Wang</surname> <given-names>R.</given-names>
</name>
<name>
<surname>Feng</surname> <given-names>Q.</given-names>
</name>
</person-group> (<year>2021</year>b). <article-title>Attentionfgan: Infrared and visible image fusion using attention-based generative adversarial networks</article-title>. <source>IEEE Trans. Multimedia</source> <volume>23</volume>, <fpage>1383</fpage>&#x2013;<lpage>1396</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1109/TMM.2020.2997127</pub-id>
</citation>
</ref>
<ref id="B26">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Li</surname> <given-names>S.</given-names>
</name>
<name>
<surname>Kang</surname> <given-names>X.</given-names>
</name>
<name>
<surname>Fang</surname> <given-names>L.</given-names>
</name>
<name>
<surname>Hu</surname> <given-names>J.</given-names>
</name>
<name>
<surname>Yin</surname> <given-names>H.</given-names>
</name>
</person-group> (<year>2017</year>). <article-title>Pixel-level image fusion: A survey of the state of the art</article-title>. <source>Inf. Fusion</source> <volume>33</volume>, <fpage>100</fpage>&#x2013;<lpage>112</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1016/j.inffus.2016.05.004</pub-id>
</citation>
</ref>
<ref id="B27">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Li</surname> <given-names>H.</given-names>
</name>
<name>
<surname>Wu</surname> <given-names>X.-J.</given-names>
</name>
</person-group> (<year>2018</year>). <article-title>Densefuse: A fusion approach to infrared and visible images</article-title>. <source>IEEE Trans. Image Process.</source> <volume>28</volume>, <fpage>2614</fpage>&#x2013;<lpage>2623</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1109/TIP.2018.2887342</pub-id>
</citation>
</ref>
<ref id="B28">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Li</surname> <given-names>H.</given-names>
</name>
<name>
<surname>Wu</surname> <given-names>X.-J.</given-names>
</name>
<name>
<surname>Durrani</surname> <given-names>T.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>Nestfuse: An infrared and visible image fusion architecture based on nest connection and spatial/channel attention models</article-title>. <source>IEEE Trans. Instrumentation Measurement</source> <volume>69</volume>, <fpage>9645</fpage>&#x2013;<lpage>9656</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1109/TIM.2020.3005230</pub-id>
</citation>
</ref>
<ref id="B29">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Li</surname> <given-names>H.</given-names>
</name>
<name>
<surname>Wu</surname> <given-names>X.-J.</given-names>
</name>
<name>
<surname>Kittler</surname> <given-names>J.</given-names>
</name>
</person-group> (<year>2021</year>a). <article-title>Rfn-nest: An end-to-end residual fusion network for infrared and visible images</article-title>. <source>Inf. Fusion</source> <volume>73</volume>, <fpage>72</fpage>&#x2013;<lpage>86</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1016/j.inffus.2021.02.023</pub-id>
</citation>
</ref>
<ref id="B30">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Mallat</surname> <given-names>S.</given-names>
</name>
</person-group> (<year>1989</year>). <article-title>A theory for multiresolution signal decomposition: the wavelet representation</article-title>. <source>IEEE Trans. Pattern Anal. Mach. Intell.</source> <volume>11</volume>, <fpage>674</fpage>&#x2013;<lpage>693</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1109/34.192463</pub-id>
</citation>
</ref>
<ref id="B31">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Ma</surname> <given-names>J.</given-names>
</name>
<name>
<surname>Ma</surname> <given-names>Y.</given-names>
</name>
<name>
<surname>Li</surname> <given-names>C.</given-names>
</name>
</person-group> (<year>2019</year>a). <article-title>Infrared and visible image fusion methods and applications: A survey</article-title>. <source>Inf. Fusion</source> <volume>45</volume>, <fpage>153</fpage>&#x2013;<lpage>178</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1016/j.inffus.2018.02.004</pub-id>
</citation>
</ref>
<ref id="B32">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Ma</surname> <given-names>J.</given-names>
</name>
<name>
<surname>Xu</surname> <given-names>H.</given-names>
</name>
<name>
<surname>Jiang</surname> <given-names>J.</given-names>
</name>
<name>
<surname>Mei</surname> <given-names>X.</given-names>
</name>
<name>
<surname>Zhang</surname> <given-names>X.-P.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>Ddcgan: A dual-discriminator conditional generative adversarial network for multi-resolution image fusion</article-title>. <source>IEEE Trans. Image Process.</source> <volume>29</volume>, <fpage>4980</fpage>&#x2013;<lpage>4995</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1109/TIP.2020.2977573</pub-id>
</citation>
</ref>
<ref id="B33">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Ma</surname> <given-names>J.</given-names>
</name>
<name>
<surname>Yu</surname> <given-names>W.</given-names>
</name>
<name>
<surname>Liang</surname> <given-names>P.</given-names>
</name>
<name>
<surname>Li</surname> <given-names>C.</given-names>
</name>
<name>
<surname>Jiang</surname> <given-names>J.</given-names>
</name>
</person-group> (<year>2019</year>b). <article-title>Fusiongan: A generative adversarial network for infrared and visible image fusion</article-title>. <source>Inf. Fusion</source> <volume>48</volume>, <fpage>11</fpage>&#x2013;<lpage>26</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1016/j.inffus.2018.09.004</pub-id>
</citation>
</ref>
<ref id="B34">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Ma</surname> <given-names>J.</given-names>
</name>
<name>
<surname>Zhang</surname> <given-names>H.</given-names>
</name>
<name>
<surname>Shao</surname> <given-names>Z.</given-names>
</name>
<name>
<surname>Liang</surname> <given-names>P.</given-names>
</name>
<name>
<surname>Xu</surname> <given-names>H.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>Ganmcc: A generative adversarial network with multiclassification constraints for infrared and visible image fusion</article-title>. <source>IEEE Trans. Instrumentation Measurement</source> <volume>70</volume>, <fpage>1</fpage>&#x2013;<lpage>14</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1109/TIM.2020.3038013</pub-id>
</citation>
</ref>
<ref id="B35">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Meng</surname> <given-names>F.</given-names>
</name>
<name>
<surname>Song</surname> <given-names>M.</given-names>
</name>
<name>
<surname>Guo</surname> <given-names>B.</given-names>
</name>
<name>
<surname>Shi</surname> <given-names>R.</given-names>
</name>
<name>
<surname>Shan</surname> <given-names>D.</given-names>
</name>
</person-group> (<year>2017</year>). <article-title>Image fusion based on object region detection and non-subsampled contourlet transform</article-title>. <source>Comput. Electr. Eng.</source> <volume>62</volume>, <fpage>375</fpage>&#x2013;<lpage>383</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1016/j.compeleceng.2016.09.0191</pub-id>
</citation>
</ref>
<ref id="B36">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Mitianoudis</surname> <given-names>N.</given-names>
</name>
<name>
<surname>Antonopoulos</surname> <given-names>S.-A.</given-names>
</name>
<name>
<surname>Stathaki</surname> <given-names>T.</given-names>
</name>
</person-group> (<year>2013</year>). &#x201c;<article-title>Region-based ica image fusion using textural information</article-title>,&#x201d; in <conf-name>2013 18th International Conference on Digital Signal Processing (DSP)</conf-name>. (<publisher-loc>Fira, Greece</publisher-loc>:<publisher-name>IEEE</publisher-name>) <fpage>1</fpage>&#x2013;<lpage>6</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1109/ICDSP.2013.6622678</pub-id>
</citation>
</ref>
<ref id="B37">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Mnih</surname> <given-names>V.</given-names>
</name>
<name>
<surname>Heess</surname> <given-names>N. M. O.</given-names>
</name>
<name>
<surname>Graves</surname> <given-names>A.</given-names>
</name>
<name>
<surname>Kavukcuoglu</surname> <given-names>K.</given-names>
</name>
</person-group> (<year>2014</year>). <article-title>Recurrent models of visual attention</article-title>. <source>ArXiv</source>. doi:&#xa0;<pub-id pub-id-type="doi">10.48550/arXiv.1406.6247</pub-id>
</citation>
</ref>
<ref id="B38">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Naidu</surname> <given-names>D. V.</given-names>
</name>
</person-group> (<year>2011</year>). <article-title>Image fusion technique using multi-resolution singular value decomposition</article-title>. <source>Defence Sci. J.</source> <volume>61</volume>. doi:&#xa0;<pub-id pub-id-type="doi">10.14429/dsj.61.705</pub-id>
</citation>
</ref>
<ref id="B39">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Nair</surname> <given-names>V.</given-names>
</name>
<name>
<surname>Hinton</surname> <given-names>G. E.</given-names>
</name>
</person-group> (<year>2010</year>). &#x201c;<article-title>Rectified linear units improve restricted boltzmann machines</article-title>,&#x201d; in <source>Proceedings of the 27th international conference on international conference on machine learning</source>, vol. <volume>10</volume>. (<publisher-loc>Madison, WI, USA</publisher-loc>: <publisher-name>Omnipress</publisher-name>), <fpage>807</fpage>&#x2013;<lpage>814</lpage>. ICML.</citation>
</ref>
<ref id="B40">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Nencini</surname> <given-names>F.</given-names>
</name>
<name>
<surname>Garzelli</surname> <given-names>A.</given-names>
</name>
<name>
<surname>Baronti</surname> <given-names>S.</given-names>
</name>
<name>
<surname>Alparone</surname> <given-names>L.</given-names>
</name>
</person-group> (<year>2007</year>). <article-title>Remote sensing image fusion using the curvelet transform</article-title>. <source>Inf. Fusion</source> <volume>8</volume>, <fpage>143</fpage>&#x2013;<lpage>156</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1016/j.inffus.2006.02.001</pub-id>
</citation>
</ref>
<ref id="B41">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Prabhakar</surname> <given-names>K. R.</given-names>
</name>
<name>
<surname>Srikar</surname> <given-names>V. S.</given-names>
</name>
<name>
<surname>Babu</surname> <given-names>R. V.</given-names>
</name>
</person-group> (<year>2017</year>). &#x201c;<article-title>Deepfuse: A deep unsupervised approach for exposure fusion with extreme exposure image pairs</article-title>,&#x201d; in <conf-name>2017 IEEE International Conference on Computer Vision (ICCV)</conf-name>. (<publisher-loc>Venice, Italy</publisher-loc>:<publisher-name>IEEE</publisher-name>) <fpage>4724</fpage>&#x2013;<lpage>4732</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1109/ICCV.2017.505</pub-id>
</citation>
</ref>
<ref id="B42">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Qu</surname> <given-names>G.</given-names>
</name>
<name>
<surname>Zhang</surname> <given-names>D.</given-names>
</name>
<name>
<surname>Yan</surname> <given-names>P.</given-names>
</name>
</person-group> (<year>2002</year>). <article-title>Information measure for performance of image fusion</article-title>. <source>Electron. Lett.</source> <volume>38</volume>, <fpage>313</fpage>&#x2013;<lpage>315</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1049/el:20020212</pub-id>
</citation>
</ref>
<ref id="B43">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Ren</surname> <given-names>X.</given-names>
</name>
<name>
<surname>Meng</surname> <given-names>F.</given-names>
</name>
<name>
<surname>Hu</surname> <given-names>T.</given-names>
</name>
<name>
<surname>Liu</surname> <given-names>Z.</given-names>
</name>
<name>
<surname>Wang</surname> <given-names>C.</given-names>
</name>
</person-group> (<year>2018</year>). &#x201c;<article-title>Infrared-visible image fusion based on convolutional neural networks (cnn)</article-title>,&#x201d; in <source>Intelligence science and big data engineering</source>. Eds. <person-group person-group-type="editor">
<name>
<surname>Peng</surname> <given-names>Y.</given-names>
</name>
<name>
<surname>Yu</surname> <given-names>K.</given-names>
</name>
<name>
<surname>Lu</surname> <given-names>J.</given-names>
</name>
<name>
<surname>Jiang</surname> <given-names>X.</given-names>
</name>
</person-group> (<publisher-loc>Cham</publisher-loc>: <publisher-name>Springer International Publishing</publisher-name>), <fpage>301</fpage>&#x2013;<lpage>307</lpage>.</citation>
</ref>
<ref id="B44">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Roberts</surname> <given-names>W.</given-names>
</name>
<name>
<surname>van Aardt</surname> <given-names>J.</given-names>
</name>
<name>
<surname>Ahmed</surname> <given-names>F.</given-names>
</name>
</person-group> (<year>2008</year>). <article-title>Assessment of image fusion procedures using entropy, image quality, and multispectral classification</article-title>. <source>J. Appl. Remote Sens.</source> <volume>2</volume>, <fpage>1</fpage>&#x2013;<lpage>28</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1117/1.2945910</pub-id>
</citation>
</ref>
<ref id="B45">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Sun</surname> <given-names>S.</given-names>
</name>
<name>
<surname>Lin</surname> <given-names>H.</given-names>
</name>
<name>
<surname>Ma</surname> <given-names>J.</given-names>
</name>
<name>
<surname>Li</surname> <given-names>X.</given-names>
</name>
</person-group> (<year>2017</year>). <article-title>Multi-sensor distributed fusion estimation with applications in networked systems: A review paper</article-title>. <source>Inf. Fusion</source> <volume>38</volume>, <fpage>122</fpage>&#x2013;<lpage>134</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1016/j.inffus.2017.03.006</pub-id>
</citation>
</ref>
<ref id="B46">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Szegedy</surname> <given-names>C.</given-names>
</name>
<name>
<surname>Ioffe</surname> <given-names>S.</given-names>
</name>
<name>
<surname>Vanhoucke</surname> <given-names>V.</given-names>
</name>
<name>
<surname>Alemi</surname> <given-names>A. A.</given-names>
</name>
</person-group> (<year>2017</year>). &#x201c;<article-title>Inception-v4, inception-resnet and the impact of residual connections on learning</article-title>,&#x201d; in <conf-name>AAAI</conf-name>. (<publisher-loc>San Francisco, California, USA</publisher-loc>:<publisher-name>AAAI Press</publisher-name>).</citation>
</ref>
<ref id="B47">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Ulyanov</surname> <given-names>D.</given-names>
</name>
<name>
<surname>Vedaldi</surname> <given-names>A.</given-names>
</name>
<name>
<surname>Lempitsky</surname> <given-names>V. S.</given-names>
</name>
</person-group> (<year>2016</year>). <article-title>Instance normalization: The missing ingredient for fast stylization</article-title>. <source>ArXiv</source>. doi:&#xa0;<pub-id pub-id-type="doi">10.48550/arXiv.1607.08022</pub-id>
</citation>
</ref>
<ref id="B48">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Vaswani</surname> <given-names>A.</given-names>
</name>
<name>
<surname>Shazeer</surname> <given-names>N. M.</given-names>
</name>
<name>
<surname>Parmar</surname> <given-names>N.</given-names>
</name>
<name>
<surname>Uszkoreit</surname> <given-names>J.</given-names>
</name>
<name>
<surname>Jones</surname> <given-names>L.</given-names>
</name>
<name>
<surname>Gomez</surname> <given-names>A. N.</given-names>
</name>
<etal/>
</person-group>. (<year>2017</year>). &#x201c;<article-title>Attention is all you need</article-title>,&#x201d; in <conf-name>NIPS</conf-name>. (<publisher-loc>Long Beach, California, USA</publisher-loc>:<publisher-name>Curran Associates Inc. Conference Location</publisher-name>).</citation>
</ref>
<ref id="B49">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Wang</surname> <given-names>Z.</given-names>
</name>
<name>
<surname>Bovik</surname> <given-names>A.</given-names>
</name>
<name>
<surname>Sheikh</surname> <given-names>H.</given-names>
</name>
<name>
<surname>Simoncelli</surname> <given-names>E.</given-names>
</name>
</person-group> (<year>2004</year>). <article-title>Image quality assessment: from error visibility to structural similarity</article-title>. <source>IEEE Trans. Image Process.</source> <volume>13</volume>, <fpage>600</fpage>&#x2013;<lpage>612</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1109/TIP.2003.819861</pub-id>
</citation>
</ref>
<ref id="B50">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Wang</surname> <given-names>F.</given-names>
</name>
<name>
<surname>Jiang</surname> <given-names>M.</given-names>
</name>
<name>
<surname>Qian</surname> <given-names>C.</given-names>
</name>
<name>
<surname>Yang</surname> <given-names>S.</given-names>
</name>
<name>
<surname>Li</surname> <given-names>C.</given-names>
</name>
<name>
<surname>Zhang</surname> <given-names>H.</given-names>
</name>
<etal/>
</person-group>. (<year>2017</year>). &#x201c;<article-title>Residual attention network for image classification</article-title>,&#x201d; in <conf-name>2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)</conf-name>. (<publisher-loc>Honolulu, HI, USA</publisher-loc>:<publisher-name>IEEE</publisher-name>) <fpage>6450</fpage>&#x2013;<lpage>6458</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1109/CVPR.2017.683</pub-id>
</citation>
</ref>
<ref id="B51">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Wieczorek</surname> <given-names>M.</given-names>
</name>
<name>
<surname>Si&#x142;ka</surname> <given-names>J.</given-names>
</name>
<name>
<surname>Wo&#x17a;niak</surname> <given-names>M.</given-names>
</name>
<name>
<surname>Garg</surname> <given-names>S.</given-names>
</name>
<name>
<surname>Hassan</surname> <given-names>M. M.</given-names>
</name>
</person-group> (<year>2022</year>). <article-title>Lightweight convolutional neural network model for human face detection in risk situations</article-title>. <source>IEEE Trans. Ind. Inf.</source> <volume>18</volume>, <fpage>4820</fpage>&#x2013;<lpage>4829</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1109/TII.2021.3129629</pub-id>
</citation>
</ref>
<ref id="B52">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Wu</surname> <given-names>Y.</given-names>
</name>
<name>
<surname>Huang</surname> <given-names>M.</given-names>
</name>
<name>
<surname>Li</surname> <given-names>Y.</given-names>
</name>
<name>
<surname>Feng</surname> <given-names>S.</given-names>
</name>
<name>
<surname>Wu</surname> <given-names>D.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>A Distributed Fusion Framework of Multispectral and Panchromatic Images Based on Residual Network</article-title>. <source>Remote Sens</source>. <volume>13</volume> (<issue>13</issue>), <fpage>2556</fpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.3390/rs13132556</pub-id>
</citation>
</ref>
<ref id="B53">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Xu</surname> <given-names>H.</given-names>
</name>
<name>
<surname>Ma</surname> <given-names>J.</given-names>
</name>
<name>
<surname>Jiang</surname> <given-names>J.</given-names>
</name>
<name>
<surname>Guo</surname> <given-names>X.</given-names>
</name>
<name>
<surname>Ling</surname> <given-names>H.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>U2fusion: A unified unsupervised image fusion network</article-title>. <source>IEEE Trans. Pattern Anal. Mach. Intell</source>. <volume>44</volume>, <page-range>502&#x2013;518</page-range>. doi:&#xa0;<pub-id pub-id-type="doi">10.1109/TPAMI.2020.3012548</pub-id>
</citation>
</ref>
<ref id="B54">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Xu</surname> <given-names>H.</given-names>
</name>
<name>
<surname>Ma</surname> <given-names>J.</given-names>
</name>
<name>
<surname>Jiang</surname> <given-names>J.</given-names>
</name>
<name>
<surname>Guo</surname> <given-names>X.</given-names>
</name>
<name>
<surname>Ling</surname> <given-names>H.</given-names>
</name>
</person-group> (<year>2022</year>). <article-title>U2fusion: A unified unsupervised image fusion network</article-title>. <source>IEEE Trans. Pattern Anal. Mach. Intell.</source> <volume>44</volume>, <fpage>502</fpage>&#x2013;<lpage>518</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1109/TPAMI.2020.3012548</pub-id>
</citation>
</ref>
<ref id="B55">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Yang</surname> <given-names>X.</given-names>
</name>
<name>
<surname>Zhang</surname> <given-names>W.-A.</given-names>
</name>
<name>
<surname>Yu</surname> <given-names>L.</given-names>
</name>
<name>
<surname>Xing</surname> <given-names>K.</given-names>
</name>
</person-group> (<year>2016</year>). <article-title>Multi-rate distributed fusion estimation for sensor network-based target tracking</article-title>. <source>IEEE Sensors J.</source> <volume>16</volume>, <fpage>1233</fpage>&#x2013;<lpage>1242</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1109/JSEN.2015.2497464</pub-id>
</citation>
</ref>
<ref id="B56">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Yan</surname> <given-names>G.</given-names>
</name>
<name>
<surname>Wo&#x17a;niak</surname> <given-names>M.</given-names>
</name>
</person-group> (<year>2022</year>). <article-title>Accurate key frame extraction algorithm of video action for aerobics online teaching</article-title>. <source>Mobile Networks Appl.</source> <volume>27</volume>. doi:&#xa0;<pub-id pub-id-type="doi">10.1007/s11036-022-01939-1</pub-id>
</citation>
</ref>
<ref id="B57">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhang</surname> <given-names>Q.</given-names>
</name>
<name>
<surname>Liu</surname> <given-names>Y.</given-names>
</name>
<name>
<surname>Blum</surname> <given-names>R. S.</given-names>
</name>
<name>
<surname>Han</surname> <given-names>J.</given-names>
</name>
<name>
<surname>Tao</surname> <given-names>D.</given-names>
</name>
</person-group> (<year>2018</year>). <article-title>Sparse representation based multi-sensor image fusion for multi-focus and multi-modality images: A review. <italic>Information fusio</italic>n</article-title>. <source>Information Fusion</source> <volume>40</volume>, <fpage>57</fpage>&#x2013;<lpage>75</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1016/j.inffus.2017.05.006</pub-id>
</citation>
</ref>
<ref id="B58">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhang</surname> <given-names>Y.</given-names>
</name>
<name>
<surname>Liu</surname> <given-names>Y.</given-names>
</name>
<name>
<surname>Sun</surname> <given-names>P.</given-names>
</name>
<name>
<surname>Yan</surname> <given-names>H.</given-names>
</name>
<name>
<surname>Zhao</surname> <given-names>X.</given-names>
</name>
<name>
<surname>Zhang</surname> <given-names>L.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>Ifcnn: A general image fusion framework based on convolutional neural network</article-title>. <source>Inf. Fusion</source> <volume>54</volume>, <fpage>99</fpage>&#x2013;<lpage>118</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1016/j.inffus.2019.07.011</pub-id>
</citation>
</ref>
<ref id="B59">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhang</surname> <given-names>H.</given-names>
</name>
<name>
<surname>Ma</surname> <given-names>J.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>Sdnet: A versatile squeeze-and-decomposition network for real-time image fusion</article-title>. <source>Int. J. Comput. Vision</source> <volume>129</volume>. doi:&#xa0;<pub-id pub-id-type="doi">10.1007/s11263-021-01501-8</pub-id>
</citation>
</ref>
<ref id="B60">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhang</surname> <given-names>X.</given-names>
</name>
<name>
<surname>Ma</surname> <given-names>Y.</given-names>
</name>
<name>
<surname>Fan</surname> <given-names>F.</given-names>
</name>
<name>
<surname>Zhang</surname> <given-names>Y.</given-names>
</name>
<name>
<surname>Huang</surname> <given-names>J.</given-names>
</name>
</person-group> (<year>2017</year>). <article-title>Infrared and visible image fusion <italic>via</italic> saliency analysis and local edge-preserving multi-scale decomposition</article-title>. <source>. J. Opt. Soc Am. A</source> <volume>34</volume>, <fpage>1400</fpage>&#x2013;<lpage>1410</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1364/JOSAA.34.001400</pub-id>
</citation>
</ref>
<ref id="B61">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Zhao</surname> <given-names>J.-X.</given-names>
</name>
<name>
<surname>Liu</surname> <given-names>J.</given-names>
</name>
<name>
<surname>Fan</surname> <given-names>D.-P.</given-names>
</name>
<name>
<surname>Cao</surname> <given-names>Y.</given-names>
</name>
<name>
<surname>Yang</surname> <given-names>J.</given-names>
</name>
<name>
<surname>Cheng</surname> <given-names>M.-M.</given-names>
</name>
</person-group> (<year>2019</year>a). &#x201c;<article-title>Egnet: Edge guidance network for salient object detection</article-title>,&#x201d; in <conf-name>2019 IEEE/CVF International Conference on Computer Vision (ICCV)</conf-name>. (<publisher-loc>Seoul, Korea (South)</publisher-loc>:<publisher-name>IEEE</publisher-name>) <fpage>8778</fpage>&#x2013;<lpage>8787</lpage>.</citation>
</ref>
<ref id="B62">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhao</surname> <given-names>W.</given-names>
</name>
<name>
<surname>Wang</surname> <given-names>D.</given-names>
</name>
<name>
<surname>Lu</surname> <given-names>H.</given-names>
</name>
</person-group> (<year>2019</year>b). <article-title>Multi-focus image fusion with a natural enhancement <italic>via</italic> a joint multi-level deeply supervised convolutional neural network</article-title>. <source>IEEE Trans. Circuits Syst. Video Technol.</source> <volume>29</volume>, <fpage>1102</fpage>&#x2013;<lpage>1115</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1109/TCSVT.2018.2821177</pub-id>
</citation>
</ref>
<ref id="B63">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhu</surname> <given-names>Z.</given-names>
</name>
<name>
<surname>Yin</surname> <given-names>H.</given-names>
</name>
<name>
<surname>Chai</surname> <given-names>Y.</given-names>
</name>
<name>
<surname>Li</surname> <given-names>Y.</given-names>
</name>
<name>
<surname>Qi</surname> <given-names>G.</given-names>
</name>
</person-group> (<year>2018</year>). <article-title>A novel multi-modality image fusion method based on image decomposition and sparse representation</article-title>. <source>Inf. Sci.</source> <volume>432</volume>, <fpage>516</fpage>&#x2013;<lpage>529</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1016/j.ins.2017.09.010</pub-id>
</citation>
</ref>
</ref-list>
</back>
</article>