<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD Journal Publishing DTD v2.3 20070202//EN" "journalpublishing.dtd">
<article xml:lang="EN" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" article-type="research-article">
<front>
<journal-meta>
<journal-id journal-id-type="publisher-id">Front. Neurorobot.</journal-id>
<journal-title>Frontiers in Neurorobotics</journal-title>
<abbrev-journal-title abbrev-type="pubmed">Front. Neurorobot.</abbrev-journal-title>
<issn pub-type="epub">1662-5218</issn>
<publisher>
<publisher-name>Frontiers Media S.A.</publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="doi">10.3389/fnbot.2022.1084543</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Neuroscience</subject>
<subj-group>
<subject>Original Research</subject>
</subj-group>
</subj-group>
</article-categories>
<title-group>
<article-title>Transformer-based progressive residual network for single image dehazing</article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name><surname>Yang</surname> <given-names>Zhe</given-names></name>
<xref ref-type="aff" rid="aff1"><sup>1</sup></xref>
</contrib>
<contrib contrib-type="author">
<name><surname>Li</surname> <given-names>Xiaoling</given-names></name>
<xref ref-type="aff" rid="aff1"><sup>1</sup></xref>
<xref ref-type="aff" rid="aff2"><sup>2</sup></xref>
</contrib>
<contrib contrib-type="author" corresp="yes">
<name><surname>Li</surname> <given-names>Jinjiang</given-names></name>
<xref ref-type="aff" rid="aff1"><sup>1</sup></xref>
<xref ref-type="aff" rid="aff3"><sup>3</sup></xref>
<xref ref-type="corresp" rid="c001"><sup>&#x0002A;</sup></xref>
<uri xlink:href="http://loop.frontiersin.org/people/901331/overview"/>
</contrib>
</contrib-group>
<aff id="aff1"><sup>1</sup><institution>School of Computer Science and Technology, Intgrow Education Technology, Qingdao Vocational and Technical College of Hotel Management, Shandong Technology and Business University</institution>, <addr-line>Yantai</addr-line>, <country>China</country></aff>
<aff id="aff2"><sup>2</sup><institution>Institute of Artificial Intelligence, University of Science and Technology Beijing</institution>, <addr-line>Beijing</addr-line>, <country>China</country></aff>
<aff id="aff3"><sup>3</sup><institution>Co-Innovation Center of Shandong Colleges and Universities, Future Intelligent Computing, Shandong Technology and Business University</institution>, <addr-line>Yantai</addr-line>, <country>China</country></aff>
<author-notes>
<fn fn-type="edited-by"><p>Edited by: Xin Jin, Yunnan University, China</p></fn>
<fn fn-type="edited-by"><p>Reviewed by: Yin Gao, Quanzhou Institute of Equipment Manufacturing, China; Qiang Guo, Shandong University of Finance and Economics, China</p></fn>
<corresp id="c001">&#x0002A;Correspondence: Jinjiang Li <email>lijinjiang&#x00040;sdtbu.edu.cn</email></corresp>
</author-notes>
<pub-date pub-type="epub">
<day>06</day>
<month>12</month>
<year>2022</year>
</pub-date>
<pub-date pub-type="collection">
<year>2022</year>
</pub-date>
<volume>16</volume>
<elocation-id>1084543</elocation-id>
<history>
<date date-type="received">
<day>30</day>
<month>10</month>
<year>2022</year>
</date>
<date date-type="accepted">
<day>17</day>
<month>11</month>
<year>2022</year>
</date>
</history>
<permissions>
<copyright-statement>Copyright &#x000A9; 2022 Yang, Li and Li.</copyright-statement>
<copyright-year>2022</copyright-year>
<copyright-holder>Yang, Li and Li</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 seriously degraded fogging image affects the further visual tasks. How to obtain a fog-free image is not only challenging, but also important in computer vision. Recently, the vision transformer (ViT) architecture has achieved very efficient performance in several vision areas.</p>
</sec>
<sec>
<title>Methods</title>
<p>In this paper, we propose a new transformer-based progressive residual network. Different from the existing single-stage ViT architecture, we recursively call the progressive residual network with the introduction of swin transformer. Specifically, our progressive residual network consists of three main components: the recurrent block, the transformer codecs and the supervise fusion module. First, the recursive block learns the features of the input image, while connecting the original image features of the original iteration. Then, the encoder introduces the swin transformer block to encode the feature representation of the decomposed block, and continuously reduces the feature mapping resolution to extract remote context features. The decoder recursively selects and fuses image features by combining attention mechanism and dense residual blocks. In addition, we add a channel attention mechanism between codecs to focus on the importance of different features.</p>
</sec>
<sec>
<title>Results and discussion</title>
<p>The experimental results show that the performance of this method outperforms state-of-the-art handcrafted and learning-based methods.</p>
</sec></abstract>
<kwd-group>
<kwd>transformer</kwd>
<kwd>residual network</kwd>
<kwd>image dehazing</kwd>
<kwd>progressive recurrent</kwd>
<kwd>multiple self-attention</kwd>
</kwd-group>
<contract-sponsor id="cn001">National Natural Science Foundation of China<named-content content-type="fundref-id">10.13039/501100001809</named-content></contract-sponsor>
<counts>
<fig-count count="9"/>
<table-count count="3"/>
<equation-count count="9"/>
<ref-count count="57"/>
<page-count count="14"/>
<word-count count="7892"/>
</counts>
</article-meta>
</front>
<body>
<sec sec-type="intro" id="s1">
<title>1. Introduction</title>
<p>Due to the color distortion, blurring and other quality problems of haze images that affect further information capture, single image deblurring has always been a challenging and highly concerned problem. The deblurring method originates from the classical atmospheric scattering model, and the imaging formula is as follows:</p>
<disp-formula id="E1"><label>(1)</label><mml:math id="M1"><mml:mrow><mml:mtable columnalign='left'><mml:mtr columnalign='left'><mml:mtd columnalign='left'><mml:mrow><mml:mtable><mml:mtr><mml:mtd><mml:mrow><mml:mi>I</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>=</mml:mo><mml:mi>J</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>+</mml:mo><mml:mi>A</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:mn>1</mml:mn><mml:mo>&#x02212;</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo stretchy='false'>)</mml:mo><mml:mo>,</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:mtext>&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;</mml:mtext><mml:mi>t</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>=</mml:mo><mml:msup><mml:mi>e</mml:mi><mml:mrow><mml:mo>&#x02212;</mml:mo><mml:mi>&#x003B2;</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:mi>&#x003BB;</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mi>d</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:msup><mml:mo>,</mml:mo><mml:mtext>&#x000A0;</mml:mtext></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow></mml:math></disp-formula>
<p>where <italic>I</italic>(<italic>x</italic>) is the degraded image, <italic>J</italic>(<italic>x</italic>) is the brightness of the scene when it does not propagate through the water, <italic>t</italic>(<italic>x</italic>) is the transmissivity of the propagation medium, &#x003B2;(&#x003BB;) is the attenuation coefficient of different wavelengths of light, &#x003BB; represents different color channels, <italic>d</italic>(<italic>x</italic>) is the distance between the camera and objects, and <italic>A</italic> is the ambient atmospheric light of the scene. Many deblurring methods based on imaging models (He et al., <xref ref-type="bibr" rid="B20">2010</xref>; Zhu et al., <xref ref-type="bibr" rid="B56">2015</xref>; Berman et al., <xref ref-type="bibr" rid="B5">2016</xref>, <xref ref-type="bibr" rid="B6">2018</xref>; Middleton, <xref ref-type="bibr" rid="B37">2019</xref>) restore clean images by reversing the blurring process, in which the atmospheric channel A (x) and the medium transmission map t(x) need to be estimated by manual prior. Although the quality of the blurred image is improved to some extent, these physical priors are not always reliable, and without priors and constraints, the blurring performance will be further reduced, resulting in artifacts and color distortion.</p>
<p>With the development of deep learning in recent years, convolutional neural network has become the backbone of various visual tasks due to its robustness and accuracy. The progress of CNN architecture improves network performance and promotes the progress of single image defogging (Qin et al., <xref ref-type="bibr" rid="B40">2020</xref>) and other hierarchical visual tasks (Afshar et al., <xref ref-type="bibr" rid="B1">2020</xref>; El Helou and S&#x000FC;sstrunk, <xref ref-type="bibr" rid="B18">2020</xref>; Akbari et al., <xref ref-type="bibr" rid="B2">2021</xref>). Although the method based on CNN has special representational ability. It is unable to learn global and remote semantic information interaction well due to the localization of convolution operation. To overcome these problems, some methods add self-attention mechanism (Wang et al., <xref ref-type="bibr" rid="B44">2020</xref>). While others use full attention structure to replace traditional RNN modeling, and propose transformer model to solve Seq2Seq problem (Vaswani et al., <xref ref-type="bibr" rid="B43">2017</xref>). Compared to CNN, Transformer does not increase to distance from the number of operations required to calculate the association between two positions, and can not only do parallel calculations, but also efficiently process global information and encode longer sequences. Due to its powerful presentation capabilities, researchers have applied Transformer to computer vision tasks such as image representation (Wu et al., <xref ref-type="bibr" rid="B47">2020</xref>), image segmentation (Zheng et al., <xref ref-type="bibr" rid="B55">2021</xref>), object detection (Carion et al., <xref ref-type="bibr" rid="B9">2020</xref>; Zhu et al., <xref ref-type="bibr" rid="B57">2020</xref>), pose estimation (Huang et al., <xref ref-type="bibr" rid="B21">2020a</xref>,<xref ref-type="bibr" rid="B22">b</xref>; Lin et al., <xref ref-type="bibr" rid="B32">2021b</xref>) and pre-training (Chen et al., <xref ref-type="bibr" rid="B12">2021a</xref>). There are still some problems that can not be ignored when the model is transferred to the visual task, such as the large scale change of the visual target and the high resolution pixel of CV.</p>
<p>Recently, researchers have improved Vit, and swin transformer (Liu et al., <xref ref-type="bibr" rid="B36">2021</xref>) has solved these problems and proved its effectiveness and superiority in target detection, instance segmentation, semantic segmentation and other task fields. Therefore, some methods uses it as the backbone for image classification, image restoration and medical image segmentation. For example, Chen et al. (<xref ref-type="bibr" rid="B13">2021b</xref>) introduces a transformer to encode image features and extract contextual input sequences. Cao et al. (<xref ref-type="bibr" rid="B8">2021</xref>) proposes a pure transformer similar to u-net for medical image segmentation. Input tokenized image patches to a transformer-based u-shaped encoder-decoder architecture with skip-connections for local-global semantic feature learning. Liang et al. (<xref ref-type="bibr" rid="B30">2021</xref>) uses several swin Transformer layers and a residual swin transformer block with a residual connection for image restoration. In order to obtain image features from multi-scale, Gao et al. (<xref ref-type="bibr" rid="B19">2021</xref>) proposes a method combining swin transformer trunk and traditional multi-stage network, which effectively improved the ability of feature extraction. Yue et al. (<xref ref-type="bibr" rid="B52">2021</xref>) proposes an iterative and progressive sampling strategy and combined with the transformer to classify images.</p>
<p>Inspired by the above process, we proposed an progressive residual network (PRnet) based on swin transformer. PRnet consists of recurrent block, transformer codecs and supervised fusion modules. First, we have a recurrent block that learns shallow features of input images and introduces a long short-term memory (LSTM) network to connect different iterations, ensuring that more of the original image features can be retained over multiple iterations of the model. The transformer codec then learns the sequence representation of the input image through the u-net structure, and effectively extracts the remote context features from multiple scales of the image. The encoder introduces swin transformer block to encode feature representation from the decomposed patch, and continuously reduces the resolution of feature map for local relationship modeling. Decoder decodes hidden features through convolution and upsampling and realizes dimensional transformation to further predict the semantic output of the global context representation. In addition, we connect the encoders through skip connection and add channel attention. this design can effectively avoid the loss of original features and improve the quality of the output image. Finally, the supervised fusion module combines the attention mechanism and dense residual blocks to recursively select and fuse the image features and transfer the attention-guided features to the next stage, which can effectively preserve the original features of the image and prevent the model from over-fitting. In addition, the whole recursive process under the supervision of the original input image can effectively retain the original resolution characteristics of the image, improve the learning efficiency and defogging performance of the network.</p>
<p>To validate our approach, we tested it on different data sets. A large number of experiments and qualitative and quantitative evaluations show that our iterative strategy is beneficial to image restoration and is superior to other state-of-the art methods (see <xref ref-type="fig" rid="F1">Figure 1</xref>). In short, our contribution is:</p>
<list list-type="bullet">
<list-item><p>We introduce the swin transformer into the iterative progressive residual network (PRnet), which obtains sufficient contextual semantic information and spatial features by learning multi-scale feature information of the input image.</p></list-item>
<list-item><p>We introduce channel attention between the encoder and decoder, which makes the module focus on extracting significant useful features related to clean image in the input image.</p></list-item>
<list-item><p>We design a supervised fusion module, which combined the dense residual block with attention to conduct recursive supervised fusion of image features under the supervision of ground-truth.</p></list-item>
</list>
<fig id="F1" position="float">
<label>Figure 1</label>
<caption><p>Image dehazing on the RESIDE dataset (Li et al., <xref ref-type="bibr" rid="B28">2018</xref>). Under different evaluation indexes, the performance of our method is the most advanced (SSIM on x-axis and PSNR on y-axis) when compared with several advanced methods.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fnbot-16-1084543-g0001.tif"/>
</fig>
</sec>
<sec id="s2">
<title>2. Related work</title>
<p>In this section, we will conduct a comprehensive review of fog removal methods and vision transformer relevant to our work. We will conduct a comprehensive review of single image defogging algorithms, including traditional image defogging and deep learning-based image defogging methods.</p>
<sec>
<title>2.1. Model-based method</title>
<p>By observing and analyzing the imaging process of fog image and its relationship with clean image, the physical model of atmospheric scattering for fog imaging is established. The model-based method tries to estimate the atmospheric light and medium transmission map using the handmade prior knowledge, and then restore the blurred image. Dark channel prior (DCP) is one of the outstanding representatives of priority-based methods. He et al. (<xref ref-type="bibr" rid="B20">2010</xref>) assumed that each pixel with a value close to zero has at least one color channel, and combined it with haze imaging model to recover high-quality fog-free images. Zhu et al. (<xref ref-type="bibr" rid="B56">2015</xref>) proposed a method of restoring image color attenuation by establishing a linear model to estimate the depth of field information. Berman et al. (<xref ref-type="bibr" rid="B5">2016</xref>, <xref ref-type="bibr" rid="B6">2018</xref>) propose an algorithm based on non-local prior to predicting atmospheric light by identifying haze lines and estimating transmission per pixel. Although these methods have achieved some success, they are still constrained by prior knowledge, which may lead to insufficient demisting effect and more serious artifacts and blurriness.</p>
</sec>
<sec>
<title>2.2. Deep-learning method</title>
<p>In recent years, a large number of methods based on deep learning have flooded with the field of dehazing. Some deep learning methods still combine physical models or prior knowledge to improve the accuracy of fog removal. Kar et al. (<xref ref-type="bibr" rid="B25">2020</xref>) takes the atmospheric light and transmission diagrams estimated by convolutional architecture as a prior condition, and uses an iterative mechanism to gradually update the estimated value to the more appropriate estimated value of fuzzy conditions. Yan et al. (<xref ref-type="bibr" rid="B50">2020</xref>) uses multi-scale convolutional neural network combined with atmospheric scattering model to extract features of different scales from global to local. By learning the mapping relationship between hazy images and their transmission images, Ren et al. (<xref ref-type="bibr" rid="B42">2020</xref>) predicts projected images at multiple scales and refined the results of defogging. Different from the above methods, Anvari and Athitsos (<xref ref-type="bibr" rid="B4">2020</xref>), Liu et al. (<xref ref-type="bibr" rid="B34">2020b</xref>), Wang et al. (<xref ref-type="bibr" rid="B45">2021</xref>), and Zhang et al. (<xref ref-type="bibr" rid="B54">2022</xref>) directly restores blurred images end-to-end by learning the mapping between blurred and clear images. Anvari and Athitsos (<xref ref-type="bibr" rid="B4">2020</xref>) combines encoder-decoder structure and residual block to restore fog-free scenes. Through local residual learning and feature attention mechanism, Qin et al. (<xref ref-type="bibr" rid="B40">2020</xref>) designs an end-to-end feature fusion attention network to directly restore fog-free images. Liu et al. (<xref ref-type="bibr" rid="B34">2020b</xref>) uses residual blocks in fine-grained and coarse-grained networks to generate clean images directly from input fuzzy images. These methods use residual learning to enable network residual links to bypass unimportant information and enable the network architecture to focus on more effective information.</p>
<p>In addition, some methods take into account the morphological differences of fuzzy images at different scales to extract, transfer and fuse multi-scale image features. For example, Yeh et al. (<xref ref-type="bibr" rid="B51">2019</xref>) relies on multi-scale residual learning and image decomposition to remove haze from a single image, and feature transmission benefited from the basic components of remnant CNN architecture and simplified u-net structure. Liu et al. (<xref ref-type="bibr" rid="B35">2019</xref>) performs multi-scale estimation based on attention, alleviates the bottleneck problem of traditional multi-scale methods and reduces the output image artifacts. Li et al. (<xref ref-type="bibr" rid="B29">2021</xref>) designed a dual attention to extract global features and guide subsequent recursive units. Through the strengthen-operate-subtract boosting strategy, Dong et al. (<xref ref-type="bibr" rid="B16">2020</xref>) proposes a multi-scale enhanced defogging network with dense feature fusion based on u-net architecture. Despite its success, the limitations of the convolution layer, the main building block of CNN networks, limit the ability to learn remote spatial relevance in such networks. To solve these problems, we have introduced the swin transformer block in this paper.</p>
</sec>
<sec>
<title>2.3. Vision transformer</title>
<p>Transformer was first proposed for machine translation Vaswani et al. (<xref ref-type="bibr" rid="B43">2017</xref>) and is widely used in many natural languages processing tasks. Because of its powerful representation ability, it has recently been applied to computer vision tasks. To adapt transformer for visual tasks, the researchers have modified it. For example, Transformer model does not have translation invariance and locality like CNN. Parmar et al. (<xref ref-type="bibr" rid="B39">2018</xref>) applies self-attention to local fields and solves the problem that it cannot be well generalized to new tasks when data is insufficient. In addition, location information is very important for Transformer. Dosovitskiy et al. (<xref ref-type="bibr" rid="B17">2020</xref>) adds position embedding to feature vector and proposes a visual transformer (ViT), which directly applies pure transformer to image patch sequence to complete image classification task. In addition, Transformer model does not have translation invariance and locality like CNN. So it cannot be generalized to new tasks when data is insufficient. Liu et al. (<xref ref-type="bibr" rid="B36">2021</xref>) improves ViT by limiting self-attention computation to non-overlapping local windows and allowing cross-window connections to improve efficiency. This layered architecture has the flexibility to model at a variety of scales, which can be well generalized to new tasks. For example, with Swin Transformer as its backbone, Xie et al. (<xref ref-type="bibr" rid="B48">2021</xref>) uses self-supervised learning methods to handle object detection and semantic segmentation tasks. Cao et al. (<xref ref-type="bibr" rid="B8">2021</xref>) proposes a pure Transformer similar to u-net for medical image segmentation based on u-encoder-decoder architecture and learning local and global semantic features by skipping connections. Huang et al. (<xref ref-type="bibr" rid="B24">2022</xref>) has designed an adaptive group attention for Swin Transformer, which reduces the model parameters while taking into account the network performance. Lin et al. (<xref ref-type="bibr" rid="B31">2021a</xref>) tries to incorporate the advantages of layered Swin Transformer into the standard encoder and decoder U-shaped architecture at the same time, so as to improve the semantic segmentation quality of different medical images. It designes a strong baseline model for image recovery based on Swin Transformer, and combined Swin Transformer layer with residual connection for depth feature extraction. The success of Swin Transformer in these visual tasks proves that it is superior in some respects to the full convolution approach.</p>
</sec>
</sec>
<sec id="s3">
<title>3. Progressive image dehazing networks</title>
<p>In this section, we first introduce the cross scales supervisory integration mechanism (CSSI) and then introduce our overall architecture of progressive residual networks. As shown in <xref ref-type="fig" rid="F2">Figure 2</xref>, it is made up of recurrent block, a Transformer encoder-decoder module based on the u-net architecture, and a supervised fusion module. Finally, we will describe the details of each module and the loss function in detail.</p>
<fig id="F2" position="float">
<label>Figure 2</label>
<caption><p>The proposed framework for PRnet. PRnet extracts early features through recurrent blocks, then extracts multi-scale features through transformer codec, and finally integrates the features into the supervised fusion module. The blue line represents concatenate operation, and the black line represents forward.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fnbot-16-1084543-g0002.tif"/>
</fig>
<sec>
<title>3.1. Cross scales supervisory integration mechanism</title>
<p>Our analysis shows that if the encoder and decoder are independent from each other, multi-scale features cannot interact with each other, which will greatly reduce the performance of the model (<xref ref-type="fig" rid="F3">Figure 3</xref>). If features are fused through simple transfer, convolution or addition microstructures, and these features are treated equally, it is easy to cause redundancy and bring great burden to the network. To solve this problem, we added cross scales supervisory integration (CSSI) between encoders, which can improve the learning efficiency of U-codecs, make full use of features of different scales, and ensure the connectivity of the model. CSSI converts the output feature of encoder layer through 1 &#x000D7; 1 convolution. Then, the convolution features are paid attention to the information useful to the current output features through the channel attention block (CAB). The channel attention mechanism aggregates spatial dimension features using operations such as convolution, activation function, global average pooling and maximum pooling. Subsequently, the above features are fused through the following skip connection:</p>
<disp-formula id="E2"><label>(2)</label><mml:math id="M2"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:mtable style="text-align:axis;" equalrows="false" columnlines="none" equalcolumns="false" class="array"><mml:mtr><mml:mtd><mml:msub><mml:mrow><mml:mi>F</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x02295;</mml:mo><mml:msub><mml:mrow><mml:mi>E</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mi>C</mml:mi><mml:mi>A</mml:mi><mml:mi>B</mml:mi><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mtext class="textrm" mathvariant="normal">conv</mml:mtext><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>E</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo>]</mml:mo></mml:mrow><mml:mo>&#x02295;</mml:mo><mml:msub><mml:mrow><mml:mi>E</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>where <italic>E</italic><sub><italic>i</italic></sub> and <italic>C</italic><sub><italic>i</italic></sub> represent the output of the encoder layer and channel attention mechanism respectively. Next, the output feature of the encoder layer is fused with the up-sampling and convolution operation results of the previous decoder layer to obtain the input feature of the next decoder layer:</p>
<disp-formula id="E3"><label>(3)</label><mml:math id="M3"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:mtable style="text-align:axis;" equalrows="false" columnlines="none" equalcolumns="false" class="array"><mml:mtr><mml:mtd><mml:msub><mml:mrow><mml:mi>D</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mi>C</mml:mi><mml:mi>S</mml:mi><mml:mi>S</mml:mi><mml:mi>I</mml:mi><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>F</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mtext class="textrm" mathvariant="normal">,conv</mml:mtext><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>&#x02191;</mml:mi><mml:msub><mml:mrow><mml:mi>D</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>-</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo>]</mml:mo></mml:mrow><mml:mo>,</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>where <italic>D</italic><sub><italic>i</italic>&#x02212;1</sub> and <italic>D</italic><sub><italic>i</italic></sub> represent the features of the previous and next decoder layers.</p>
<fig id="F3" position="float">
<label>Figure 3</label>
<caption><p><bold>(A)</bold> Encoder-decoder block. <bold>(B)</bold> Cross scale supervisory integration mechanism between encoder decoder and the last decoder.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fnbot-16-1084543-g0003.tif"/>
</fig>
<p>CSSI explores the relationship between feature maps of different channels through channel attention, adjusts and aggregates different feature maps in the process of feature interaction, and finally transfers them to the decoder layer. On the one hand, CSSI makes the network pay more attention to find the significant useful information related to the current output in the input data, which can effectively avoid the loss of original features and improve the quality of the output image. On the other hand, CSSI can improve the efficiency of feature fusion and interaction between codecs with different resolutions, effectively reducing the network burden.</p>
</sec>
<sec>
<title>3.2. Progressive networks</title>
<p>Swin Transformer interacts with the global information of the image, without considering the importance of the content of the image area and the overall structure of the object, and cannot pay better attention to the structure and details of the image. In order to make up for the above defects, we propose a new progressive residual network (PRnet), which solves the problem of fog removal through multiple stages. At the same time, u-transformer encoder-decoder is used in each stage to learn the morphological features of foggy images at different scales. To avoid the increase and over-fitting of network parameters, different from the previous multi-stage, we do not pile up several sub-networks, but use the recursive calculation between stages to share the same network parameters in multiple stages. In addition, while swin transformer avoids the segmentation edge loss problem, the Transformer image is smaller than the original image resolution. Therefore, ground truth is used to supervise the network, which can suppress features with less information in the current stage and only allow useful features to be transmitted to the next stage.</p>
<sec>
<title>3.2.1. Progressive recurrent block</title>
<p>We designed a Recurrent block in PRnet to learn the shallow features of the input image, and introduced the Long Short-Term Memory (LSTM) (Yamak et al., <xref ref-type="bibr" rid="B49">2019</xref>) networks to connect different iterations to ensure the propagation of features across multiple stages of the model. In the process of feature dependence, more original image features can be retained. As shown in <xref ref-type="fig" rid="F4">Figure 4</xref>, taking the t iteration as an example, we input the original foggy image and the predicted image output by the iteration into the network together, go through the convolutional layer 3 &#x000D7; 3 &#x000D7; 64 with a step size of 1, and then go through the activation function(ReLU) performs nonlinear correction. In the subsequent convolution, we did not perform batch normalization, but added an LSTM layer. LSTM introduces and splices the feature map output <italic>x</italic><sub><italic>t</italic>&#x02212;1</sub> from the <italic>t</italic>&#x02212;1 iteration and the previous hidden state <italic>h</italic><sub><italic>t</italic>&#x02212;1</sub>. The feature graph <italic>i</italic><sub><italic>t</italic></sub> is obtained by convolution, which is used to determine which information is important and needs to be retained. Then feature graphs <italic>f</italic><sub><italic>t</italic></sub> and <italic>o</italic><sub><italic>t</italic></sub> controlling forgotten data were obtained through sigmoid activation function, and then forgetting and remembering were carried out according to the following formula:</p>
<disp-formula id="E4"><label>(4)</label><mml:math id="M4"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:mtable style="text-align:axis;" equalrows="false" columnlines="none" equalcolumns="false" class="array"><mml:mtr><mml:mtd><mml:msub><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mrow><mml:mi>f</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>*</mml:mo><mml:msub><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi><mml:mo>-</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>&#x0002B;</mml:mo><mml:msub><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>*</mml:mo><mml:mstyle displaystyle="true"><mml:munderover accentunder="false" accent="false"><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mrow><mml:mo>&#x0007E;</mml:mo></mml:mrow></mml:munderover></mml:mstyle><mml:mo>,</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>Among them, <inline-formula><mml:math id="M5"><mml:munderover accentunder="false" accent="false"><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mrow><mml:mo>&#x0007E;</mml:mo></mml:mrow></mml:munderover></mml:math></inline-formula> represents the cell state, which is a feature map obtained by passing <italic>h</italic><sub><italic>t</italic>&#x02212;1</sub> and <italic>x</italic><sub><italic>t</italic>&#x02212;1</sub> to the Tanh function. Next, multiply <italic>o</italic><sub><italic>t</italic></sub> with <italic>C</italic><sub><italic>t</italic></sub> after Tanh activation to obtain <italic>h</italic><sub><italic>t</italic></sub> to determine the information carried in the hidden state, namely:</p>
<disp-formula id="E5"><label>(5)</label><mml:math id="M6"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:mtable style="text-align:axis;" equalrows="false" columnlines="none" equalcolumns="false" class="array"><mml:mtr><mml:mtd><mml:msub><mml:mrow><mml:mi>h</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mrow><mml:mi>o</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>*</mml:mo><mml:mtext>Tanh</mml:mtext><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>,</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>where <italic>h</italic><sub><italic>t</italic></sub> is output as the current cell, which is passed to the next time period with the new cell state <italic>C</italic><sub><italic>t</italic></sub>. The output of the entire asymptotic recursive process can be expressed as:</p>
<disp-formula id="E6"><label>(6)</label><mml:math id="M7"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:mtable style="text-align:axis;" equalrows="false" columnlines="none" equalcolumns="false" class="array"><mml:mtr><mml:mtd><mml:msub><mml:mrow><mml:mi>f</mml:mi></mml:mrow><mml:mrow><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>s</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mi>L</mml:mi><mml:mi>S</mml:mi><mml:mi>T</mml:mi><mml:mi>M</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi><mml:mo>-</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mi>h</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi><mml:mo>-</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<fig id="F4" position="float">
<label>Figure 4</label>
<caption><p>Progressive recurrent block structure. &#x02297; Represents Hadamard Product, and the corresponding elements in the matrix are multiplied. &#x02295; Represents matrix addition operation.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fnbot-16-1084543-g0004.tif"/>
</fig>
</sec>
<sec>
<title>3.2.2. Transformer encoder-decoder</title>
<p>As we all know, multi-scale networks can not only extract low-level high-resolution features and texture detail information, but also extract high-level feature semantic information, and fully extract and utilize image features at different scales. Therefore, we combine the advantages of swin transformer and cnn to design encoder-decoder based on u-net architecture. By learning the sequence representation of the input image, we can ensure that sufficient contextual semantic information and spatial features are acquired during the long-distance transmission.</p>
<p>Swin transformer introduces the locality idea in the Multiple Self-Attention (MSA) module to perform self-attention computation in the window region without overlap. Because of its hierarchical design and generalization, it has proven its effectiveness in several fields such as object detection, semantic segmentation and image denoising. Therefore, we apply Swin transformer directly in encoder to encode the feature representation from the decomposed patch.</p>
<p>Our encoder generates different number tokens through three layers of encoder layer. The first, second and third layers generate <inline-formula><mml:math id="M8"><mml:mfrac><mml:mrow><mml:mi>H</mml:mi></mml:mrow><mml:mrow><mml:mn>4</mml:mn></mml:mrow></mml:mfrac><mml:mo>&#x000D7;</mml:mo><mml:mfrac><mml:mrow><mml:mi>W</mml:mi></mml:mrow><mml:mrow><mml:mn>4</mml:mn></mml:mrow></mml:mfrac></mml:math></inline-formula>, <inline-formula><mml:math id="M9"><mml:mfrac><mml:mrow><mml:mi>H</mml:mi></mml:mrow><mml:mrow><mml:mn>8</mml:mn></mml:mrow></mml:mfrac><mml:mo>&#x000D7;</mml:mo><mml:mfrac><mml:mrow><mml:mi>W</mml:mi></mml:mrow><mml:mrow><mml:mn>8</mml:mn></mml:mrow></mml:mfrac></mml:math></inline-formula>, and <inline-formula><mml:math id="M10"><mml:mfrac><mml:mrow><mml:mi>H</mml:mi></mml:mrow><mml:mrow><mml:mn>16</mml:mn></mml:mrow></mml:mfrac><mml:mo>&#x000D7;</mml:mo><mml:mfrac><mml:mrow><mml:mi>W</mml:mi></mml:mrow><mml:mrow><mml:mn>16</mml:mn></mml:mrow></mml:mfrac></mml:math></inline-formula> tokens respectively. Each stage consists of Patch Merging and some Swin Transformer Blocks. We merged the image resolution by a sliding window operation for Patch Merging, and divided the image with a given size of <italic>H</italic>&#x000D7;<italic>W</italic> into RGB image patches, and marked them as the original pixel Mosaic vector with a size of 4 &#x000D7; 4. It is then mapped to a vector of dimension 4C using linear embedding. At this time, the output dimension is set to 2C and the feature size is set to <inline-formula><mml:math id="M11"><mml:mfrac><mml:mrow><mml:mi>H</mml:mi></mml:mrow><mml:mrow><mml:mn>8</mml:mn></mml:mrow></mml:mfrac><mml:mo>&#x000D7;</mml:mo><mml:mfrac><mml:mrow><mml:mi>W</mml:mi></mml:mrow><mml:mrow><mml:mn>8</mml:mn></mml:mrow></mml:mfrac></mml:math></inline-formula> from the original<inline-formula><mml:math id="M12"><mml:mfrac><mml:mrow><mml:mi>H</mml:mi></mml:mrow><mml:mrow><mml:mn>4</mml:mn></mml:mrow></mml:mfrac><mml:mo>&#x000D7;</mml:mo><mml:mfrac><mml:mrow><mml:mi>W</mml:mi></mml:mrow><mml:mrow><mml:mn>4</mml:mn></mml:mrow></mml:mfrac></mml:math></inline-formula>. Next, the output feature <italic>z</italic><sup><italic>l</italic>&#x02212;1</sup> enters two consecutive Swin Transformer Blocks for feature transformation. Unlike MSA in ViT, Swin Transformer Block computes self-attention by adding a relative position bias B to the corresponding head, then the output feature <italic>z</italic><sup><italic>l</italic>&#x02212;1</sup> of layer <italic>l</italic> can be written as follows:</p>
<disp-formula id="E7"><label>(7)</label><mml:math id="M13"><mml:mrow><mml:mtable columnalign='left'><mml:mtr columnalign='left'><mml:mtd columnalign='left'><mml:mrow><mml:mtable><mml:mtr><mml:mtd><mml:mrow><mml:msubsup><mml:mi>z</mml:mi><mml:mi>m</mml:mi><mml:mi>l</mml:mi></mml:msubsup><mml:mo>=</mml:mo><mml:mi>S</mml:mi><mml:mi>W</mml:mi><mml:mo>&#x02212;</mml:mo><mml:mi>M</mml:mi><mml:mi>S</mml:mi><mml:mi>A</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:mi>L</mml:mi><mml:mi>N</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:msup><mml:mi>z</mml:mi><mml:mrow><mml:mi>l</mml:mi><mml:mo>&#x02212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msup><mml:mo stretchy='false'>)</mml:mo><mml:mo stretchy='false'>)</mml:mo><mml:mo>+</mml:mo><mml:msup><mml:mi>z</mml:mi><mml:mrow><mml:mi>l</mml:mi><mml:mo>&#x02212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msup><mml:mo>,</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:mtext>&#x000A0;&#x000A0;</mml:mtext><mml:msup><mml:mi>z</mml:mi><mml:mi>l</mml:mi></mml:msup><mml:mo>=</mml:mo><mml:mi>M</mml:mi><mml:mi>L</mml:mi><mml:mi>P</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:mi>L</mml:mi><mml:mi>N</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:msubsup><mml:mi>z</mml:mi><mml:mi>m</mml:mi><mml:mi>l</mml:mi></mml:msubsup><mml:mo stretchy='false'>)</mml:mo><mml:mo stretchy='false'>)</mml:mo><mml:mo>+</mml:mo><mml:msup><mml:mi>z</mml:mi><mml:mi>l</mml:mi></mml:msup><mml:mo>,</mml:mo><mml:mi>l</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:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow></mml:math></disp-formula>
<p>where <inline-formula><mml:math id="M14"><mml:msubsup><mml:mrow><mml:mi>z</mml:mi></mml:mrow><mml:mrow><mml:mi>m</mml:mi></mml:mrow><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> represent the output of multi-head self-attention, <italic>z</italic><sup><italic>l</italic></sup> represent the output of MLP.</p>
<p>Corresponding to the encoder, a symmetric decoder is constructed based on the swin transformer, forming an encoder-decoder based on the u-net architecture.To recover the spatial order, we use a convolution module and upsampling to form a Decoder layer. In the first layer the hidden features are first decoded by bilinear upsampling of the input features (<inline-formula><mml:math id="M15"><mml:mfrac><mml:mrow><mml:mi>H</mml:mi></mml:mrow><mml:mrow><mml:mn>16</mml:mn></mml:mrow></mml:mfrac><mml:mo>&#x000D7;</mml:mo><mml:mfrac><mml:mrow><mml:mi>W</mml:mi></mml:mrow><mml:mrow><mml:mn>16</mml:mn></mml:mrow></mml:mfrac><mml:mo>&#x000D7;</mml:mo><mml:mn>4</mml:mn><mml:mi>C</mml:mi></mml:math></inline-formula>).And then implement dimension transformation in the convolution module. A linear layer is applied to map the dimensions to 2C, then the resolution is extended to <inline-formula><mml:math id="M16"><mml:mfrac><mml:mrow><mml:mi>H</mml:mi></mml:mrow><mml:mrow><mml:mn>8</mml:mn></mml:mrow></mml:mfrac><mml:mo>&#x000D7;</mml:mo><mml:mfrac><mml:mrow><mml:mi>W</mml:mi></mml:mrow><mml:mrow><mml:mn>8</mml:mn></mml:mrow></mml:mfrac></mml:math></inline-formula>, and finally the output feature (<inline-formula><mml:math id="M17"><mml:mfrac><mml:mrow><mml:mi>H</mml:mi></mml:mrow><mml:mrow><mml:mn>8</mml:mn></mml:mrow></mml:mfrac><mml:mo>&#x000D7;</mml:mo><mml:mfrac><mml:mrow><mml:mi>W</mml:mi></mml:mrow><mml:mrow><mml:mn>8</mml:mn></mml:mrow></mml:mfrac><mml:mo>&#x000D7;</mml:mo><mml:mn>2</mml:mn><mml:mi>C</mml:mi></mml:math></inline-formula>) is fed into the next Decoder layer. Bilinear up-sampling operation can ensure the same dimensions before and after the fusion, so that the fusion and feature mapping under the same dimension can be carried out again. In addition, Decoder decodes hidden features while further predicting the semantic output of the global context representation.</p>
</sec>
<sec>
<title>3.2.3. Supervise fusion module</title>
<p>First, the output features of Swin transformer decoder are supervised by ground-truth and attention maps are generated by Supervised Attention (Zamir et al., <xref ref-type="bibr" rid="B53">2021</xref>) to assist the delivery of useful features and effectively preserve the original features of the image. Next, we introduce residual blocks to learn deeper features. Inspired by Kim et al. (<xref ref-type="bibr" rid="B26">2016</xref>), we use recursion to unfold the residual block by calling the residual block 5 times, with both input and output channels of 64 and a convolution kernel size of 3 &#x000D7; 3. In addition, a skip connection is used in the residual block to connect the input and output, which is then passed to the next residual block as input. The calculation formula is as follows:</p>
<disp-formula id="E8"><label>(8)</label><mml:math id="M18"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:mtable style="text-align:axis;" equalrows="false" columnlines="none" equalcolumns="false" class="array"><mml:mtr><mml:mtd><mml:msub><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>-</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>&#x0002B;</mml:mo><mml:mi>R</mml:mi><mml:mi>e</mml:mi><mml:mi>L</mml:mi><mml:mi>U</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>-</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mi>w</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>-</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>where <italic>x</italic><sub><italic>i</italic></sub> is the output of the current residual block, <italic>x</italic><sub><italic>i</italic>&#x02212;1</sub> is the output of the last residual block, ReLU is the activation function, which can effectively improve the accuracy of the model.</p>
</sec>
</sec>
<sec>
<title>3.3. Loss function</title>
<p>The aim of our training is to recover clear images with low-level and high-level features from fogged images. In order to obtain high quality images, we use a combined loss function for optimization during the training process. Therefore, given a training dataset <inline-formula><mml:math id="M19"><mml:mrow><mml:msubsup><mml:mrow><mml:mrow><mml:mo>{</mml:mo> <mml:mrow><mml:mrow><mml:mrow><mml:msubsup><mml:mi>R</mml:mi><mml:mi>T</mml:mi><mml:mi>n</mml:mi></mml:msubsup><mml:mo>,</mml:mo><mml:msup><mml:mi>G</mml:mi><mml:mi>n</mml:mi></mml:msup></mml:mrow> <mml:mo>}</mml:mo></mml:mrow></mml:mrow> </mml:mrow></mml:mrow><mml:mi>n</mml:mi><mml:mi>N</mml:mi></mml:msubsup></mml:mrow></mml:math></inline-formula> for T-stage, we solve</p>
<disp-formula id="E9"><label>(9)</label><mml:math id="M20"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:mtable style="text-align:axis;" equalrows="false" columnlines="none" equalcolumns="false" class="array"><mml:mtr><mml:mtd><mml:mi>L</mml:mi><mml:mo>=</mml:mo><mml:mstyle displaystyle="true"><mml:munderover accentunder="false" accent="false"><mml:mrow><mml:mo>&#x02211;</mml:mo></mml:mrow><mml:mrow><mml:mi>T</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:munderover></mml:mstyle><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:mi>&#x003B1;</mml:mi><mml:msub><mml:mrow><mml:mi>L</mml:mi></mml:mrow><mml:mrow><mml:mi>C</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msubsup><mml:mrow><mml:mi>R</mml:mi></mml:mrow><mml:mrow><mml:mi>T</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msubsup><mml:mo>,</mml:mo><mml:msup><mml:mrow><mml:mi>G</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msup></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>&#x0002B;</mml:mo><mml:mi>&#x003B2;</mml:mi><mml:msub><mml:mrow><mml:mi>L</mml:mi></mml:mrow><mml:mrow><mml:mi>S</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msubsup><mml:mrow><mml:mi>R</mml:mi></mml:mrow><mml:mrow><mml:mi>T</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msubsup><mml:mo>,</mml:mo><mml:msup><mml:mrow><mml:mi>G</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msup></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo>}</mml:mo></mml:mrow><mml:mo>,</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>where <inline-formula><mml:math id="M21"><mml:msubsup><mml:mrow><mml:mi>R</mml:mi></mml:mrow><mml:mrow><mml:mi>T</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> is the outputs of stage T, and <italic>G</italic><sup><italic>n</italic></sup> represents the ground-truth images. The loss coefficients of &#x003B1; and &#x003B2; are set to 0.2 and 4. And <italic>L</italic><sub><italic>C</italic></sub> is the Charbonnier loss (Charbonnier et al., <xref ref-type="bibr" rid="B10">1994</xref>), used to calculate the pixel loss between the predicted image and the ground truth. In addition, <inline-formula><mml:math id="M22"><mml:msub><mml:mrow><mml:mi>L</mml:mi></mml:mrow><mml:mrow><mml:mi>S</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msubsup><mml:mrow><mml:mi>R</mml:mi></mml:mrow><mml:mrow><mml:mi>T</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msubsup><mml:mo>,</mml:mo><mml:msup><mml:mrow><mml:mi>G</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msup></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:math></inline-formula> is the structural similarity loss (Wang et al., <xref ref-type="bibr" rid="B46">2004</xref>), which is used to evaluate the structural similarity of the content of the two images. To avoid images suffering from distortion and low peak signal-to-noise ratio (PSNR), Ren et al. (<xref ref-type="bibr" rid="B41">2019</xref>) uses negative SSIM loss in an image recovery task and demonstrates the effectiveness of this loss on PSNR, SSIM and visual.</p>
</sec>
</sec>
<sec id="s4">
<title>4. Experimental results</title>
<p>In this section, we first present the training details and evaluation metrics. Then, our method is compared qualitatively and quantitatively with advanced methods on multiple datasets. Finally, we conduct ablation experiments.</p>
<sec>
<title>4.1. Experimental setup</title>
<p>The RESIDE dataset (Li et al., <xref ref-type="bibr" rid="B28">2018</xref>) is a large-scale benchmark including synthetic images and real-world blurred images. The RESIDE is composed of five sub-data sets: Indoor Training Set (ITS), Outdoor Training Set (OTS), Synthetic Objective Testing Set (SOTS), Real-world Task-driven Testing Set (RTTS) and Hybrid Subjective Testing Set (HSTS) constitute. We selected 20,000 pairs and 500 pairs from SOTS as outdoor scene training set and outdoor scene test set respectively, and 2,000 pairs of real blurred images from RTTS for testing. In addition to the RESIDE dataset, we also conducted experiments on another publicly available dataset. O-HAZE (Ancuti et al., <xref ref-type="bibr" rid="B3">2018</xref>) is an outdoor scene dataset proposed by NTIRE2018 Image Dehazing Challenge, including 45 pairs of real foggy images and corresponding fog-free images. These fogged images are taken by professional haze instruments, which can well record the same visual content under fog-free and fogged conditions. We choose 35 pairs as the training set, 5 pairs as the validation set, and 5 pairs as the test set.</p>
<p>Our network was trained on an Ubuntu environment, using the ADAM (Kingma and Ba, <xref ref-type="bibr" rid="B27">2014</xref>) optimizer and on an NVIDIA RTX2080ti GPUs. The training was performed using the Pytorch framework. The initial learning rate was set to 3 &#x000D7; 10<sup>&#x02212;5</sup> and gradually decreases to 1 &#x000D7; 10<sup>&#x02212;6</sup>. The network was trained for 50 epochs, and the input image size was 512 &#x000D7; 512 &#x000D7; 3.</p>
<p>In order to evaluate the image quality of single image defogging and compare it with other methods. We used the two most commonly used evaluation metrics in defogging methods: Peak Signal to Noise Ratio (PSNR) and structural similarity (SSIM). PSNR is a pixel-level image quality evaluation method used to measure the difference of gray values between two images. The higher the PSNR value,the lower the distortion between the evaluated image and the ground-truth image, and the better the quality; on the contrary, the poorer the quality. SSIM is a measure of covariance to determine the degree of structural similarity between images according to the degree of correlation between image pixels. The higher SSIM value, the more structure or color information the image retains, and the better the effect of the resulting image. What&#x00027;s more, we use the scikit-image library of python to calculation them. In addition, since there is no ground-truth image in real-world datasets, we use Fog Aware Density Evaluator (FADE) (Choi et al., <xref ref-type="bibr" rid="B15">2015</xref>) to evaluate the haze density of the restored image. We also adopted the non-reference blind image quality evaluation indicators, NIQE (Mittal et al., <xref ref-type="bibr" rid="B38">2012</xref>). NIQE is used to normalize the image contrast into blocks, and determine the image quality by calculating the average value of the local contrast of each block.</p>
</sec>
<sec>
<title>4.2. Image dehazing results</title>
<p>We evaluated the defogging results objectively and subjectively on different datasets, and compared the proposed defogging method with seven state-of-the-art methods, namely, MSCNN, AOD-Net, GCANet (Chen et al., <xref ref-type="bibr" rid="B11">2019</xref>), MSBDN, FFA-Net, TDN (Chen et al., <xref ref-type="bibr" rid="B14">2020</xref>), PMHLD (Liu et al., <xref ref-type="bibr" rid="B33">2020a</xref>), DCNet (Bhola et al., <xref ref-type="bibr" rid="B7">2021</xref>), and SSDN (Huang et al., <xref ref-type="bibr" rid="B23">2021</xref>).</p>
<sec>
<title>4.2.1. Subjective evaluation</title>
<p>We selected outdoor synthetic and real fogged images from the RESIDE dataset for testing, and combined our method with seven advanced methods. In addition, to verify the effectiveness of our network, we also selected real fog images from the O-HAZE dataset for testing, and selected three of them for comparison and presentation. The original fogged images, ground truth and the defogging results using 8 methods are shown in <xref ref-type="fig" rid="F5">Figures 5</xref>&#x02013;<bold>8</bold>.</p>
<fig id="F5" position="float">
<label>Figure 5</label>
<caption><p>Visual results on the SOTS dataset. Best viewed on a high-resolution display.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fnbot-16-1084543-g0005.tif"/>
</fig>
<p>In <xref ref-type="fig" rid="F5">Figure 5</xref>, the top row shows the input fog image. It can be seen that MSCNN, AOD-Net and DCNet are not ideal in a slightly complex environment, and the restored colors are not bright enough. The GCA, TDN and SSDN methods have the problems of color difference, color spot and color oversaturation. MSBDN, FFA-Net, PMHLD and our methods are relatively close to the real ground images, but MSBDN and FFA-Net are not satisfactory in restoring remote scenes, while PMHLD produces color differences in the sky of column 1 and column 2. In contrast, our method performs better in color and detail in complex environments. For example, our method removes the haze around people in the fourth and fifth columns more thoroughly.</p>
<p><xref ref-type="fig" rid="F6">Figure 6</xref> shows the demisting effects of different methods in the O-HAZE dataset. In the first two layers, the fog removal effect under the mist is displayed. MSCNN, AOD-Net, MSBDN, and FFA-Net not only did not remove the influence of haze, but also deepened the blurriness of the scene and made the overall color darker. Although GCANet and PMHLD reduce the fogging effect, the color of the image itself is affected, and the overall brightness of the output image is low. TDN, SSDN and our method generate more visible results with more significant demisting effect and clearer texture details.</p>
<fig id="F6" position="float">
<label>Figure 6</label>
<caption><p>Visual results on the O-HAZE dataset. Best viewed on a high-resolution display.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fnbot-16-1084543-g0006.tif"/>
</fig>
<p><xref ref-type="fig" rid="F7">Figures 7</xref>, <xref ref-type="fig" rid="F8">8</xref> show the demisting effect of real scenes at different shooting distances. In these two images, the overall brightness of the images restored by MSCNN, GCA-Net, and DCNet is low, such as a large area of dark areas in the sky. The overall color of TDN, MSBDN, and FFA Net is not bright enough, and the distant scenes are not well recovered. SSDN and our method restore relatively complete details, but in the first scene, SSDN is blurred in the vegetation (red box area), and our details processing is more prominent. Compared with these advanced methods, PMHLD and our methods have more realistic details and better visibility in the restored images.</p>
<fig id="F7" position="float">
<label>Figure 7</label>
<caption><p>Visual quality comparison on real mist images.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fnbot-16-1084543-g0007.tif"/>
</fig>
<fig id="F8" position="float">
<label>Figure 8</label>
<caption><p>Visual quality comparison on real dense fog images.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fnbot-16-1084543-g0008.tif"/>
</fig>
<p>In summary, our method is visually outstanding in both synthetic and real scenes, and the recovered images are more thoroughly defogged and have clearer details such as color textures.</p>
</sec>
<sec>
<title>4.2.2. Objective evaluation</title>
<p>In the previous section we evaluated the images after defogging through visual effects.In this section, we provide an objective analysis of several methods using two different quality evaluation metrics, PSNR and SSIM. We count the data metrics averaged over the RESIDE dataset and the O-HAZE dataset for each method and visualize them. In addition, we also show the values of SSIM and PSNR metrics for several images in <xref ref-type="fig" rid="F5">Figure 5</xref>. It can be found that the PSNR values of our method are much higher than the other methods, which indicates that the less distortion and better quality between the images processed by our method and the ground-truth images. As can be observed in <xref ref-type="table" rid="T1">Table 1</xref>: our method outperforms all SOTA methods with SSIM and PSNR of 0.9438 and 33.2523 dB on the RESIDE dataset. It is intuitively seen in <xref ref-type="fig" rid="F1">Figure 1</xref> that our method significantly outperforms other methods in two metrics. In addition, the O-HAZE dataset outperforms the other methods with 0.8758dB and 24.1986dB. Compared with the RESIDE dataset, the haze in this dataset is more dense, the image quality degrades more seriously, and the defogging is more difficult, which further confirms the effectiveness of our method in a dense fog environment.</p>
<table-wrap position="float" id="T1">
<label>Table 1</label>
<caption><p>Quantitatively compare the dehazing results with SOTA methods on the RESIDE and O-HAZE datasets.</p></caption>
<table frame="hsides" rules="groups">
<thead><tr>
<th valign="top" align="left"><bold>Method</bold></th>
<th valign="top" align="center" colspan="2" style="border-bottom: thin solid #000000;"><bold>SOTS</bold></th>
<th valign="top" align="center" colspan="2" style="border-bottom: thin solid #000000;"><bold>O-HAZE</bold></th>
</tr>
<tr>
<th/>
</tr>
<tr>
<th/>
<th valign="top" align="center"><bold>SSIM</bold></th>
<th valign="top" align="center"><bold>PSNR</bold></th>
<th valign="top" align="center"><bold>SSIM</bold></th>
<th valign="top" align="center"><bold>PSNR</bold></th>
</tr>
</thead>
<tbody> <tr>
<td valign="top" align="left">MSCNN</td>
<td valign="top" align="center">0.8436</td>
<td valign="top" align="center">19.49</td>
<td valign="top" align="center">0.7359</td>
<td valign="top" align="center">18.93</td>
</tr>
<tr>
<td valign="top" align="left">AOD-Net</td>
<td valign="top" align="center">0.8747</td>
<td valign="top" align="center">22.31</td>
<td valign="top" align="center">0.6724</td>
<td valign="top" align="center">18.19</td>
</tr>
<tr>
<td valign="top" align="left">GCANet</td>
<td valign="top" align="center">0.9151</td>
<td valign="top" align="center">22.89</td>
<td valign="top" align="center">0.6633</td>
<td valign="top" align="center">15.77</td>
</tr>
<tr>
<td valign="top" align="left">MSBDN</td>
<td valign="top" align="center">0.9068</td>
<td valign="top" align="center">28.64</td>
<td valign="top" align="center">0.6378</td>
<td valign="top" align="center">18.46</td>
</tr>
<tr>
<td valign="top" align="left">FFA-Net</td>
<td valign="top" align="center" style="color:#2e3092">0.9422</td>
<td valign="top" align="center" style="color:#2e3092">31.31</td>
<td valign="top" align="center">0.6792</td>
<td valign="top" align="center">18.07</td>
</tr>
<tr>
<td valign="top" align="left">TDN</td>
<td valign="top" align="center">0.7857</td>
<td valign="top" align="center">17.38</td>
<td valign="top" align="center">0.7286</td>
<td valign="top" align="center">19.41</td>
</tr>
<tr>
<td valign="top" align="left">PMHLD</td>
<td valign="top" align="center">0.8276</td>
<td valign="top" align="center">23.81</td>
<td valign="top" align="center">0.4839</td>
<td valign="top" align="center">14.40</td>
</tr>
<tr>
<td valign="top" align="left">DCNet</td>
<td valign="top" align="center">0.8343</td>
<td valign="top" align="center">19.47</td>
<td valign="top" align="center">0.7028</td>
<td valign="top" align="center">20.74</td>
</tr>
<tr>
<td valign="top" align="left">SSDN</td>
<td valign="top" align="center">0.8852</td>
<td valign="top" align="center">21.11</td>
<td valign="top" align="center" style="color:#2e3092">0.7789</td>
<td valign="top" align="center" style="color:#ee1c23">25.71</td>
</tr> <tr style="border-top: thin solid #000000;">
<td valign="top" align="left"><bold>Ours</bold></td>
<td valign="top" align="center" style="color:#ee1c23">0.9439</td>
<td valign="top" align="center" style="color:#ee1c23">33.25</td>
<td valign="top" align="center" style="color:#ee1c23">0.8758</td>
<td valign="top" align="center" style="color:#2e3092">24.19</td>
</tr>
</tbody>
</table>
<table-wrap-foot>
<p>Best and second best scores are red and blue. The table shows the average of the data.</p>
</table-wrap-foot>
</table-wrap>
<p><xref ref-type="table" rid="T2">Table 2</xref> shows the objective indicators and time comparison of all methods on RTTS. NIQE, and BRISQUE evaluated the overall quality of the image. Our method obtained the best results of NIQE, indicating that the results in this paper have excellent colors and details. In terms of FADE metric, our method obtained suboptimal, while PMHLD obtained the optimal FADE value. This is inseparable from the effective haze removal of PMHLD. In terms of time, our method has only achieved the fourth place, not outstanding in efficiency.</p>
<table-wrap position="float" id="T2">
<label>Table 2</label>
<caption><p>Quantitative and efficiency comparison in RTTS dataset.</p></caption>
<table frame="hsides" rules="groups">
<thead><tr>
<th valign="top" align="left"><bold>Method</bold></th>
<th valign="top" align="center"><bold>NIQE</bold></th>
<th valign="top" align="center"><bold>FADE</bold></th>
<th valign="top" align="center"><bold>Runtimes</bold></th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">MSCNN</td>
<td valign="top" align="center">3.2499</td>
<td valign="top" align="center">1.1716</td>
<td valign="top" align="center">2.3356</td>
</tr>
<tr>
<td valign="top" align="left">AOD-Net</td>
<td valign="top" align="center">3.4439</td>
<td valign="top" align="center">1.4342</td>
<td valign="top" align="center">0.1904</td>
</tr>
<tr>
<td valign="top" align="left">GCANet</td>
<td valign="top" align="center">3.2615</td>
<td valign="top" align="center">1.0135</td>
<td valign="top" align="center" style="color:#2e3092">0.0821</td>
</tr>
<tr>
<td valign="top" align="left">MSBDN</td>
<td valign="top" align="center">3.4248</td>
<td valign="top" align="center">1.5211</td>
<td valign="top" align="center" style="color:#ee1c23">0.0394</td>
</tr>
<tr>
<td valign="top" align="left">FFA-Net</td>
<td valign="top" align="center">3.4515</td>
<td valign="top" align="center">2.0205</td>
<td valign="top" align="center">0.6561</td>
</tr>
<tr>
<td valign="top" align="left">TDN</td>
<td valign="top" align="center">3.3356</td>
<td valign="top" align="center">0.9217</td>
<td valign="top" align="center">0.8767</td>
</tr>
<tr>
<td valign="top" align="left">PMHLD</td>
<td valign="top" align="center" style="color:#2e3092">3.2254</td>
<td valign="top" align="center" style="color:#ee1c23">0.7240</td>
<td valign="top" align="center">0.3321</td>
</tr>
<tr>
<td valign="top" align="left">DCNet</td>
<td valign="top" align="center">3.4188</td>
<td valign="top" align="center">1.2886</td>
<td valign="top" align="center">0.1725</td>
</tr>
<tr>
<td valign="top" align="left">SSDN</td>
<td valign="top" align="center">3.3756</td>
<td valign="top" align="center">1.8476</td>
<td valign="top" align="center">0.3357</td>
</tr> <tr style="border-top: thin solid #000000;">
<td valign="top" align="left">Ours</td>
<td valign="top" align="center" style="color:#ee1c23">3.1752</td>
<td valign="top" align="center" style="color:#2e3092">0.7873</td>
<td valign="top" align="center">0.4436</td>
</tr>
</tbody>
</table>
<table-wrap-foot>
<p>Color numbers indicate the best indicator value.</p>
</table-wrap-foot>
</table-wrap>
</sec>
</sec>
<sec>
<title>4.3. Ablation study</title>
<p>Our approach shares the same network parameters across multiple stages through the iterative idea of using recursive computation between stages. We speculate that the defogging effect of the model will change with the increase of the number of iterations, so it is crucial to determine the optimal number of iterations.We hypothesize that the defogging effect of the model varies with the number of iterations, so it is crucial to determine the optimal number of iterations. We trained the model using iterations 1&#x02013;6 under the RESIDE dataset, and <xref ref-type="fig" rid="F9">Figure 9</xref> shows the effect of image defogging under different iterations. The visual effects were similar from the 3rd to the 5th iteration, so we made an objective evaluation of these iterations. According to the comparison of PSNR and SSIM in <xref ref-type="table" rid="T3">Table 3</xref>, we found that the metrics of the third iteration and the fourth iteration were slightly lower, while the metrics of the fifth iteration and the sixth iteration were similar. By comparing the time, we choose the fifth iteration as the optimal number of iterations.</p>
<fig id="F9" position="float">
<label>Figure 9</label>
<caption><p>Single image defogging image obtained in different iterations.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fnbot-16-1084543-g0009.tif"/>
</fig>
<table-wrap position="float" id="T3">
<label>Table 3</label>
<caption><p> Use outdoor synthetic images to test models with different iteration times, use PSNR, SSIM, and TIME for comparison.</p></caption>
<table frame="hsides" rules="groups">
<thead><tr>
<th/>
<th valign="top" align="center"><bold>SSIM</bold></th>
<th valign="top" align="center"><bold>PSNR</bold></th>
<th valign="top" align="center"><bold>TIME</bold></th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">Iteration=3</td>
<td valign="top" align="center">0.9289</td>
<td valign="top" align="center">32.71</td>
<td valign="top" align="center">0.3354</td>
</tr>
<tr>
<td valign="top" align="left">Iteration=4</td>
<td valign="top" align="center">0.9356</td>
<td valign="top" align="center">33.14</td>
<td valign="top" align="center">0.3863</td>
</tr>
<tr>
<td valign="top" align="left">Iteration=5</td>
<td valign="top" align="center">0.9438</td>
<td valign="top" align="center">33.25</td>
<td valign="top" align="center">0.4436</td>
</tr>
<tr>
<td valign="top" align="left">Iteration=6</td>
<td valign="top" align="center">0.9438</td>
<td valign="top" align="center">33.28</td>
<td valign="top" align="center">0.4986</td>
</tr>
</tbody>
</table>
<table-wrap-foot>
<p>The value in the table is the average of all images.</p>
</table-wrap-foot>
</table-wrap>
</sec>
</sec>
<sec sec-type="conclusions" id="s5">
<title>5. Conclusion</title>
<p>In this paper, we propose a new transformer-based progressive residual network (PRnet). Our method recursively invokes the residual network to gradually recover clean images under ground-truth supervision. First of all, PRnet learns the features of the input images through recurrent block, while taking care of connecting the different stages to ensure that more original image features are retained during the multi-stage feature transfer of the model. We design a codec with u-net structure in combination with swin-transformer, which can ensure that sufficient contextual semantic information and spatial features are obtained during long-distance transmission. In addition, CSSI, which can ensure the synergy and connectivity of the transformer codec. Finally, the supervised fusion module can adaptively select and fuse the image features, and transfer the attention-guided features to the next stage.In addition, we demonstrate the effectiveness of the progressive network through experiments, and our model provides high-quality defogging on multiple data sets. Nonhomogeneous de-hazing is the next topic we would like to explore with our approach, as it is crucial to study complex foggy environments in real scenarios.</p>
</sec>
<sec sec-type="data-availability" id="s6">
<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 author.</p>
</sec>
<sec id="s7">
<title>Author contributions</title>
<p>All authors listed have made a substantial, direct, and intellectual contribution to the work and approved it for publication.</p>
</sec>
<sec sec-type="funding-information" id="s8">
<title>Funding</title>
<p>This research was supported by the National Natural Science Foundation of China (61772319, 62002200, 62202268, and 61972235) and Shandong Natural Science Foundation of China (ZR2021MF107 and ZR2022MA076).</p>
</sec>
<sec sec-type="COI-statement" id="conf1">
<title>Conflict of interest</title>
<p>Author ZY was employed by Intgrow Education Technology. The remaining 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 sec-type="disclaimer" id="s9">
<title>Publisher&#x00027;s note</title>
<p>All claims expressed in this article are solely those of the authors and do not necessarily represent those of their affiliated organizations, or those of the publisher, the editors and the reviewers. Any product that may be evaluated in this article, or claim that may be made by its manufacturer, is not guaranteed or endorsed by the publisher.</p>
</sec>
</body>
<back>
<ref-list>
<title>References</title>
<ref id="B1">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Afshar</surname> <given-names>P.</given-names></name> <name><surname>Heidarian</surname> <given-names>S.</given-names></name> <name><surname>Naderkhani</surname> <given-names>F.</given-names></name> <name><surname>Oikonomou</surname> <given-names>A.</given-names></name> <name><surname>Plataniotis</surname> <given-names>K. N.</given-names></name> <name><surname>Mohammadi</surname> <given-names>A.</given-names></name></person-group> (<year>2020</year>). <article-title>COVID-caps: a capsule network-based framework for identification of COVID-19 cases from x-ray images</article-title>. <source>Pattern Recognit Lett</source>. <volume>138</volume>, <fpage>638</fpage>&#x02013;<lpage>643</lpage>. <pub-id pub-id-type="doi">10.1016/j.patrec.2020.09.010</pub-id><pub-id pub-id-type="pmid">32958971</pub-id></citation></ref>
<ref id="B2">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Akbari</surname> <given-names>H.</given-names></name> <name><surname>Yuan</surname> <given-names>L.</given-names></name> <name><surname>Qian</surname> <given-names>R.</given-names></name> <name><surname>Chuang</surname> <given-names>W.-H.</given-names></name> <name><surname>Chang</surname> <given-names>S.-F.</given-names></name> <name><surname>Cui</surname> <given-names>Y.</given-names></name> <etal/></person-group>. (<year>2021</year>). <article-title>Vatt: transformers for multimodal self-supervised learning from raw video, audio and text</article-title>. <source>arXiv preprint arXiv:2104.11178</source>. <pub-id pub-id-type="doi">10.48550/arXiv.2104.11178</pub-id></citation>
</ref>
<ref id="B3">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Ancuti</surname> <given-names>C. O.</given-names></name> <name><surname>Ancuti</surname> <given-names>C.</given-names></name> <name><surname>Timofte</surname> <given-names>R.</given-names></name> <name><surname>De Vleeschouwer</surname> <given-names>C.</given-names></name></person-group> (<year>2018</year>). <article-title>&#x0201C;O-haze: a dehazing benchmark with real hazy and haze-free outdoor images,&#x0201D;</article-title> in <source>Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition Workshops</source> (<publisher-loc>Salt Lake City, UT</publisher-loc>: <publisher-name>IEEE</publisher-name>), <fpage>754</fpage>&#x02013;<lpage>762</lpage>.</citation>
</ref>
<ref id="B4">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Anvari</surname> <given-names>Z.</given-names></name> <name><surname>Athitsos</surname> <given-names>V.</given-names></name></person-group> (<year>2020</year>). <article-title>Dehaze-glcgan: unpaired single image de-hazing via adversarial training</article-title>. <source>arXiv preprint arXiv:2008.06632</source>. <pub-id pub-id-type="doi">10.48550/arXiv.2008.06632</pub-id></citation>
</ref>
<ref id="B5">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Berman</surname> <given-names>D.</given-names></name> <name><surname>Avidan</surname> <given-names>S.</given-names></name> <name><surname>Avidan</surname> <given-names>S.</given-names></name></person-group> (<year>2016</year>). <article-title>&#x0201C;Non-local image dehazing,&#x0201D;</article-title> in <source>Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition</source> (<publisher-loc>Las Vegas, NV</publisher-loc>: <publisher-name>IEEE</publisher-name>), <fpage>1674</fpage>&#x02013;<lpage>1682</lpage>.</citation>
</ref>
<ref id="B6">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Berman</surname> <given-names>D.</given-names></name> <name><surname>Treibitz</surname> <given-names>T.</given-names></name> <name><surname>Avidan</surname> <given-names>S.</given-names></name></person-group> (<year>2018</year>). <article-title>Single image dehazing using haze-lines</article-title>. <source>IEEE Trans. Pattern Anal. Mach. Intell</source>. <volume>42</volume>, <fpage>720</fpage>&#x02013;<lpage>734</lpage>. <pub-id pub-id-type="doi">10.1109/TPAMI.2018.2882478</pub-id><pub-id pub-id-type="pmid">30475710</pub-id></citation></ref>
<ref id="B7">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Bhola</surname> <given-names>A.</given-names></name> <name><surname>Sharma</surname> <given-names>T.</given-names></name> <name><surname>Verma</surname> <given-names>N. K.</given-names></name></person-group> (<year>2021</year>). <article-title>Dcnet: dark channel network for single-image dehazing</article-title>. <source>Mach. Vis. Appl</source>. <volume>32</volume>, <fpage>1</fpage>&#x02013;<lpage>11</lpage>. <pub-id pub-id-type="doi">10.1007/s00138-021-01173-x</pub-id></citation>
</ref>
<ref id="B8">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Cao</surname> <given-names>H.</given-names></name> <name><surname>Wang</surname> <given-names>Y.</given-names></name> <name><surname>Chen</surname> <given-names>J.</given-names></name> <name><surname>Jiang</surname> <given-names>D.</given-names></name> <name><surname>Zhang</surname> <given-names>X.</given-names></name> <name><surname>Tian</surname> <given-names>Q.</given-names></name> <etal/></person-group>. (<year>2021</year>). <article-title>Swin-unet: Unet-like pure transformer for medical image segmentation</article-title>. <source>arXiv preprint arXiv:2105.05537</source>. <pub-id pub-id-type="doi">10.48550/arXiv.2105.05537</pub-id></citation>
</ref>
<ref id="B9">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Carion</surname> <given-names>N.</given-names></name> <name><surname>Massa</surname> <given-names>F.</given-names></name> <name><surname>Synnaeve</surname> <given-names>G.</given-names></name> <name><surname>Usunier</surname> <given-names>N.</given-names></name> <name><surname>Kirillov</surname> <given-names>A.</given-names></name> <name><surname>Zagoruyko</surname> <given-names>S.</given-names></name></person-group> (<year>2020</year>). <article-title>&#x0201C;End-to-end object detection with transformers,&#x0201D;</article-title> in <source>European Conference on Computer Vision</source> (<publisher-loc>Glasgow</publisher-loc>: <publisher-name>Springer</publisher-name>), <fpage>213</fpage>&#x02013;<lpage>229</lpage>.<pub-id pub-id-type="pmid">36417746</pub-id></citation></ref>
<ref id="B10">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Charbonnier</surname> <given-names>P.</given-names></name> <name><surname>Blanc-Feraud</surname> <given-names>L.</given-names></name> <name><surname>Aubert</surname> <given-names>G.</given-names></name> <name><surname>Barlaud</surname> <given-names>M.</given-names></name></person-group> (<year>1994</year>). <article-title>&#x0201C;Two deterministic half-quadratic regularization algorithms for computed imaging,&#x0201D;</article-title> in <source>Proceedings of 1st International Conference on Image Processing, Vol. 2</source> (<publisher-loc>Austin, TX</publisher-loc>: <publisher-name>IEEE</publisher-name>), <fpage>168</fpage>&#x02013;<lpage>172</lpage>.</citation>
</ref>
<ref id="B11">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Chen</surname> <given-names>D.</given-names></name> <name><surname>He</surname> <given-names>M.</given-names></name> <name><surname>Fan</surname> <given-names>Q.</given-names></name> <name><surname>Liao</surname> <given-names>J.</given-names></name> <name><surname>Zhang</surname> <given-names>L.</given-names></name> <name><surname>Hou</surname> <given-names>D.</given-names></name> <etal/></person-group>. (<year>2019</year>). <article-title>&#x0201C;Gated context aggregation network for image dehazing and deraining,&#x0201D;</article-title> in <source>2019 IEEE Winter Conference on Applications of Computer Vision (WACV)</source> (<publisher-loc>Waikoloa, HI</publisher-loc>: <publisher-name>IEEE</publisher-name>), <fpage>1375</fpage>&#x02013;<lpage>1383</lpage>.</citation>
</ref>
<ref id="B12">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Chen</surname> <given-names>H.</given-names></name> <name><surname>Wang</surname> <given-names>Y.</given-names></name> <name><surname>Guo</surname> <given-names>T.</given-names></name> <name><surname>Xu</surname> <given-names>C.</given-names></name> <name><surname>Deng</surname> <given-names>Y.</given-names></name> <name><surname>Liu</surname> <given-names>Z.</given-names></name> <etal/></person-group>. (<year>2021a</year>). <article-title>&#x0201C;Pre-trained image processing transformer,&#x0201D;</article-title> in <source>Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition</source> (<publisher-loc>Nashville, TN</publisher-loc>: <publisher-name>IEEE</publisher-name>), <fpage>12299</fpage>&#x02013;<lpage>12310</lpage>.</citation>
</ref>
<ref id="B13">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Chen</surname> <given-names>J.</given-names></name> <name><surname>Lu</surname> <given-names>Y.</given-names></name> <name><surname>Yu</surname> <given-names>Q.</given-names></name> <name><surname>Luo</surname> <given-names>X.</given-names></name> <name><surname>Adeli</surname> <given-names>E.</given-names></name> <name><surname>Wang</surname> <given-names>Y.</given-names></name> <etal/></person-group>. (<year>2021b</year>). <article-title>Transunet: transformers make strong encoders for medical image segmentation</article-title>. <source>arXiv preprint arXiv:2102.04306</source>. <pub-id pub-id-type="doi">10.48550/arXiv.2102.04306</pub-id></citation>
</ref>
<ref id="B14">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Chen</surname> <given-names>W.-T.</given-names></name> <name><surname>Fang</surname> <given-names>H.-Y.</given-names></name> <name><surname>Ding</surname> <given-names>J.-J.</given-names></name> <name><surname>Kuo</surname> <given-names>S.-Y.</given-names></name></person-group> (<year>2020</year>). <article-title>Pmhld: patch map-based hybrid learning dehazenet for single image haze removal</article-title>. <source>IEEE Trans. Image Process</source>. <volume>29</volume>, <fpage>6773</fpage>&#x02013;<lpage>6788</lpage>. <pub-id pub-id-type="doi">10.1109/TIP.2020.2993407</pub-id></citation>
</ref>
<ref id="B15">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Choi</surname> <given-names>L. K.</given-names></name> <name><surname>You</surname> <given-names>J.</given-names></name> <name><surname>Bovik</surname> <given-names>A. C.</given-names></name></person-group> (<year>2015</year>). <article-title>Referenceless prediction of perceptual fog density and perceptual image defogging</article-title>. <source>IEEE Trans. Image Process</source>. <volume>24</volume>, <fpage>3888</fpage>&#x02013;<lpage>3901</lpage>. <pub-id pub-id-type="doi">10.1109/TIP.2015.2456502</pub-id><pub-id pub-id-type="pmid">26186784</pub-id></citation></ref>
<ref id="B16">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Dong</surname> <given-names>H.</given-names></name> <name><surname>Pan</surname> <given-names>J.</given-names></name> <name><surname>Xiang</surname> <given-names>L.</given-names></name> <name><surname>Hu</surname> <given-names>Z.</given-names></name> <name><surname>Zhang</surname> <given-names>X.</given-names></name> <name><surname>Wang</surname> <given-names>F.</given-names></name> <etal/></person-group>. (<year>2020</year>). <article-title>&#x0201C;Multi-scale boosted dehazing network with dense feature fusion,&#x0201D;</article-title> in <source>Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition</source> (<publisher-loc>Seattle, WA</publisher-loc>: <publisher-name>IEEE</publisher-name>), <fpage>2157</fpage>&#x02013;<lpage>2167</lpage>.</citation>
</ref>
<ref id="B17">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Dosovitskiy</surname> <given-names>A.</given-names></name> <name><surname>Beyer</surname> <given-names>L.</given-names></name> <name><surname>Kolesnikov</surname> <given-names>A.</given-names></name> <name><surname>Weissenborn</surname> <given-names>D.</given-names></name> <name><surname>Zhai</surname> <given-names>X.</given-names></name> <name><surname>Unterthiner</surname> <given-names>T.</given-names></name> <etal/></person-group>. (<year>2020</year>). <article-title>An image is worth 16x16 words: transformers for image recognition at scale</article-title>. <source>arXiv preprint arXiv</source>:2010.<italic>11929</italic>. <pub-id pub-id-type="doi">10.48550/arXiv.2010.11929</pub-id></citation>
</ref>
<ref id="B18">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>El Helou</surname> <given-names>M.</given-names></name> <name><surname>S&#x000FC;sstrunk</surname> <given-names>S.</given-names></name></person-group> (<year>2020</year>). <article-title>Blind universal bayesian image denoising with gaussian noise level learning</article-title>. <source>IEEE Trans. Image Process</source>. <volume>29</volume>, <fpage>4885</fpage>&#x02013;<lpage>4897</lpage>. <pub-id pub-id-type="doi">10.1109/TIP.2020.2976814</pub-id><pub-id pub-id-type="pmid">32149690</pub-id></citation></ref>
<ref id="B19">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Gao</surname> <given-names>J.</given-names></name> <name><surname>Gong</surname> <given-names>M.</given-names></name> <name><surname>Li</surname> <given-names>X.</given-names></name></person-group> (<year>2021</year>). <article-title>Congested crowd instance localization with dilated convolutional swin transformer</article-title>. <source>arXiv preprint arXiv:2108.00584</source>. <pub-id pub-id-type="doi">10.1016/j.neucom.2022.09.113</pub-id></citation>
</ref>
<ref id="B20">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>He</surname> <given-names>K.</given-names></name> <name><surname>Sun</surname> <given-names>J.</given-names></name> <name><surname>Tang</surname> <given-names>X.</given-names></name></person-group> (<year>2010</year>). <article-title>Single image haze removal using dark channel prior</article-title>. <source>IEEE Trans. Pattern Anal. Mach. Intell</source>. <volume>33</volume>, <fpage>2341</fpage>&#x02013;<lpage>2353</lpage>. <pub-id pub-id-type="doi">10.1109/TPAMI.2010.168</pub-id><pub-id pub-id-type="pmid">20820075</pub-id></citation></ref>
<ref id="B21">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Huang</surname> <given-names>L.</given-names></name> <name><surname>Tan</surname> <given-names>J.</given-names></name> <name><surname>Liu</surname> <given-names>J.</given-names></name> <name><surname>Yuan</surname> <given-names>J.</given-names></name></person-group> (<year>2020a</year>). <article-title>&#x0201C;Hand-transformer: non-autoregressive structured modeling for 3D hand pose estimation,&#x0201D;</article-title> in <source>European Conference on Computer Vision</source> (<publisher-loc>Glasgow</publisher-loc>: <publisher-name>Springer</publisher-name>), <fpage>17</fpage>&#x02013;<lpage>33</lpage>.</citation>
</ref>
<ref id="B22">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Huang</surname> <given-names>L.</given-names></name> <name><surname>Tan</surname> <given-names>J.</given-names></name> <name><surname>Meng</surname> <given-names>J.</given-names></name> <name><surname>Liu</surname> <given-names>J.</given-names></name> <name><surname>Yuan</surname> <given-names>J.</given-names></name></person-group> (<year>2020b</year>). <article-title>&#x0201C;Hot-net: non-autoregressive transformer for 3D hand-object pose estimation,&#x0201D;</article-title> in <source>Proceedings of the 28th ACM International Conference on Multimedia</source> (<publisher-loc>Seattle</publisher-loc>), <fpage>3136</fpage>&#x02013;<lpage>3145</lpage>.</citation>
</ref>
<ref id="B23">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Huang</surname> <given-names>P.</given-names></name> <name><surname>Zhao</surname> <given-names>L.</given-names></name> <name><surname>Jiang</surname> <given-names>R.</given-names></name> <name><surname>Wang</surname> <given-names>T.</given-names></name> <name><surname>Zhang</surname> <given-names>X.</given-names></name></person-group> (<year>2021</year>). <article-title>Self-filtering image dehazing with self-supporting module</article-title>. <source>Neurocomputing</source> <volume>432</volume>, <fpage>57</fpage>&#x02013;<lpage>69</lpage>. <pub-id pub-id-type="doi">10.1016/j.neucom.2020.11.039</pub-id></citation>
</ref>
<ref id="B24">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Huang</surname> <given-names>Z.</given-names></name> <name><surname>Li</surname> <given-names>J.</given-names></name> <name><surname>Hua</surname> <given-names>Z.</given-names></name> <name><surname>Fan</surname> <given-names>L.</given-names></name></person-group> (<year>2022</year>). <article-title>Underwater image enhancement via adaptive group attention-based multiscale cascade transformer</article-title>. <source>IEEE Trans. Instrum. Meas</source>. <volume>71</volume>, <fpage>1</fpage>&#x02013;<lpage>18</lpage>. <pub-id pub-id-type="doi">10.1109/TIM.2022.3189630</pub-id></citation>
</ref>
<ref id="B25">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Kar</surname> <given-names>A.</given-names></name> <name><surname>Dhara</surname> <given-names>S. K.</given-names></name> <name><surname>Sen</surname> <given-names>D.</given-names></name> <name><surname>Biswas</surname> <given-names>P. K.</given-names></name></person-group> (<year>2020</year>). <article-title>Transmission map and atmospheric light guided iterative updater network for single image dehazing</article-title>. <source>arXiv preprint arXiv:2008.01701</source>. <pub-id pub-id-type="doi">10.48550/arXiv.2008.01701</pub-id></citation>
</ref>
<ref id="B26">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Kim</surname> <given-names>J.</given-names></name> <name><surname>Lee</surname> <given-names>J. K.</given-names></name> <name><surname>Lee</surname> <given-names>K. M.</given-names></name></person-group> (<year>2016</year>). <article-title>&#x0201C;Deeply-recursive convolutional network for image super-resolution,&#x0201D;</article-title> in <source>Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition</source> (<publisher-loc>Las Vegas, NV</publisher-loc>: <publisher-name>IEEE</publisher-name>), <fpage>1637</fpage>&#x02013;<lpage>1645</lpage>.</citation>
</ref>
<ref id="B27">
<citation citation-type="journal"><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>2014</year>). <article-title>Adam: a method for stochastic optimization</article-title>. <source>arXiv preprint arXiv:1412.6980</source>. <pub-id pub-id-type="doi">10.48550/arXiv.1412.6980</pub-id></citation>
</ref>
<ref id="B28">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Li</surname> <given-names>B.</given-names></name> <name><surname>Ren</surname> <given-names>W.</given-names></name> <name><surname>Fu</surname> <given-names>D.</given-names></name> <name><surname>Tao</surname> <given-names>D.</given-names></name> <name><surname>Feng</surname> <given-names>D.</given-names></name> <name><surname>Zeng</surname> <given-names>W.</given-names></name> <etal/></person-group>. (<year>2018</year>). <article-title>Benchmarking single-image dehazing and beyond</article-title>. <source>IEEE Trans. Image Process</source>. <volume>28</volume>, <fpage>492</fpage>&#x02013;<lpage>505</lpage>. <pub-id pub-id-type="doi">10.1109/TIP.2018.2867951</pub-id><pub-id pub-id-type="pmid">30176593</pub-id></citation></ref>
<ref id="B29">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Li</surname> <given-names>J.</given-names></name> <name><surname>Feng</surname> <given-names>X.</given-names></name> <name><surname>Hua</surname> <given-names>Z.</given-names></name></person-group> (<year>2021</year>). <article-title>Low-light image enhancement via progressive-recursive network</article-title>. <source>IEEE Trans. Circ. Syst. Video Technol</source>. <volume>31</volume>, <fpage>4227</fpage>&#x02013;<lpage>4240</lpage>. <pub-id pub-id-type="doi">10.1109/TCSVT.2021.3049940</pub-id><pub-id pub-id-type="pmid">30998467</pub-id></citation></ref>
<ref id="B30">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Liang</surname> <given-names>J.</given-names></name> <name><surname>Cao</surname> <given-names>J.</given-names></name> <name><surname>Sun</surname> <given-names>G.</given-names></name> <name><surname>Zhang</surname> <given-names>K.</given-names></name> <name><surname>Van Gool</surname> <given-names>L.</given-names></name> <name><surname>Timofte</surname> <given-names>R.</given-names></name></person-group> (<year>2021</year>). <article-title>Swinir: image restoration using swin transformer</article-title>. <source>arXiv preprint arXiv:2108.10257</source>. <pub-id pub-id-type="doi">10.1109/ICCVW54120.2021.00210</pub-id></citation>
</ref>
<ref id="B31">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Lin</surname> <given-names>A.</given-names></name> <name><surname>Chen</surname> <given-names>B.</given-names></name> <name><surname>Xu</surname> <given-names>J.</given-names></name> <name><surname>Zhang</surname> <given-names>Z.</given-names></name> <name><surname>Lu</surname> <given-names>G.</given-names></name></person-group> (<year>2021a</year>). <article-title>Ds-transunet: dual swin transformer u-net for medical image segmentation</article-title>. <source>arXiv preprint arXiv:2106.06716</source>. <pub-id pub-id-type="doi">10.1109/TIM.2022.3178991</pub-id></citation>
</ref>
<ref id="B32">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Lin</surname> <given-names>K.</given-names></name> <name><surname>Wang</surname> <given-names>L.</given-names></name> <name><surname>Liu</surname> <given-names>Z.</given-names></name></person-group> (<year>2021b</year>). <article-title>&#x0201C;End-to-end human pose and mesh reconstruction with transformers,&#x0201D;</article-title> in <source>Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition</source> (<publisher-loc>Nashville, TN</publisher-loc>: <publisher-name>IEEE</publisher-name>), <fpage>1954</fpage>&#x02013;<lpage>1963</lpage>.</citation>
</ref>
<ref id="B33">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Liu</surname> <given-names>J.</given-names></name> <name><surname>Wu</surname> <given-names>H.</given-names></name> <name><surname>Xie</surname> <given-names>Y.</given-names></name> <name><surname>Qu</surname> <given-names>Y.</given-names></name> <name><surname>Ma</surname> <given-names>L.</given-names></name></person-group> (<year>2020a</year>). <article-title>&#x0201C;Trident dehazing network,&#x0201D;</article-title> in <source>Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops</source> (<publisher-loc>Seattle, WA</publisher-loc>: <publisher-name>IEEE</publisher-name>), <fpage>430</fpage>&#x02013;<lpage>431</lpage>.</citation>
</ref>
<ref id="B34">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Liu</surname> <given-names>Q.</given-names></name> <name><surname>Qin</surname> <given-names>Y.</given-names></name> <name><surname>Xie</surname> <given-names>Z.</given-names></name> <name><surname>Cao</surname> <given-names>Z.</given-names></name> <name><surname>Jia</surname> <given-names>L.</given-names></name></person-group> (<year>2020b</year>). <article-title>An efficient residual-based method for railway image dehazing</article-title>. <source>Sensors</source> <volume>20</volume>, <fpage>6204</fpage>. <pub-id pub-id-type="doi">10.3390/s20216204</pub-id><pub-id pub-id-type="pmid">33143354</pub-id></citation></ref>
<ref id="B35">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Liu</surname> <given-names>X.</given-names></name> <name><surname>Ma</surname> <given-names>Y.</given-names></name> <name><surname>Shi</surname> <given-names>Z.</given-names></name> <name><surname>Chen</surname> <given-names>J.</given-names></name></person-group> (<year>2019</year>). <article-title>&#x0201C;Griddehazenet: Attention-based multi-scale network for image dehazing,&#x0201D;</article-title> in <source>Proceedings of the IEEE/CVF International Conference on Computer Vision</source> (<publisher-loc>Seoul</publisher-loc>: <publisher-name>IEEE</publisher-name>), <fpage>7314</fpage>&#x02013;<lpage>7323</lpage>.</citation>
</ref>
<ref id="B36">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Liu</surname> <given-names>Z.</given-names></name> <name><surname>Lin</surname> <given-names>Y.</given-names></name> <name><surname>Cao</surname> <given-names>Y.</given-names></name> <name><surname>Hu</surname> <given-names>H.</given-names></name> <name><surname>Wei</surname> <given-names>Y.</given-names></name> <name><surname>Zhang</surname> <given-names>Z.</given-names></name> <etal/></person-group>. (<year>2021</year>). <article-title>Swin transformer: Hierarchical vision transformer using shifted windows</article-title>. <source>arXiv preprint arXiv:2103.14030</source>. <pub-id pub-id-type="doi">10.1109/ICCV48922.2021.00986</pub-id></citation>
</ref>
<ref id="B37">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Middleton</surname> <given-names>W. E. K.</given-names></name></person-group> (<year>2019</year>). <source>Vision Through the Atmosphere</source>. <publisher-loc>Toronto</publisher-loc>: <publisher-name>University of Toronto Press</publisher-name>.</citation>
</ref>
<ref id="B38">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Mittal</surname> <given-names>A.</given-names></name> <name><surname>Soundararajan</surname> <given-names>R.</given-names></name> <name><surname>Bovik</surname> <given-names>A. C.</given-names></name></person-group> (<year>2012</year>). <article-title>Making a &#x0201C;completely blind&#x0201D; image quality analyzer</article-title>. <source>IEEE Signal Process Lett</source>. <volume>20</volume>, <fpage>209</fpage>&#x02013;<lpage>212</lpage>. <pub-id pub-id-type="doi">10.1109/LSP.2012.2227726</pub-id></citation>
</ref>
<ref id="B39">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Parmar</surname> <given-names>N.</given-names></name> <name><surname>Vaswani</surname> <given-names>A.</given-names></name> <name><surname>Uszkoreit</surname> <given-names>J.</given-names></name> <name><surname>Kaiser</surname> <given-names>L.</given-names></name> <name><surname>Shazeer</surname> <given-names>N.</given-names></name> <name><surname>Ku</surname> <given-names>A.</given-names></name> <etal/></person-group>. (<year>2018</year>). <article-title>&#x0201C;Image transformer,&#x0201D;</article-title> in <source>International Conference on Machine Learning</source> (<publisher-loc>Macao</publisher-loc>), <fpage>4055</fpage>&#x02013;<lpage>4064</lpage>.</citation>
</ref>
<ref id="B40">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Qin</surname> <given-names>X.</given-names></name> <name><surname>Wang</surname> <given-names>Z.</given-names></name> <name><surname>Bai</surname> <given-names>Y.</given-names></name> <name><surname>Xie</surname> <given-names>X.</given-names></name> <name><surname>Jia</surname> <given-names>H.</given-names></name></person-group> (<year>2020</year>). <article-title>&#x0201C;Ffa-net: Feature fusion attention network for single image dehazing,&#x0201D;</article-title> in <source>Proceedings of the AAAI Conference on Artificial Intelligence, Vol. 34</source> (<publisher-loc>New York, NY</publisher-loc>), <fpage>11908</fpage>&#x02013;<lpage>11915</lpage>.</citation>
</ref>
<ref id="B41">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Ren</surname> <given-names>D.</given-names></name> <name><surname>Zuo</surname> <given-names>W.</given-names></name> <name><surname>Hu</surname> <given-names>Q.</given-names></name> <name><surname>Zhu</surname> <given-names>P.</given-names></name> <name><surname>Meng</surname> <given-names>D.</given-names></name></person-group> (<year>2019</year>). <article-title>&#x0201C;Progressive image deraining networks: a better and simpler baseline,&#x0201D;</article-title> in <source>Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition</source> (<publisher-loc>Long Beach, CA</publisher-loc>: <publisher-name>IEEE</publisher-name>), <fpage>3937</fpage>&#x02013;<lpage>3946</lpage>.</citation>
</ref>
<ref id="B42">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Ren</surname> <given-names>W.</given-names></name> <name><surname>Pan</surname> <given-names>J.</given-names></name> <name><surname>Zhang</surname> <given-names>H.</given-names></name> <name><surname>Cao</surname> <given-names>X.</given-names></name> <name><surname>Yang</surname> <given-names>M.-H.</given-names></name></person-group> (<year>2020</year>). <article-title>Single image dehazing via multi-scale convolutional neural networks with holistic edges</article-title>. <source>Int. J. Comput. Vis</source>. <volume>128</volume>, <fpage>240</fpage>&#x02013;<lpage>259</lpage>. <pub-id pub-id-type="doi">10.1007/s11263-019-01235-8</pub-id></citation>
</ref>
<ref id="B43">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Vaswani</surname> <given-names>A.</given-names></name> <name><surname>Shazeer</surname> <given-names>N.</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>). <article-title>&#x0201C;Attention is all you need,&#x0201D;</article-title> in <source>Advances in Neural Information Processing Systems</source> (<publisher-loc>Long Beach, CA</publisher-loc>), <fpage>5998</fpage>&#x02013;<lpage>6008</lpage>.</citation>
</ref>
<ref id="B44">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Wang</surname> <given-names>C.</given-names></name> <name><surname>Wu</surname> <given-names>Y.</given-names></name> <name><surname>Su</surname> <given-names>Z.</given-names></name> <name><surname>Chen</surname> <given-names>J.</given-names></name></person-group> (<year>2020</year>). <article-title>&#x0201C;Joint self-attention and scale-aggregation for self-calibrated deraining network,&#x0201D;</article-title> in <source>Proceedings of the 28th ACM International Conference on Multimedia</source> (<publisher-loc>Seattle</publisher-loc>), <fpage>2517</fpage>&#x02013;<lpage>2525</lpage>.</citation>
</ref>
<ref id="B45">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Wang</surname> <given-names>N.</given-names></name> <name><surname>Cui</surname> <given-names>Z.</given-names></name> <name><surname>Su</surname> <given-names>Y.</given-names></name> <name><surname>Li</surname> <given-names>A.</given-names></name></person-group> (<year>2021</year>). <article-title>Rgnam: recurrent grid network with an attention mechanism for single-image dehazing</article-title>. <source>J. Electron. Imaging</source> <volume>30</volume>, <fpage>033026</fpage>. <pub-id pub-id-type="doi">10.1117/1.JEI.30.3.033026</pub-id></citation>
</ref>
<ref id="B46">
<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. C.</given-names></name> <name><surname>Sheikh</surname> <given-names>H. R.</given-names></name> <name><surname>Simoncelli</surname> <given-names>E. P.</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>&#x02013;<lpage>612</lpage>. <pub-id pub-id-type="doi">10.1109/TIP.2003.819861</pub-id><pub-id pub-id-type="pmid">15376593</pub-id></citation></ref>
<ref id="B47">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Wu</surname> <given-names>B.</given-names></name> <name><surname>Xu</surname> <given-names>C.</given-names></name> <name><surname>Dai</surname> <given-names>X.</given-names></name> <name><surname>Wan</surname> <given-names>A.</given-names></name> <name><surname>Zhang</surname> <given-names>P.</given-names></name> <name><surname>Yan</surname> <given-names>Z.</given-names></name> <etal/></person-group>. (<year>2020</year>). <article-title>Visual transformers: token-based image representation and processing for computer vision</article-title>. <source>arXiv preprint arXiv:2006.03677</source>. <pub-id pub-id-type="doi">10.48550/arXiv.2006.03677</pub-id></citation>
</ref>
<ref id="B48">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Xie</surname> <given-names>Z.</given-names></name> <name><surname>Lin</surname> <given-names>Y.</given-names></name> <name><surname>Yao</surname> <given-names>Z.</given-names></name> <name><surname>Zhang</surname> <given-names>Z.</given-names></name> <name><surname>Dai</surname> <given-names>Q.</given-names></name> <name><surname>Cao</surname> <given-names>Y.</given-names></name> <etal/></person-group>. (<year>2021</year>). <article-title>Self-supervised learning with swin transformers</article-title>. <source>arXiv preprint arXiv:2105.04553</source>. <pub-id pub-id-type="doi">10.48550/arXiv.2105.04553</pub-id></citation>
</ref>
<ref id="B49">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Yamak</surname> <given-names>P. T.</given-names></name> <name><surname>Yujian</surname> <given-names>L.</given-names></name> <name><surname>Gadosey</surname> <given-names>P. K.</given-names></name></person-group> (<year>2019</year>). <article-title>&#x0201C;A comparison between arima, lstm, and gru for time series forecasting,&#x0201D;</article-title> in <source>Proceedings of the 2019 2nd International Conference on Algorithms, Computing and Artificial Intelligence</source> (<publisher-loc>Sanya</publisher-loc>), <fpage>49</fpage>&#x02013;<lpage>55</lpage>.</citation>
</ref>
<ref id="B50">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Yan</surname> <given-names>J.</given-names></name> <name><surname>Li</surname> <given-names>C.</given-names></name> <name><surname>Zheng</surname> <given-names>Y.</given-names></name> <name><surname>Xu</surname> <given-names>S.</given-names></name> <name><surname>Yan</surname> <given-names>X.</given-names></name></person-group> (<year>2020</year>). <article-title>Mmp-net: a multi-scale feature multiple parallel fusion network for single image haze removal</article-title>. <source>IEEE Access</source> <volume>8</volume>, <fpage>25431</fpage>&#x02013;<lpage>25441</lpage>. <pub-id pub-id-type="doi">10.1109/ACCESS.2020.2971092</pub-id></citation>
</ref>
<ref id="B51">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Yeh</surname> <given-names>C.-H.</given-names></name> <name><surname>Huang</surname> <given-names>C.-H.</given-names></name> <name><surname>Kang</surname> <given-names>L.-W.</given-names></name></person-group> (<year>2019</year>). <article-title>Multi-scale deep residual learning-based single image haze removal via image decomposition</article-title>. <source>IEEE Trans. Image Process</source>. <volume>29</volume>, <fpage>3153</fpage>&#x02013;<lpage>3167</lpage>. <pub-id pub-id-type="doi">10.1109/TIP.2019.2957929</pub-id><pub-id pub-id-type="pmid">31831420</pub-id></citation></ref>
<ref id="B52">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Yue</surname> <given-names>X.</given-names></name> <name><surname>Sun</surname> <given-names>S.</given-names></name> <name><surname>Kuang</surname> <given-names>Z.</given-names></name> <name><surname>Wei</surname> <given-names>M.</given-names></name> <name><surname>Torr</surname> <given-names>P.</given-names></name> <name><surname>Zhang</surname> <given-names>W.</given-names></name> <etal/></person-group>. (<year>2021</year>). <article-title>Vision transformer with progressive sampling</article-title>. <source>arXiv preprint arXiv:2108.01684</source>. <pub-id pub-id-type="doi">10.1109/ICCV48922.2021.00044</pub-id></citation>
</ref>
<ref id="B53">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Zamir</surname> <given-names>S. W.</given-names></name> <name><surname>Arora</surname> <given-names>A.</given-names></name> <name><surname>Khan</surname> <given-names>S.</given-names></name> <name><surname>Hayat</surname> <given-names>M.</given-names></name> <name><surname>Khan</surname> <given-names>F. S.</given-names></name> <name><surname>Yang</surname> <given-names>M.-H.</given-names></name> <etal/></person-group>. (<year>2021</year>). <article-title>&#x0201C;Multi-stage progressive image restoration,&#x0201D;</article-title> in <source>Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition</source> (<publisher-loc>Nashville, TN</publisher-loc>: <publisher-name>IEEE</publisher-name>), <fpage>14821</fpage>&#x02013;<lpage>14831</lpage>.<pub-id pub-id-type="pmid">35458840</pub-id></citation></ref>
<ref id="B54">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Zhang</surname> <given-names>T.</given-names></name> <name><surname>Li</surname> <given-names>J.</given-names></name> <name><surname>Fan</surname> <given-names>H.</given-names></name></person-group> (<year>2022</year>). <article-title>Progressive edge-sensing dynamic scene deblurring</article-title>. <source>Comput. Vis. Media</source> <volume>8</volume>, <fpage>495</fpage>&#x02013;<lpage>508</lpage>. <pub-id pub-id-type="doi">10.1007/s41095-021-0246-4</pub-id></citation>
</ref>
<ref id="B55">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Zheng</surname> <given-names>S.</given-names></name> <name><surname>Lu</surname> <given-names>J.</given-names></name> <name><surname>Zhao</surname> <given-names>H.</given-names></name> <name><surname>Zhu</surname> <given-names>X.</given-names></name> <name><surname>Luo</surname> <given-names>Z.</given-names></name> <name><surname>Wang</surname> <given-names>Y.</given-names></name> <etal/></person-group>. (<year>2021</year>). <article-title>&#x0201C;Rethinking semantic segmentation from a sequence-to-sequence perspective with transformers,&#x0201D;</article-title> in <source>Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition</source> (<publisher-loc>Nashville, TN</publisher-loc>: <publisher-name>IEEE</publisher-name>), <fpage>6881</fpage>&#x02013;<lpage>6890</lpage>.</citation>
</ref>
<ref id="B56">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Zhu</surname> <given-names>Q.</given-names></name> <name><surname>Mai</surname> <given-names>J.</given-names></name> <name><surname>Shao</surname> <given-names>L.</given-names></name></person-group> (<year>2015</year>). <article-title>A fast single image haze removal algorithm using color attenuation prior</article-title>. <source>IEEE Trans. Image Process</source>. <volume>24</volume>, <fpage>3522</fpage>&#x02013;<lpage>3533</lpage>. <pub-id pub-id-type="doi">10.1109/TIP.2015.2446191</pub-id><pub-id pub-id-type="pmid">26099141</pub-id></citation></ref>
<ref id="B57">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Zhu</surname> <given-names>X.</given-names></name> <name><surname>Su</surname> <given-names>W.</given-names></name> <name><surname>Lu</surname> <given-names>L.</given-names></name> <name><surname>Li</surname> <given-names>B.</given-names></name> <name><surname>Wang</surname> <given-names>X.</given-names></name> <name><surname>Dai</surname> <given-names>J.</given-names></name></person-group> (<year>2020</year>). <article-title>Deformable detr: deformable transformers for end-to-end object detection</article-title>. <source>arXiv preprint arXiv:2010.04159</source>. <pub-id pub-id-type="doi">10.48550/arXiv.2010.04159</pub-id></citation>
</ref>
</ref-list> 
</back>
</article>