Title: GLOBAL REASONING NETWORK FOR IMAGE SUPER-RESOLUTION Anonymous authors Paper under double-blind review

Abstract: Recent image super-resolution(SR) studies leverage very deep convolutional neural networks and the rich hierarchical features they offered, which leads to better reconstruction performance than conventional methods. However, the small receptive fields in the up-sampling and reconstruction process of those models stop them to take full advantage of global contextual information. This causes problems for further performance improvement. In this paper, inspired by image reconstruction principles of human visual system, we propose an image super-resolution global reasoning network (SRGRN) to effectively learn the correlations between different regions of an image, through global reasoning. Specifically, we propose global reasoning up-sampling module (GRUM) and global reasoning reconstruction block (GRRB). They construct a graph model to perform relation reasoning on regions of low resolution (LR) images.They aim to reason the interactions between different regions in the up-sampling and reconstruction process and thus leverage more contextual information to generate accurate details. Our proposed SRGRN are more robust and can handle low resolution images that are corrupted by multiple types of degradation. Extensive experiments on different benchmark data-sets show that our model outperforms other state-of-the-art methods. Also our model is lightweight and consumes less computing power, which makes it very suitable for real life deployment.

1. INTRODUCTION:

Image Super-Resolution (SR) aims to reconstruct an accurate high-resolution (HR) image given its low-resolution (LR) counterpart. It is a typical ill-posed problem, since the LR to HR mapping is highly uncertain. In order to solve this problem, a large number of methods have been proposed, including interpolation-based (Zhang & Wu., 2006) , reconstruction-based (Zhang et al., 2012) , and learning-based methods (Timofte et al., 2013; 2014; Peleg & Elad., 2014; Schulter et al., 2015; Dong et al.; Huang et al., 2015; Tai et al., 2017; Tong et al., 2017; Zhang et al., 2018a; Dong et al., 2016) .

In recent years, deep learning based methods have achieved outstanding performance in superresolution reconstruction. Some effective residual or dense blocks (Huang et al., 2017; Zhang et al., 2018b; Wang et al., 2018; Lim et al., 2017; Ledig et al., 2017; Ahn et al.; Li et al., 2018) have been proposed to make the network wider and deeper and achieved better results. However, they only pay close attention to improving the feature extraction module, ignoring that the upsampling process with smaller receptive fields does not make full use of those extracted features. Small convolution receptive field means that the upsampling process can only perform super-resolution reconstruction based on local feature relationships in LR. As we all know, different features interact with each other, and features which are in different regions have corresponding effects on upsampling and reconstruction of a certain region. That is to say that a lot of information is lost in the process of upsampling and reconstruction due to the limitation of the receptive field, although the network extracts a large number of hierarchical features which are from low frequency to high frequency. Chariker et al. (2016; 2018) show that the brain generates the images we see based on a small amount of information observed by the human eye, ranther than acquiring the complete data from the point-by-point scan of the retina. This process of generating an image is similar to a SR process. According to their thought, we add global information in SR reconstruction and propose to use relational reasoning to implement the process that the human visual system reconstructs images with observed global information. In general, extracting global information requires a large receptive field. A large convolution receptive field usually requires stacking a large number of convolutional layers, but this method does not work in the upsampling and reconstruction process. Because this will produce a huge number of parameters.

Based on the above analysis, we propose an image super-resolution global reasoning network (SR-GRN) which introduces the global reasoning mechanism to the upsampling module and the reconstruction layer. The model can capture the relationship between disjoint features of the image with a small respective field, thereby fully exploits global information as a reference for upsampling and reconstruction. We mainly propose global reasoning upsampling module (GRUM) and global reasoning reconstruction block (GRRB) as the core structure of the network. GRUM and GRRB first convert the LR feature map into N nodes, each of which not only represents a feature region in the LR image, but also contains the influence of pixels in other regions on this feature. Then they learn the relationship between the nodes and fuse the information of each node in a global scope. After that, GRUM learns the relationship between the channels in each node and amplifies the number of channels for the upsampling process. And then they convert N nodes into pixels with global reasoning information. Finally, GRUM and GRRB complete the upsampling and reconstruction process respectively.

In general, our work mainly has the following three contributions:

• We propose an image super-resolution global reasoning network (SRGRN) which draws on the idea of image reconstruction principles of human visual system. We mainly focus on the upsampling module and the reconstruction module. The model reconstructs SR images based on relational reasoning in a global scope.

• We propose a global reasoning upsampling module (GRUM) and global reasoning reconstruction block (GRRB), which construct a graph model to implement the relational reasoning among the feature regions in an image via 1D and 2D convolution, and finally adds the information obtained by global reasoning to each pixel. It can provide more contextual information to help generate more accurate details.

• Our proposed GRUM and GRRB are lightweight, which makes it suitable for real life deployment. More importantly, GRUM and GRRB balance the number of parameters and the reconstruction performance well. They can be easily inserted into other models. (Kima et al., 2016) and DRCN (Kim et al., 2016) which introduced residual learning to make the network depth reach 20 layers achieved significant improvement. And then more and more researchers are starting to pay attention to the improvement of the network feature extraction part. Lim et al. (2017) proposed EDSR and MDSR, which introduce residual scaling and remove unnecessary modules from the residual block. Concerned that the previous models only adopt the feather of the last CNN, Zhang et al. (2018b) proposed residual dense network to make full use of hierarchical features from each Conv layer. The above and most of the subsequent networks implement the upsampling based on either transposed convolution (Zeiler et al., 2010; Zeiler & Fergus., 2014) or sub-pixel convolution (Shi et al., 2016) . Although these models have achieved good results, there exists a problem that these upsampling methods have only a small receptive field. This means that upsampling can only take advantage of contextual information within a small area.

2. RELATED WORKS:

Recently, researchers propose some new super-resolution upsampling process. LapSRN (Lai et al., 2017) allows low-resolution images to be directly input into the network for step-by-step amplification. Haris et al. (2018) et al., 2017) to solve problems that depend on relational reasoning. Liu et al. (2018) propose SIN, which implement a object detection using a graph model for structure inference. Furthermore, Chen et al. (2018) model a Global Reasoning unit that consists of five convolutions for image classification, semantic segmentation and video action recognition task. Considering that the human visual system generates images based on the observed global information is also a reasoning process. Moreover, correlation between feature regions can be obtained through relational reasoning, which makes each pixel in the generated SR image jointly determined by the information in a global scope. Therefore, we propose a global reasoning network for SR. We will detail our SRGRN in next section.

3. PROPOSED MODEL:

According to Chariker et al. (2016; 2018) , there is only little information transmitted from the retina to the visual cortex, and then the brain will reconstruct the real-world images based on the information received. We regard it as a reasoning process in a global scope. For image SR, the upsampling module constructs SR images base on features in LR images, which is substantially similar to detecting the category of each pixel of a SR image and generating these pixels based on contextual information of corresponding LR image. Due to the limitation of the convolution receptive field, only a small amount of contextual information can be utilized to generate HR images in most other models. This leads that many details in the HR image are not fine. Similarly, the above problem also exists in the reconstruction process. To solve these problems, we simulate the reasoning process that exists in human visual system, and then propose SRGRN to make full use of the contextual information to recover accurate details, which is achieved by constructing graph model and reasoning the relationship between these regions in an image. As with the previous work (Lim et al., 2017) , the number of GRUM depends on the scaling factor, The GRUM receives F L as input. F S represents the output of the GRUM. GRUM can be expressed by the following mathematical formula:

F S = H GRU M (F L ) (2)

where H GRU M (•)denotes a series of operations of GRUM. More details about GRUM will be given in Section 3.2.

We further conduct global reasoning reconstruction block(GRRB) to utilize the global contextual information to generate the output image. GRRB can be expressed by the following mathematical formula:

EQUATION

) where H GRRB (•) denotes a series of operations of GRRB. More details about GRRB will be given in Section 3.3. After the above operations, we get the corresponding SR image.

3.2. GLOBAL REASONING UPSAMPLING MODULE:

In this section, we present details about our proposed global reasoning upsample module(GRUM) in Figure 2 . In order to help achieve relation reasoning, we map each image to a graph model We first need a function to construct N nodes in the oriented graph, each of which represents a region in the image. In GRUM, we obtain relationship weights between these pixels through a 2D 1 × 1 convolution, and then convert the input F L into N nodes via element-wise product. The benefits of this approach are mainly reflected in the following aspects: (1) It can not only aggregates a feature region of the input F L into a node, but also dig out the influence of other pixels in the image on this region. This is equivalent to adding global guidance of the image to each node. (2) Using convolution means that these relationship weights are trainable. This process can be expressed by the following mathematical formula:

EQUATION

Y W = W n • (V d (F L )) T (5) where F L ∈ R C×H×W denotes the input tensor, V d (•) denotes the operation of converting the vector shape from N ×H ×W to N ×HW , W n ∈ R N ×HW denotes relationship weights and Y W ∈ R N ×C refers to N nodes with C channels.

After that, we use the 1D Conv -Leaky ReLu -1D Conv (CLC) structure to implement reasoning and interaction between N nodes in the graph. The parameters in CLC refer to the adjacency matrix of the weighted oriented complete graph, which store the correlations between the nodes. CLC can learn and reason the complex nonlinear relationship between nodes better than only one 1D Conv. We use the following formula to describe the reasoning process between nodes:

EQUATION

where Conv(•) and LRelu(•) denote 1D convolution along node-wise and Leaky ReLU (Maas et al., 2013) operation respectively.

And then we use the bottleneck to achieve channel amplification. The bottleneck receives Y N ∈ R N ×C as input and redistributes these channels by modeling the relationship between the channels of each node, amplifying the number of channel to C × r 2 , where r is the upscaling factor.

The first convolution in bottleneck makes channel C drop to C = C/α, where α represents reduction ratio. Then the second convolution makes the channel dimension C grow to C × r 2 . The bottleneck not only fits the complex relationships between channels better and redistributes channels more accurately, but also greatly reduces the number of parameters compared to the method of utilizing a single convolution. We use the following formula to describe channel amplification:

EQUATION

where Y N C ∈ R r 2 C×N refers to the output tensor.

In order to expand the resolution by pixelshuffle like ESPCN (Shi et al., 2016) , we need to retransform the N nodes (r 2 C × N ) which have implemented the relational reasoning into a space whose shape is C × H × W . As above, we still learn a function to get a weight matrix whose shape is N ×HW through a 1 × 1 2D convolution, and then normalize the weight matrix along the column with softmax. Finally, Y rC and W P can be obtained through:

EQUATION

EQUATION

where V u (•) denotes the operation of reshaping N × HW to N × H × W . Y rC ∈ R r 2 C×H×W is a feature map where each pixel is associated with N nodes. W P ∈ R N ×HW is the normalized weight matrix. The value of these weights ranges from 0 to 1. This means that the reconstruction of each pixel is affected by N nodes to varying degrees. Each pixel in the feature map contains information which is generated by global reasoning.

After pixelshuffle, the output is multiplied by a parameter γ 1 and added to the upsampling result without global reasoning. The initial value of γ 1 is set to 0. As the global reasoning module trains, the network will gradually learn to assign values to the γ 1 , thereby fully exploiting global reasoning. This process can be expressed by the following formula:

EQUATION

where H P S (•) denotes the operations of pixel shuffle and H U P (•) denotes the operations of subpixel convolution.

Finally, F S can be obtained by:

EQUATION

Figure 3 : Global reasoning reconstruction block (GRRB) architecture

3.3. GLOBAL REASONING RECONSTRUCTION BLOCK:

As shown in Figure 3 , the specific details are similar to GRUM. We also construct a graph model for reconstruction block.

In GRRB, we first obtain the relationship weights W RN ∈ R N ×rHrW between pixels of F S by 2D 1x1 convolution, and then aggregate the regions in F S into N nodes by element-wise product. The output of this process Y RW ∈ R N ×C can be formulated as:

Y RW = W RN • (V d (F S )) T = V d (Conv(F S )) • (V d (F S )) T (12)

After that, we use CLC to achieve the relationship reasoning between nodes. Then we exploit the weight matrix

W RP ∈ R N ×rHrW = Sof tmax(V d (Conv(F S )

)) obtained by learning to redistribute the information of N nodes to the pixels. The output of this process Y RrC ∈ R C×rH×rW can be obtained by:

Y RrC = V u ((F CLC (Y RW )) T • W RP ) = V u ((F CLC (Y RW )) T • Sof tmax(V d (Conv(F S )))) (13)

where F CLC refers to the operations of CLC. In addition, we apply the idea of residual connection in GRRB, which multiplys the information generated via global reasoning by a parameter γ and then add it to the input feature map. The output is given by:

EQUATION

)

The initial value of γ is set to 0. As the training progresses, the network assigns more weight to γ. Finally, we input the feature map with global reasoning into the two Convs for reconstruction. We can get the final output through:

EQUATION

) where H RL (•) denotes the operations of two Convs.

3.4. IMPLEMENTATION DETAILS:

In our proposed SRGRN, like the previous method (Lim et al., 2017) , the number of GRUM depends on the scaling factor. For Conv layers with kernel size 3 × 3, we pad zeros to keep size fixed. We set the reduction ratio in bottleneck as α. The number of nodes in the graph model is set to N. We utilize Leaky ReLu (Maas et al., 2013) with a negative slope of 0.2 as non-linear activation function. The feature extraction part of the network are the same as the RDN (Zhang et al., 2018b) settings. The final Conv layer has 1 or 3 output channels, as we output gray or color HR images.

4. EXPERIMENTS:

4.1 SETTINGS Datasets and Metrics. We train all our models using 800 training images in the DIV2K (Agustsson & Timofte., 2017) dataset, which contains high-quality 2K images that can be used for image superresolution task. And We use five standard benchmark datasets to evaluate PSNR and SSIM (Wang et al., 2004 ) metrics: Set5 (Bevilacqua et al., 2012 ), Set14 (Zeyde et al., 2010) , B100 (Martin et al., 2001) , Urban100 (Huang et al., 2015) and Manga109 (Y. Matsui et al., 2017) . The SR results are evaluated on Y channel of transformed YCbCr space.

Degradation Models. In order to make a fair comparison with existing models, bicubic dowmsampling(denoted as BI) is regarded as a standard degradation model. We use it to generate LR images with scaling factor ×2, ×3, and ×4 from ground truth HR images. To fully demonstrate the effectiveness of our model, we also use two other degradation models and conduct special experiments for them. Our second model, we defined it as BD, which blurs HR images with a Gaussian kernel of size 7 × 7 and a standard deviation of 1.6, and then downsamples the image with scaling factor ×3. In addition to BI and BD, we also built the DN model, which first performs bicubic downsampling with scaling factor ×3 and then adds Gaussian noise with a noise level of 30.

Training Setting. In each training batch, 16 LR RGB patches of size 48 × 48 are extracted as inputs. We perform data enhancement on the training images, which are randomly rotated by 90 • , 180 • , 270 • and flipped horizontally. We use the Adam optimizer to update the parameters of the network with β 1 = 0.9, β 2 = 0.999, and ϵ = 10 -8 . For all layers in the network, the initial learning rate is set to 0.0001, and then the learning rate is halved every 200 epochs. We use the Pytorch framework to implement our model with Tesla P100.

4.2. ABLATION INVESTIGATION AND STUDY OF PARAMETERS:

Global reasoning upsampling module. In order to verify the importance of the GRUM, we remove the GRUM from the network, leaving only the GRRB in the network for relation reasoning. As shown in Table 1 , after removing GRUM, the performance of the network drops from 32.45 dB to 32.40 dB. When the Case Index is equal to 1, the corresponding model is the baseline model. We can observe that after GRUM is added to the baseline model, the network performance is improved from 32.31 dB to 32.42 dB. It can be seen that although our baseline model has achieved quite good results, GRUM can still improve the performance by relation reasoning in upsample module. This also indicates that relation reasoning can indeed result in better prformance. These comparisons fairly demonstrate the effectiveness of the GRUM for SR tasks.

Global reasoning reconstruction block. Then, we continue to study the effectiveness of GRRB for the network. After we add the GRRB to the baseline model, GRRB improves the performance of the model from 32.31 dB to 32.40 dB. Furthermore, the model with GRUM has achieved good performance. And it is difficult to obtain further improvements. But when we add the GRRB to it, the network performance shows a significant improvement, and the PSNR value on Set5 increases from 32.42 dB to 32.45 dB. These indicates that it is very essential for our network.

Basic parameters. Moreover, we also study the effects of two basic parameters N and α on the performance of the model. As shown in Table 1 , we observe that larger N and smaller α would lead to higher performance. Considering that larger N and smaller α will also bring more computation, we set 10 and 8 as the value of N and α respectively. 

4.3. NETWORK PARAMETERS:

Several state-of-the-art methods are compared with our SRGRN in this section. We show comparisons about model size and performance in Figure 4 . Although our SRGRN has less parameter number than that of EDSR, MDSR and D-DBPN, our SRGRN and SRGRN+ achieve higher performance, having a better tradeoff between model size and performance. This demonstrates our method can well balance the number of parameters and the reconstruction performance. 

4.4. RESULTS WITH BI DEGRADATION MODEL:

For BI degradation model, we compare our proposed SRGRN and SRGRN+ with other seven stateof-the-art image SR methods in quantitative terms. Following the previous works (Lim et al., 2017; Zhang et al., 2018b; Li et al., 2019) , we also introduced a self-ensemble strategy to further improve the performance. We denote the self-ensemble method as SRGRN+.

A quantitative result for ×2, ×3, and ×4 is shown in Table 2 . We compare our models with other state-of-the-art methods on PSNR and SSIM. It can be seen that our proposed SRGRN outperforms other methods on all datasets without adding self-ensemble. After adopting self-ensemble, the performance further improves on the basis of SRGRN, and it achieved the best on all datasets. It is worth mentioning that SRFBN (Li et al., 2019) uses DIV2K+Flickr2K as their training set, which employs more training images than us. Previous research has come to a conclusion that more data in training set leads to a better result. However, their results are still not comparable to ours. Although RDN (Zhang et al., 2018b ) is a state-of-the-art method, our SRGRN can achieve better performance in all datasets through relational reasoning in upsampling and reconstruction parts. The quantitative results indicate that our GRUM and GRRB play a vital role in improving network performance.

4.5. RESULTS WITH BD AND DN DEGRADATION MODELS:

To show the robustness of the model, we also show the SR results with BD degradation model and further introduce DN degradation model. We compare 3 × SR results with other seven state-of-theart image SR methods in quantitative terms. And We re-train SRCNN (Dong et al.) and VDSR (Kima et al., 2016) for BD and DN degradation model because of mismatched degradation model. For BD and DN, there is no doubt that reconstruction has become more difficult. As shown in Table 3 and Table 4 , in the case of images with a lot of artifacts and noise, our SRGRN can get a excellent performance. This shows that SRGRN can effectively denoise and alleviate blurring artifacts. And when added to self-ensemble, SRGRN+ can achieve a better improvement. 

4.6. SUPER-RESOLUTION ON REAL-WORLD IMAGES:

To prove that our SRGRN can be widely used in the real world and performs robustly, we also conduct SR experiments on representative real-world images. We reconstruct some low resolution images in the real world that lack a lot of high frequency information. Moreover, in this case, the original HR images are not available and the degradation model is unknown either. Experiments show our SRGRN can recover finer and more faithful real-world images than other state-of-the-art methods under this bad condition. This further reflects the superiority of relation reasoning.

5. CONCLUSION:

In this paper, inspired by the process of reconstructing images from the human visual system, we propose an super-resolution global reasoning network (SRGRN) for image SR, which aims at completing the reconstruction of SR images through global reasoning. We mainly propose global reasoning upsampling module (GRUM) and global reasoning reconstruction block (GRRB) as the core of the network. The GRUM can give the upsampling module the ability to perform relational reasoning in a global scope, which allows this process to overcome the limitations of the receptive field and recover more faithful details by analyzing more contextual information. The GRRB also enables the reconstruction block to make full use of the interaction between the regions and pixels to reconstruct SR images. We exploit SRGRN not only to handle low resolution images that are corrupted by three degradation model, but also to handle real-world images. Extensive benchmark evaluations demonstrate the importance of GRUM and GRRB. It also indicates that our SRGRN achieves superiority over state-of-the-art methods through global reasoning.

:



Figures and Tables:

Figure 1: Super-resolution global reasoning network (SRGRN) architecture 3.1 ARCHITECTURE As shown in Figure 1, our SRGRN includes feature extraction part, global reasoning upsample module(GRUM) and global reasoning reconstruction block(GRRB). Let's denote I LR and I SR as the input and output of SRGRN. The feature extraction part can use the relevant architecture of most other models. Here we introduce the feature extraction part of the RDN (Zhang et al., 2018b) as an example. F L = H F EX (I LR ) (1) where H F EX (•) denotes a series of operations of feature extraction part.

Figure 2: Global reasoning upsampling module (GRUM) architecture G = (V, E, u), where nodes in graph represent different regions in the image, E represents the relationship weight between the different regions, stored in the adjacency matrix of the graph, and u is the global information of the entire image.

Figure 4: The results are evaluated on the Set5 dataset for 4 × SR. The proposed SRGRN strikes a balance between the number of parameters and the reconstruction effect.

exploit iterative up-and-down sampling layers and propose DBPN.Li et al. (2019) further explore the application of feedback mechanism (weight sharing) in SR and propose the SRFBN. These models have achieved a better reconstruction performance. However, the Conv layers in these upsampling modules still have only a small receptive field.

Table content: <table><tr><td>Global reasoning machansim. Recently, graph-based deep learning methods have begun to be</td></tr><tr><td>widely used to solve relation reasoning. Santoro et al. propose Relation Networks (RN) (Santoro</td></tr></table>

Ablation investigation of global reasoning upsampling method and global reasoning reconstruction block, study of N and α. We observe the best PSNR values on Set5 with scaling factor ×4 in 200 epochs

Table content: <table><tr><td>Case Index</td><td>1</td><td>2</td><td>3</td><td>4</td><td>5</td><td>6</td><td>7</td><td>8</td></tr><tr><td>Global reasoning upsampling module</td><td>×</td><td>✓</td><td>×</td><td>✓</td><td>✓</td><td>✓</td><td>✓</td><td>✓</td></tr><tr><td>Global reasoning reconstruction block</td><td>×</td><td>×</td><td>✓</td><td>✓</td><td>✓</td><td>✓</td><td>✓</td><td>✓</td></tr><tr><td>Number of Node (N)</td><td>-</td><td>10</td><td>10</td><td>10</td><td>8</td><td>6</td><td>8</td><td>6</td></tr><tr><td>reduction ratio (α)</td><td>-</td><td>8</td><td>8</td><td>8</td><td>8</td><td>8</td><td>16</td><td>16</td></tr><tr><td>PSNR on Set5 (4×)</td><td>32.31</td><td>32.42</td><td>32.40</td><td>32.45</td><td>32.43</td><td>32.42</td><td>32.42</td><td>32.40</td></tr></table>

Average PSNR/SSIM for scale factors ×2, ×3 and ×4 with BI degradation model. Best results are highlighted

Table content: <table><tr><td>Method</td><td>scale</td><td>PSNR</td><td>Set5</td><td>SSIM</td><td colspan="2">Set14 PSNR SSIM</td><td colspan="2">BSDS100 PSNR SSIM</td><td colspan="2">Urban100 PSNR SSIM</td><td colspan="2">Manga109 PSNR SSIM</td></tr><tr><td>Bicubic</td><td/><td>33.66</td><td colspan="2">0.9299</td><td>30.24</td><td>0.8688</td><td>29.56</td><td>0.8431</td><td>26.88</td><td>0.8403</td><td>30.80</td><td>0.9339</td></tr><tr><td>SRCNN</td><td/><td>36.66</td><td colspan="2">0.9542</td><td>32.45</td><td>0.9067</td><td>31.36</td><td>0.8879</td><td>29.50</td><td>0.8946</td><td>35.60</td><td>0.9663</td></tr><tr><td>DRRN</td><td/><td>37.74</td><td colspan="2">0.9591</td><td>33.23</td><td>0.9136</td><td>32.05</td><td>0.8973</td><td>31.23</td><td>0.9188</td><td>37.60</td><td>0.9736</td></tr><tr><td>LapSRN</td><td/><td>37.52</td><td colspan="2">0.9591</td><td>33.08</td><td>0.9130</td><td>31.08</td><td>0.8950</td><td>30.41</td><td>0.9101</td><td>37.27</td><td>0.9740</td></tr><tr><td>EDSR</td><td>×2</td><td>38.11</td><td colspan="2">0.9602</td><td>33.92</td><td>0.9195</td><td>32.32</td><td>0.9013</td><td>32.93</td><td>0.9351</td><td>39.10</td><td>0.9773</td></tr><tr><td>RDN</td><td/><td>32.24</td><td colspan="2">0.9614</td><td>34.01</td><td>0.9212</td><td>32.34</td><td>0.9017</td><td>32.89</td><td>0.9353</td><td>39.18</td><td>0.9780</td></tr><tr><td>SRFBN</td><td/><td>38.11</td><td colspan="2">0.9609</td><td>33.82</td><td>0.9196</td><td>32.29</td><td>0.9010</td><td>32.62</td><td>0.9328</td><td>39.08</td><td>0.9779</td></tr><tr><td>SRGRN(ours)</td><td/><td>38.25</td><td colspan="2">0.9614</td><td>34.06</td><td>0.9214</td><td>32.37</td><td>0.9022</td><td>33.12</td><td>0.9367</td><td>39.31</td><td>0.9783</td></tr><tr><td>SRGRN+(ours)</td><td/><td>38.31</td><td colspan="2">0.9616</td><td>34.15</td><td>0.9220</td><td>32.43</td><td>0.9027</td><td>33.32</td><td>0.9382</td><td>39.51</td><td>0.9786</td></tr><tr><td>Bicubic</td><td/><td>30.39</td><td colspan="2">0.8682</td><td>27.55</td><td>0.7742</td><td>27.21</td><td>0.7385</td><td>24.46</td><td>0.7349</td><td>26.95</td><td>0.8556</td></tr><tr><td>SRCNN</td><td/><td>32.75</td><td colspan="2">0.9090</td><td>29.30</td><td>0.8215</td><td>28.41</td><td>0.7863</td><td>26.24</td><td>0.7989</td><td>30.48</td><td>0.9117</td></tr><tr><td>DRRN</td><td/><td>34.03</td><td colspan="2">0.9244</td><td>29.96</td><td>0.8349</td><td>28.95</td><td>0.8004</td><td>27.53</td><td>0.8378</td><td>32.42</td><td>0.9359</td></tr><tr><td>LapSRN</td><td/><td>33.82</td><td colspan="2">0.9227</td><td>29.87</td><td>0.8320</td><td>28.82</td><td>0.7980</td><td>27.07</td><td>0.8280</td><td>32.21</td><td>0.9350</td></tr><tr><td>EDSR</td><td>×3</td><td>34.65</td><td colspan="2">0.9280</td><td>30.52</td><td>0.8462</td><td>29.25</td><td>0.8093</td><td>28.80</td><td>0.8653</td><td>34.17</td><td>0.9476</td></tr><tr><td>RDN</td><td/><td>34.71</td><td colspan="2">0.9296</td><td>30.57</td><td>0.8468</td><td>29.26</td><td>0.8093</td><td>28.80</td><td>0.8653</td><td>34.13</td><td>0.9484</td></tr><tr><td>SRFBN</td><td/><td>34.70</td><td colspan="2">0.9292</td><td>30.51</td><td>0.8461</td><td>29.24</td><td>0.8084</td><td>28.73</td><td>0.8641</td><td>34.18</td><td>0.9481</td></tr><tr><td>SRGRN(ours)</td><td/><td>34.72</td><td colspan="2">0.9297</td><td>30.60</td><td>0.8474</td><td>29.29</td><td>0.8102</td><td>28.95</td><td>0.8675</td><td>34.28</td><td>0.9491</td></tr><tr><td>SRGRN+(ours)</td><td/><td>34.79</td><td colspan="2">0.9301</td><td>30.69</td><td>0.8487</td><td>29.36</td><td>0.8114</td><td>29.11</td><td>0.8705</td><td>34.58</td><td>0.9506</td></tr><tr><td>Bicubic</td><td/><td>28.42</td><td colspan="2">0.8104</td><td>26.00</td><td>0.7027</td><td>25.96</td><td>0.6675</td><td>23.14</td><td>0.6577</td><td>24.89</td><td>0.7866</td></tr><tr><td>SRCNN</td><td/><td>30.48</td><td colspan="2">0.8628</td><td>27.50</td><td>0.7513</td><td>26.90</td><td>0.7101</td><td>24.52</td><td>0.7221</td><td>27.58</td><td>0.8555</td></tr><tr><td>DRRN</td><td/><td>31.68</td><td colspan="2">0.8888</td><td>28.21</td><td>0.7721</td><td>27.38</td><td>0.7284</td><td>25.44</td><td>0.7638</td><td>29.18</td><td>0.8914</td></tr><tr><td>LapSRN</td><td/><td>31.54</td><td colspan="2">0.8850</td><td>28.19</td><td>0.7720</td><td>27.32</td><td>0.7270</td><td>25.21</td><td>0.7560</td><td>29.09</td><td>0.8900</td></tr><tr><td>EDSR</td><td>×4</td><td>32.46</td><td colspan="2">0.8968</td><td>28.80</td><td>0.7876</td><td>27.71</td><td>0.7420</td><td>26.64</td><td>0.8033</td><td>31.02</td><td>0.9148</td></tr><tr><td>RDN</td><td/><td>32.47</td><td colspan="2">0.8990</td><td>28.81</td><td>0.7871</td><td>27.72</td><td>0.7419</td><td>26.61</td><td>0.8028</td><td>31.00</td><td>0.9151</td></tr><tr><td>SRFBN</td><td/><td>32.47</td><td colspan="2">0.8983</td><td>28.81</td><td>0.7868</td><td>27.72</td><td>0.7409</td><td>26.60</td><td>0.8015</td><td>31.15</td><td>0.9160</td></tr><tr><td>SRGRN(ours)</td><td/><td>32.56</td><td colspan="2">0.8997</td><td>28.84</td><td>0.7880</td><td>27.75</td><td>0.7428</td><td>26.73</td><td>0.8053</td><td>31.13</td><td>0.9164</td></tr><tr><td>SRGRN+(ours)</td><td/><td>32.68</td><td colspan="2">0.9009</td><td>28.95</td><td>0.7903</td><td>27.83</td><td>0.7445</td><td>26.94</td><td>0.8106</td><td>31.52</td><td>0.9197</td></tr></table>

Average PSNR/SSIM for scale factors ×3 with BD degradation model. Best results are highlighted

Table content: <table><tr><td>Method</td><td>scale</td><td>PSNR</td><td>Set5</td><td>SSIM</td><td colspan="2">Set14 PSNR SSIM</td><td colspan="2">BSDS100 PSNR SSIM</td><td colspan="2">Urban100 PSNR SSIM</td><td colspan="2">Manga109 PSNR SSIM</td></tr><tr><td>Bicubic</td><td/><td>28.78</td><td colspan="2">0.8308</td><td>26.38</td><td>0.7271</td><td>26.33</td><td>0.6918</td><td>23.52</td><td>0.6862</td><td>25.46</td><td>0.8149</td></tr><tr><td>SRCNN</td><td/><td>32.05</td><td colspan="2">0.8944</td><td>28.80</td><td>0.8074</td><td>28.13</td><td>0.7736</td><td>25.70</td><td>0.7770</td><td>29.47</td><td>0.8924</td></tr><tr><td>VDSR</td><td/><td>33.25</td><td colspan="2">0.9150</td><td>29.46</td><td>0.8244</td><td>28.57</td><td>0.7893</td><td>26.61</td><td>0.8136</td><td>31.06</td><td>0.9234</td></tr><tr><td>IRCNN_G</td><td/><td>33.38</td><td colspan="2">0.9182</td><td>29.63</td><td>0.8281</td><td>28.65</td><td>0.7922</td><td>26.77</td><td>0.8154</td><td>31.15</td><td>0.9245</td></tr><tr><td>IRCNN_C</td><td>×3</td><td>33.17</td><td colspan="2">0.9157</td><td>29.55</td><td>0.8271</td><td>28.49</td><td>0.7886</td><td>26.47</td><td>0.8081</td><td>31.13</td><td>0.9236</td></tr><tr><td>SRMDNF</td><td/><td>34.09</td><td colspan="2">0.9242</td><td>30.11</td><td>0.8364</td><td>28.98</td><td>0.8009</td><td>27.50</td><td>0.8370</td><td>32.97</td><td>0.9391</td></tr><tr><td>RDN</td><td/><td>34.57</td><td colspan="2">0.9280</td><td>30.53</td><td>0.8447</td><td>29.23</td><td>0.8079</td><td>28.46</td><td>0.8581</td><td>33.97</td><td>0.9465</td></tr><tr><td>SRGRN(ours)</td><td/><td>34.66</td><td colspan="2">0.9286</td><td>30.60</td><td>0.8460</td><td>29.27</td><td>0.8090</td><td>28.71</td><td>0.8633</td><td>34.27</td><td>0.9480</td></tr><tr><td>SRGRN+(ours)</td><td/><td>34.78</td><td colspan="2">0.9295</td><td>30.71</td><td>0.8476</td><td>29.35</td><td>0.8104</td><td>28.96</td><td>0.8673</td><td>34.65</td><td>0.9498</td></tr></table>

Average PSNR/SSIM for scale factors ×3 with DN degradation model. Best results are highlighted

Table content: <table><tr><td>Method</td><td>scale</td><td>PSNR</td><td>Set5</td><td>SSIM</td><td colspan="2">Set14 PSNR SSIM</td><td colspan="2">BSDS100 PSNR SSIM</td><td colspan="2">Urban100 PSNR SSIM</td><td colspan="2">Manga109 PSNR SSIM</td></tr><tr><td>Bicubic</td><td/><td>24.01</td><td colspan="2">0.5369</td><td>22.87</td><td>0.4724</td><td>22.92</td><td>0.4449</td><td>21.63</td><td>0.4687</td><td>23.01</td><td>0.5381</td></tr><tr><td>SRCNN</td><td/><td>25.01</td><td colspan="2">0.6950</td><td>23.78</td><td>0.5898</td><td>23.76</td><td>0.5538</td><td>21.90</td><td>0.5737</td><td>23.75</td><td>0.7148</td></tr><tr><td>VDSR</td><td/><td>25.20</td><td colspan="2">0.7183</td><td>24.00</td><td>0.6112</td><td>24.00</td><td>0.5749</td><td>22.22</td><td>0.6096</td><td>24.20</td><td>0.7525</td></tr><tr><td>IRCNN_G</td><td/><td>25.70</td><td colspan="2">0.7379</td><td>24.45</td><td>0.6305</td><td>24.28</td><td>0.5900</td><td>22.90</td><td>0.6429</td><td>24.88</td><td>0.7765</td></tr><tr><td>IRCNN_C</td><td>×3</td><td>27.48</td><td colspan="2">0.7925</td><td>25.92</td><td>0.6932</td><td>25.55</td><td>0.6481</td><td>23.93</td><td>23.93</td><td>26.07</td><td>0.8253</td></tr><tr><td>RDN</td><td/><td>28.46</td><td colspan="2">0.8151</td><td>26.60</td><td>0.7101</td><td>25.93</td><td>0.6573</td><td>24.92</td><td>0.7362</td><td>28.00</td><td>0.8590</td></tr><tr><td>SRFBN</td><td/><td>28.53</td><td colspan="2">0.8182</td><td>26.60</td><td>0.7144</td><td>25.95</td><td>0.6625</td><td>24.99</td><td>0.7424</td><td>28.02</td><td>0.8618</td></tr><tr><td>SRGRN(ours)</td><td/><td>28.62</td><td colspan="2">0.8195</td><td>26.66</td><td>0.7151</td><td>25.99</td><td>0.6632</td><td>25.14</td><td>0.7462</td><td>28.11</td><td>0.8642</td></tr><tr><td>SRGRN+(ours)</td><td/><td>28.67</td><td colspan="2">0.8206</td><td>26.73</td><td>0.7168</td><td>26.07</td><td>0.6645</td><td>25.31</td><td>0.7496</td><td>28.31</td><td>0.8674</td></tr></table>

Peer review (iclr2020):
Summary This paper conducts research on image super resolution by addressing the problem of limited receptive field. The paper proposes two modules: GRUM (global reasoning upsample module) and GRRB (global reasoning reconstruction module), constructing a graph model based on different regions of an image and reasoning the relationships between them. This work has the potential to be a good publication, but I lean to reject this paper for now since it is not ready yet. Strengths - Doing image super resolution using graph model is novel. By building a graph with vertices of regions of an image, it is theoretically possible to address the problem of limited receptive field of CNN. Weaknesses - The designs of the two modules are not convincing. It is not clear to me why they are designed in this way. In other words, the authors stated that they are simulating the reasoning process of the human visual system, but I do not understand how GRUM and GRRB simulate the human visual system. - Section 3 is not reader-friendly. It is difficult to understand what is happening in these two modules by reading section 3. - The performance improvement is not significant. As the author listed in Table 3 and 4, the performance improvement is minor (roughly 1%?), which is not significant enough. Possible Improvements I would suggest rephrasing section 3, clearly demonstrating how the two modules simulate the human visual system (or why they are designed in this way).