DenseSR: Dense-Feature Restoration

• DenseSR is a family of models that reuse low-, mid-, and high-level features to enhance image quality in tasks like super-resolution and shadow removal.
• The architectures leverage dense connections, adaptive fusion, and residual learning to integrate hierarchical information effectively.
• Empirical evaluations underscore that removing dense or residual pathways sharply degrades performance, as measured by PSNR and SSIM.

DenseSR denotes a class of dense-connection image restoration architectures centered on intensive hierarchical feature reuse. In the supplied literature, the term is used most often for single-image super-resolution (SISR) models derived from or compared against the Residual Dense Network (RDN), and it is also reused for a later image shadow removal framework formulated as dense prediction (Zhang et al., 2018, Lu et al., 2020, Lin et al., 22 Jul 2025). Across these usages, the common design premise is that dense or adaptively dense connectivity should preserve low-level, mid-level, and high-level information more effectively than purely feed-forward or shallow residual pipelines.

1. Terminology and scope

The label “DenseSR” is not attached to a single universally fixed architecture in the supplied record. Instead, it refers to several dense-feature restoration models that share an emphasis on feature concatenation, feature fusion, residual learning, or dense prediction.

Usage	Task	Defining components
Residual Dense Network (RDN)	Single-image super-resolution	SFE, RDBs, DFF, PixelShuffle
Dense U-net / DenseSR / DenseSR+	Single-image super-resolution	Dense U-net, shuffle-pooling, mixed loss
DenseSR	Image shadow removal	Swin-based encoder-decoder, SIM, DFB

Within SISR, the most recurrent formulation is the RDN introduced in “Residual Dense Network for Image Super-Resolution” (Zhang et al., 2018) and re-examined in “Ultra Sharp : Study of Single Image Super Resolution using Residual Dense Network” (Gunasekaran, 2023). Related dense SR variants include “Adaptive Densely Connected Super-Resolution Reconstruction,” which replaces fixed dense fusion with adaptive dense connections and an adaptive feature sub-pixel reconstruction layer (Xie et al., 2019), and “Image Superresolution using Scale-Recurrent Dense Network,” which reuses dense blocks across scales and extends them to Multi-Residual Dense Blocks (Purohit et al., 2022). By contrast, the later “DenseSR: Image Shadow Removal as Dense Prediction” is not a super-resolution model; it treats shadow removal as pixel-wise restoration with scene priors and a dense fusion decoder (Lin et al., 22 Jul 2025).

A common misconception is therefore terminological rather than architectural: DenseSR is not a single benchmark model name with invariant structure. The supplied literature shows that it functions as a family label spanning multiple dense-feature restoration strategies.

2. Residual dense super-resolution as the core formulation

The canonical DenseSR formulation in the supplied SISR literature is the RDN. It is organized into four cascaded modules: Shallow Feature Extraction, a cascade of Residual Dense Blocks, Dense Feature Fusion, and an upsampling module via sub-pixel convolution (Zhang et al., 2018, Gunasekaran, 2023).

The shallow stage applies two $3\times 3$ convolutions to the bicubic-downsampled low-resolution input: $$F_{-1} = \mathrm{Conv}_1(\mathrm{Img}_{LR}), \qquad F_0 = \mathrm{Conv}_2(F_{-1}).$$ Here $F_0$ is passed both into the first RDB and, through a skip path, to the global fusion stage. This placement is important because the architecture explicitly preserves access to original low-level LR features rather than forcing all downstream processing to rely only on progressively transformed states.

Each RDB contains $C$ densely connected convolutional layers with growth rate $G$, followed by local feature fusion through a $1\times 1$ convolution and a local residual connection. Inside block $d$, layer $l$ is defined as

$$F_{d,l} = \mathrm{ReLU}\!\left(W_{d,l} * [F_{d-1}, F_{d,1}, \dots, F_{d,l-1}] \right),$$

where $[\cdot]$ denotes channel-wise concatenation. Local feature fusion compresses the concatenated state back to $$F_{-1} = \mathrm{Conv}_1(\mathrm{Img}_{LR}), \qquad F_0 = \mathrm{Conv}_2(F_{-1}).$$0 channels,

$$F_{-1} = \mathrm{Conv}_1(\mathrm{Img}_{LR}), \qquad F_0 = \mathrm{Conv}_2(F_{-1}).$$1

and local residual learning yields

$$F_{-1} = \mathrm{Conv}_1(\mathrm{Img}_{LR}), \qquad F_0 = \mathrm{Conv}_2(F_{-1}).$$2

The original RDN description further characterizes this internal mechanism as combining contiguous memory, local dense connections, local feature fusion, and local residual learning (Zhang et al., 2018). Contiguous memory means that the state of the preceding RDB is directly connected to all layers of the current RDB, so the block has simultaneous access to prior block output and newly generated local features.

After $$F_{-1} = \mathrm{Conv}_1(\mathrm{Img}_{LR}), \qquad F_0 = \mathrm{Conv}_2(F_{-1}).$$3 RDBs, the model applies Dense Feature Fusion. All block outputs are concatenated, reduced by a $$F_{-1} = \mathrm{Conv}_1(\mathrm{Img}_{LR}), \qquad F_0 = \mathrm{Conv}_2(F_{-1}).$$4 convolution, refined by a $$F_{-1} = \mathrm{Conv}_1(\mathrm{Img}_{LR}), \qquad F_0 = \mathrm{Conv}_2(F_{-1}).$$5 convolution, and combined with the shallow feature by a global residual link: $$F_{-1} = \mathrm{Conv}_1(\mathrm{Img}_{LR}), \qquad F_0 = \mathrm{Conv}_2(F_{-1}).$$6

$$F_{-1} = \mathrm{Conv}_1(\mathrm{Img}_{LR}), \qquad F_0 = \mathrm{Conv}_2(F_{-1}).$$7

Upsampling is deferred to the end and performed by sub-pixel convolution (“PixelShuffle”) for factors $$F_{-1} = \mathrm{Conv}_1(\mathrm{Img}_{LR}), \qquad F_0 = \mathrm{Conv}_2(F_{-1}).$$8, $$F_{-1} = \mathrm{Conv}_1(\mathrm{Img}_{LR}), \qquad F_0 = \mathrm{Conv}_2(F_{-1}).$$9, or $F_0$0. The supplied summary explicitly notes that all feature extraction occurs in LR space before upsampling, which keeps computation efficient prior to reconstruction (Gunasekaran, 2023).

The architectural significance of this design is that hierarchical features are reused at multiple granularities. The cascade of RDBs extracts progressively more abstract features, while dense connections inside each block ensure that low-level, mid-level, and high-level features are all reused. Local residual links and the global residual link create short paths for feature reuse and gradient back-propagation, mitigating vanishing-gradient issues even in a very deep network (Gunasekaran, 2023).

3. Optimization, evaluation, and ablation in RDN-based DenseSR

RDN-based DenseSR is trained with an $F_0$1 reconstruction objective between predicted and ground-truth HR images: $F_0$2 Evaluation uses PSNR and SSIM, with

$F_0$3

The “Ultra Sharp” study reports Adam optimization with $F_0$4, $F_0$5, $F_0$6, initial learning rate $F_0$7, halved every 15 epochs, batch size 8 for training and 4 for testing, and training for approximately 200 epochs on DIV2K (Gunasekaran, 2023). The original RDN summary reports $F_0$8 loss, Adam with learning rate $F_0$9 halved every 200 epochs, randomly cropped $C$0 LR patches, removal of BatchNorm and pooling, and a self-ensemble variant RDN+ (Zhang et al., 2018).

The quantitative behavior reported for the Gunasekaran study follows the expected difficulty progression with scale factor. On a DIV2K-trained model, $C$1 super-resolution yields Set5 $C$2 / $C$3, Set14 $C$4 / $C$5, and Urban100 $C$6 / $C$7. At $C$8, the values drop to Set5 $C$9 / $G$0, Set14 $G$1 / $G$2, and Urban100 $G$3 / $G$4. At $G$5, they further drop to Set5 $G$6 / $G$7, Set14 $G$8 / $G$9, and Urban100 $1\times 1$0 / $1\times 1$1 (Gunasekaran, 2023). The same study compares its $1\times 1$2 RDN against MemNet, Laplacian SR, and SRCNN under the same training setup, with RDN reporting Set5 $1\times 1$3, Set14 $1\times 1$4, and Urban100 $1\times 1$5, versus MemNet $1\times 1$6, $1\times 1$7, $1\times 1$8, Laplacian SR $1\times 1$9, $d$0, $d$1, and SRCNN $d$2, $d$3, $d$4 (Gunasekaran, 2023).

The original RDN paper reports stronger benchmark numbers under its own BI setting, for example on Set5: $d$5 at $d$6, $d$7 at $d$8, and $d$9 at $l$0, with similar top or tied trends on Set14, B100, Urban100, and Manga109 (Zhang et al., 2018). It also reports favorable performance under BD and DN degradation, including Set5 BD $l$1: RDN $l$2, and Set5 DN $l$3: RDN $l$4 (Zhang et al., 2018). These differing numbers should not be conflated, because the supplied papers describe different degradation models and training protocols.

Ablation results in the Gunasekaran study isolate the importance of the dense and residual pathways. On Set5 at $l$5, the baseline RDN gives $l$6. Removing the global residual yields $l$7, removing local dense connections yields $l$8, and removing local residual learning yields $l$9 (Gunasekaran, 2023). This directly supports the claim that model complexity is not incidental: the dense and residual paths are structurally critical to reconstruction quality.

4. Major dense super-resolution variants

Several later SISR models retain the dense-feature premise while altering the connectivity, the reconstruction head, or the scale handling.

“Adaptive Densely Connected Super-Resolution Reconstruction” decomposes the network into SKIP and BODY branches whose outputs are summed as $$F_{d,l} = \mathrm{ReLU}\!\left(W_{d,l} * [F_{d-1}, F_{d,1}, \dots, F_{d,l-1}] \right),$$0 (Xie et al., 2019). The SKIP branch is a global sub-pixel convolution path intended to reconstruct low-frequency content, while the BODY branch contains a shallow feature extractor, $$F_{d,l} = \mathrm{ReLU}\!\left(W_{d,l} * [F_{d-1}, F_{d,1}, \dots, F_{d,l-1}] \right),$$1 adaptive dense residual units, global feature fusion, and an adaptive feature sub-pixel reconstruction layer. The adaptive dense residual block replaces fixed dense aggregation with learnable scalar weights: $$F_{d,l} = \mathrm{ReLU}\!\left(W_{d,l} * [F_{d-1}, F_{d,1}, \dots, F_{d,l-1}] \right),$$2 followed by $$F_{d,l} = \mathrm{ReLU}\!\left(W_{d,l} * [F_{d-1}, F_{d,1}, \dots, F_{d,l-1}] \right),$$3 fusion and residual addition. After GFF, the AFSL uses four parallel sub-pixel convolutions with kernel sizes 3, 5, 7, and 9, concatenates them, and projects to three channels (Xie et al., 2019). Training uses $$F_{d,l} = \mathrm{ReLU}\!\left(W_{d,l} * [F_{d-1}, F_{d,1}, \dots, F_{d,l-1}] \right),$$4 loss only, with no extra regularization term. The paper reports that pre-training SKIP improves convergence speed and final PSNR by approximately $$F_{d,l} = \mathrm{ReLU}\!\left(W_{d,l} * [F_{d-1}, F_{d,1}, \dots, F_{d,l-1}] \right),$$5 on B100, and at scale $$F_{d,l} = \mathrm{ReLU}\!\left(W_{d,l} * [F_{d-1}, F_{d,1}, \dots, F_{d,l-1}] \right),$$6 ADCSR reports Set5 $$F_{d,l} = \mathrm{ReLU}\!\left(W_{d,l} * [F_{d-1}, F_{d,1}, \dots, F_{d,l-1}] \right),$$7, Set14 $$F_{d,l} = \mathrm{ReLU}\!\left(W_{d,l} * [F_{d-1}, F_{d,1}, \dots, F_{d,l-1}] \right),$$8, B100 $$F_{d,l} = \mathrm{ReLU}\!\left(W_{d,l} * [F_{d-1}, F_{d,1}, \dots, F_{d,l-1}] \right),$$9, Urban100 $[\cdot]$0, and Manga109 $[\cdot]$1, with ADCSR$[\cdot]$2 slightly higher (Xie et al., 2019).

“Dense U-net for super-resolution with shuffle pooling layer” reformulates DenseSR around a modified U-net with dense blocks and a new down-sampling operation (Lu et al., 2020). Standard max- or average-pooling is replaced by shuffle-pooling, which rearranges pixels into extra channels: $[\cdot]$3 The encoder uses dense blocks with bottleneck $[\cdot]$4 convolutions and growth rate $[\cdot]$5, the decoder concatenates all encoder feature maps from depths $[\cdot]$6, and training uses a mixed loss

$[\cdot]$7

with $[\cdot]$8 (Lu et al., 2020). On scale $[\cdot]$9, DenseSR reports SET14 $$F_{-1} = \mathrm{Conv}_1(\mathrm{Img}_{LR}), \qquad F_0 = \mathrm{Conv}_2(F_{-1}).$$00, BSD300 $$F_{-1} = \mathrm{Conv}_1(\mathrm{Img}_{LR}), \qquad F_0 = \mathrm{Conv}_2(F_{-1}).$$01, and ICDAR2003 $$F_{-1} = \mathrm{Conv}_1(\mathrm{Img}_{LR}), \qquad F_0 = \mathrm{Conv}_2(F_{-1}).$$02, while DenseSR$$F_{-1} = \mathrm{Conv}_1(\mathrm{Img}_{LR}), \qquad F_0 = \mathrm{Conv}_2(F_{-1}).$$03 reports $$F_{-1} = \mathrm{Conv}_1(\mathrm{Img}_{LR}), \qquad F_0 = \mathrm{Conv}_2(F_{-1}).$$04, $$F_{-1} = \mathrm{Conv}_1(\mathrm{Img}_{LR}), \qquad F_0 = \mathrm{Conv}_2(F_{-1}).$$05, and $$F_{-1} = \mathrm{Conv}_1(\mathrm{Img}_{LR}), \qquad F_0 = \mathrm{Conv}_2(F_{-1}).$$06, respectively (Lu et al., 2020). The paper also attributes a $$F_{-1} = \mathrm{Conv}_1(\mathrm{Img}_{LR}), \qquad F_0 = \mathrm{Conv}_2(F_{-1}).$$07 PSNR gain on SET14 $$F_{-1} = \mathrm{Conv}_1(\mathrm{Img}_{LR}), \qquad F_0 = \mathrm{Conv}_2(F_{-1}).$$08 to insertive shuffle-pooling and a further $$F_{-1} = \mathrm{Conv}_1(\mathrm{Img}_{LR}), \qquad F_0 = \mathrm{Conv}_2(F_{-1}).$$09 to the mixed loss (Lu et al., 2020).

“Image Superresolution using Scale-Recurrent Dense Network” introduces recurrence across scales, with shared weights repeatedly applied from LR $$F_{-1} = \mathrm{Conv}_1(\mathrm{Img}_{LR}), \qquad F_0 = \mathrm{Conv}_2(F_{-1}).$$10 and $$F_{-1} = \mathrm{Conv}_1(\mathrm{Img}_{LR}), \qquad F_0 = \mathrm{Conv}_2(F_{-1}).$$11 (Purohit et al., 2022). Its Multi-Residual Dense Blocks add extra $$F_{-1} = \mathrm{Conv}_1(\mathrm{Img}_{LR}), \qquad F_0 = \mathrm{Conv}_2(F_{-1}).$$12 residual paths from the block input to each intermediate layer, and training can combine pixel loss, VGG perceptual loss, and GAN loss: $$F_{-1} = \mathrm{Conv}_1(\mathrm{Img}_{LR}), \qquad F_0 = \mathrm{Conv}_2(F_{-1}).$$13 The supplied summary reports that MRDN has approximately $$F_{-1} = \mathrm{Conv}_1(\mathrm{Img}_{LR}), \qquad F_0 = \mathrm{Conv}_2(F_{-1}).$$14 trainable parameters, compared with approximately $$F_{-1} = \mathrm{Conv}_1(\mathrm{Img}_{LR}), \qquad F_0 = \mathrm{Conv}_2(F_{-1}).$$15 for RDN and approximately $$F_{-1} = \mathrm{Conv}_1(\mathrm{Img}_{LR}), \qquad F_0 = \mathrm{Conv}_2(F_{-1}).$$16 for EDSR, and that for $$F_{-1} = \mathrm{Conv}_1(\mathrm{Img}_{LR}), \qquad F_0 = \mathrm{Conv}_2(F_{-1}).$$17 and $$F_{-1} = \mathrm{Conv}_1(\mathrm{Img}_{LR}), \qquad F_0 = \mathrm{Conv}_2(F_{-1}).$$18 it remains within $$F_{-1} = \mathrm{Conv}_1(\mathrm{Img}_{LR}), \qquad F_0 = \mathrm{Conv}_2(F_{-1}).$$19–$$F_{-1} = \mathrm{Conv}_1(\mathrm{Img}_{LR}), \qquad F_0 = \mathrm{Conv}_2(F_{-1}).$$20 of RDN with roughly $$F_{-1} = \mathrm{Conv}_1(\mathrm{Img}_{LR}), \qquad F_0 = \mathrm{Conv}_2(F_{-1}).$$21 fewer parameters (Purohit et al., 2022). At $$F_{-1} = \mathrm{Conv}_1(\mathrm{Img}_{LR}), \qquad F_0 = \mathrm{Conv}_2(F_{-1}).$$22, the same summary states that it trades approximately $$F_{-1} = \mathrm{Conv}_1(\mathrm{Img}_{LR}), \qquad F_0 = \mathrm{Conv}_2(F_{-1}).$$23 for a greater-than-$$F_{-1} = \mathrm{Conv}_1(\mathrm{Img}_{LR}), \qquad F_0 = \mathrm{Conv}_2(F_{-1}).$$24 parameter reduction compared to EDSR (Purohit et al., 2022).

Taken together, these variants show that dense SR research has explored at least four distinct strategies: fixed dense fusion, adaptive dense weighting, dense U-net aggregation with information-preserving down-sampling, and recurrent reuse of dense blocks across scales.

5. DenseSR as dense prediction for image shadow removal

The 2025 paper “DenseSR: Image Shadow Removal as Dense Prediction” reuses the DenseSR label for a different restoration problem (Lin et al., 22 Jul 2025). Here the task is single-image shadow removal rather than super-resolution, and the architecture is a U-Net–style encoder-decoder with Swin Transformer blocks, Scene-Integrated Modules in the encoder, and a custom Dense Fusion Block in the decoder.

The model learns a pixel-wise mapping

$$F_{-1} = \mathrm{Conv}_1(\mathrm{Img}_{LR}), \qquad F_0 = \mathrm{Conv}_2(F_{-1}).$$25

with the final output defined by a global residual formulation,

$$F_{-1} = \mathrm{Conv}_1(\mathrm{Img}_{LR}), \qquad F_0 = \mathrm{Conv}_2(F_{-1}).$$26

Its encoder is guided by pretrained geometric and semantic priors: depth $$F_{-1} = \mathrm{Conv}_1(\mathrm{Img}_{LR}), \qquad F_0 = \mathrm{Conv}_2(F_{-1}).$$27 from Depth-Anything V2, derived normal maps $$F_{-1} = \mathrm{Conv}_1(\mathrm{Img}_{LR}), \qquad F_0 = \mathrm{Conv}_2(F_{-1}).$$28, and multi-scale DINO-V2 features $$F_{-1} = \mathrm{Conv}_1(\mathrm{Img}_{LR}), \qquad F_0 = \mathrm{Conv}_2(F_{-1}).$$29. In each Scene-Integrated Module, window-based self-attention is modulated by prior-based similarity,

$$F_{-1} = \mathrm{Conv}_1(\mathrm{Img}_{LR}), \qquad F_0 = \mathrm{Conv}_2(F_{-1}).$$30

where $$F_{-1} = \mathrm{Conv}_1(\mathrm{Img}_{LR}), \qquad F_0 = \mathrm{Conv}_2(F_{-1}).$$31 is a semantic similarity map and $$F_{-1} = \mathrm{Conv}_1(\mathrm{Img}_{LR}), \qquad F_0 = \mathrm{Conv}_2(F_{-1}).$$32 is a geometric consistency map (Lin et al., 22 Jul 2025).

The Dense Fusion Block splits decoding into two complementary submodules. The Adaptive Content Smoothing Module applies a dynamic $$F_{-1} = \mathrm{Conv}_1(\mathrm{Img}_{LR}), \qquad F_0 = \mathrm{Conv}_2(F_{-1}).$$33 low-pass kernel to the coarse decoder feature, with per-pixel weights normalized by channel-wise softmax. The Texture-Boundary Recuperation Module predicts a $$F_{-1} = \mathrm{Conv}_1(\mathrm{Img}_{LR}), \qquad F_0 = \mathrm{Conv}_2(F_{-1}).$$34 low-pass kernel, inverts it into a high-pass filter,

$$F_{-1} = \mathrm{Conv}_1(\mathrm{Img}_{LR}), \qquad F_0 = \mathrm{Conv}_2(F_{-1}).$$35

extracts high-frequency detail from the skip feature, and adds it back residually (Lin et al., 22 Jul 2025). The two outputs are then refined by CARAFE and merged by element-wise addition: $$F_{-1} = \mathrm{Conv}_1(\mathrm{Img}_{LR}), \qquad F_0 = \mathrm{Conv}_2(F_{-1}).$$36

Training uses the Charbonnier loss

$$F_{-1} = \mathrm{Conv}_1(\mathrm{Img}_{LR}), \qquad F_0 = \mathrm{Conv}_2(F_{-1}).$$37

The paper reports experiments on ISTD, ISTD+, SRD, WSRD+, and INS, with random $$F_{-1} = \mathrm{Conv}_1(\mathrm{Img}_{LR}), \qquad F_0 = \mathrm{Conv}_2(F_{-1}).$$38 crops, PyTorch on 4 RTX 4090 GPUs, batch size 3, 1,400 epochs, AdamW, and initial learning rate $$F_{-1} = \mathrm{Conv}_1(\mathrm{Img}_{LR}), \qquad F_0 = \mathrm{Conv}_2(F_{-1}).$$39 with cosine annealing to $$F_{-1} = \mathrm{Conv}_1(\mathrm{Img}_{LR}), \qquad F_0 = \mathrm{Conv}_2(F_{-1}).$$40 (Lin et al., 22 Jul 2025). Reported results include ISTD $$F_{-1} = \mathrm{Conv}_1(\mathrm{Img}_{LR}), \qquad F_0 = \mathrm{Conv}_2(F_{-1}).$$41, SSIM $$F_{-1} = \mathrm{Conv}_1(\mathrm{Img}_{LR}), \qquad F_0 = \mathrm{Conv}_2(F_{-1}).$$42, and WSRD+ $$F_{-1} = \mathrm{Conv}_1(\mathrm{Img}_{LR}), \qquad F_0 = \mathrm{Conv}_2(F_{-1}).$$43, SSIM $$F_{-1} = \mathrm{Conv}_1(\mathrm{Img}_{LR}), \qquad F_0 = \mathrm{Conv}_2(F_{-1}).$$44. With ground-truth masks (“+GM”), the mask-free DenseSR still reports PSNR $$F_{-1} = \mathrm{Conv}_1(\mathrm{Img}_{LR}), \qquad F_0 = \mathrm{Conv}_2(F_{-1}).$$45 on ISTD (Lin et al., 22 Jul 2025). The same source states that removing priors or replacing the DFB with standard fusion degrades PSNR by up to $$F_{-1} = \mathrm{Conv}_1(\mathrm{Img}_{LR}), \qquad F_0 = \mathrm{Conv}_2(F_{-1}).$$46, and that removing ACSM or TBRM individually also lowers performance.

This later usage broadens the meaning of DenseSR. The shared concept is still dense restoration, but the mechanism is no longer residual dense convolutional reuse in LR space; it is prior-guided dense prediction with adaptive content/detail routing in the decoder.

6. Limitations, trade-offs, and interpretive significance

The supplied SISR literature identifies several recurring limitations. First, performance degrades as the scale factor increases; the Gunasekaran study states explicitly that $$F_{-1} = \mathrm{Conv}_1(\mathrm{Img}_{LR}), \qquad F_0 = \mathrm{Conv}_2(F_{-1}).$$47 is notably harder than $$F_{-1} = \mathrm{Conv}_1(\mathrm{Img}_{LR}), \qquad F_0 = \mathrm{Conv}_2(F_{-1}).$$48 (Gunasekaran, 2023). Second, removing dense or residual paths sharply degrades quality, as shown by the large ablation drops in RDN (Gunasekaran, 2023). Third, depth, width, and growth rate are tied to training and inference cost; the same study states that the number of RDBs and the growth rate trade off accuracy against training/inference cost, and that larger RDNs promise further gains but at higher resource cost because the current implementation is limited by GPU time (Gunasekaran, 2023).

Adaptive dense designs introduce a different trade-off profile. ADCSR reports that AFSL adds negligible extra FLOPs and parameters relative to simpler reconstruction heads—$$F_{-1} = \mathrm{Conv}_1(\mathrm{Img}_{LR}), \qquad F_0 = \mathrm{Conv}_2(F_{-1}).$$49 versus $$F_{-1} = \mathrm{Conv}_1(\mathrm{Img}_{LR}), \qquad F_0 = \mathrm{Conv}_2(F_{-1}).$$50, and $$F_{-1} = \mathrm{Conv}_1(\mathrm{Img}_{LR}), \qquad F_0 = \mathrm{Conv}_2(F_{-1}).$$51 versus $$F_{-1} = \mathrm{Conv}_1(\mathrm{Img}_{LR}), \qquad F_0 = \mathrm{Conv}_2(F_{-1}).$$52—while still surpassing AWMS by approximately $$F_{-1} = \mathrm{Conv}_1(\mathrm{Img}_{LR}), \qquad F_0 = \mathrm{Conv}_2(F_{-1}).$$53 on B100 and Urban100 (Xie et al., 2019). The same paper argues that adaptive dense connections more effectively fuse multi-level features than fixed dense or residual links, but this benefit depends on additional learned gating and branch structure (Xie et al., 2019). Scale-recurrent dense models pursue the opposite direction: fewer parameters through weight sharing, with some loss at harder scales (Purohit et al., 2022).

A plausible implication is that DenseSR should be understood less as a single architecture than as a design space organized around three questions: how hierarchical features are reused, where residual pathways are inserted, and whether the dense interaction is fixed, adaptive, recurrent, or decoder-specific. In SISR, this space runs from RDN’s local/global fusion to adaptive dense weighting and scale recurrence; in shadow removal, it extends to dense prediction with geometry-semantic priors and dual-path decoder fusion (Zhang et al., 2018, Xie et al., 2019, Purohit et al., 2022, Lin et al., 22 Jul 2025). The continuity lies in the treatment of restoration as a multi-level feature integration problem rather than in any single backbone definition.