Pith. sign in

REVIEW 4 major objections 4 minor 46 references

SROBB: Targeted Perceptual Loss for Single Image Super-Resolution

T0 review · 4 major / 4 minor · reviewed 2026-08-14 · deepseek-v4-flash

Pith's one-line read Single-image super-resolution produces sharper edges and more realistic textures when the perceptual loss is computed separately for boundary, background, and object regions instead of uniformly over the whole image.

desk verdict Genuinely new training-time semantic prior for super-resolution, but the evaluation is too narrow and under-powered to support the claimed across-the-board superiority. read the letter →

arxiv 1908.07222 v1 pith:DBL7WEDE submitted 2019-08-20 cs.CV

classification cs.CV
keywords singleimagesuper-resolutionperceptuallosssemanticsegmentationOBBlabelsgenerativeadversarialnetworktexturesynthesisuserstudy
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

Standard super-resolution training compares the restored image with the high-resolution original in a deep feature space using the same perceptual loss everywhere, which ignores that edges and textures need different kinds of supervision. This paper proposes a targeted perceptual loss that separates each image into object, background, and boundary regions, and penalizes boundaries with early low-level features, backgrounds with mid-level texture features, and object interiors not at all. The region masks, called OBB labels, are derived from segmentation annotations and used only during training, so the trained network runs without any segmentation input at test time. The paper reports that this targeted objective produces sharper edges and more natural textures, and that users prefer it over uniform perceptual loss and over several state-of-the-art super-resolution systems.

What carries the argument

The central object is the OBB label, a three-region mask built from segmentation annotations: the boundary class is obtained by detecting edges between labeled classes and dilating them into a strip, the background class groups the 'sky', 'plant', 'ground', and 'water' classes, and everything else is the object class. These masks enter the targeted perceptual loss $$\mathcal{L}_{\mathrm{perc}} = \$\alpha$\, G_e($I^{{\mathrm{SR}}$}\circ $M^{{\mathrm{boundary}}$}_{\mathrm{OBB}}, $I^{{\mathrm{HR}}$}\circ $M^{{\mathrm{boundary}}$}_{\mathrm{OBB}}) + \$\beta$\, G_b($I^{{\mathrm{SR}}$}\circ $M^{{\mathrm{background}}$}_{\mathrm{OBB}}, $I^{{\mathrm{HR}}$}\circ $M^{{\mathrm{background}}$}_{\mathrm{OBB}}),$$ with the object-term weight set to zero. Here $G_e$ is the feature distance at the early ReLU 2-2 layer of the pre-trained classification network and $G_b$ is the feature distance at the mid-level ReLU 4-3 layer. Because the same mask is applied to both the super-resolved and the high-resolution image, any artificial edges created by masking cancel out, and the computed feature distance is localized to the region being supervised.

What would settle it

A controlled ablation that swaps the two feature-layer assignments, mid-level features on boundaries and early features on backgrounds, while keeping every other loss and hyperparameter fixed would settle the claim: if the original SROBB configuration does not win the user study against this swapped version, the specific layer-to-region mapping is not what drives the improvement.

Watch

Extended reading notes

Core claim

The paper's central claim is that super-resolution quality improves when the perceptual loss is partitioned by semantic region: the same pre-trained network's low-level features are used to judge object-background boundaries, its mid-level features are used to judge background textures, and object interiors are excluded from perceptual supervision. The authors derive the partition from segmentation labels by turning class edges into dilated boundary strips and grouping a fixed set of stuff classes (sky, plant, ground, water) as background. They train a generative adversarial super-resolution decoder with this targeted loss together with pixel-wise and adversarial losses, and report that the resulting images have sharper edges and more realistic textures than those from uniform perceptual loss and from several recent super-resolution methods. The supporting evidence is qualitative comparison plus two user studies: one against other methods and one ablating the targeted loss against the standard perceptual loss.

Load-bearing premise

The load-bearing premise is that the early ReLU 2-2 layer is the right feature space for judging boundary sharpness and the mid-level ReLU 4-3 layer is the right feature space for judging background texture; the paper supports this choice with a single qualitative comparison rather than a quantitative study.

Editorial extensions

If this is right

  • A super-resolution system can be trained once on segmentation-annotated data and then run at test time with no segmentation network and no semantic input, because the OBB labels are used only in the loss.
  • Switching from a uniform whole-image perceptual loss to the same loss applied only to boundary and background regions is enough to shift user preference, so objective-function design can capture semantic priors without changing the decoder architecture.
  • Distortion metrics such as PSNR and SSIM can move in the opposite direction from perceived quality: the baboon example shows lower PSNR and SSIM for SROBB than for baselines while users prefer it.
  • The trained model generalizes to benchmark images without outdoor backgrounds, suggesting the boundary and background supervision transfers beyond the training label distribution.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • Inference: the region-to-layer mapping need not be fixed; a learned assignment from segmentation classes to feature depths could replace the hand-picked ReLU 2-2 and ReLU 4-3 choice and might improve robustness on categories not in the background list.
  • Inference: because the loss is agnostic to the generator architecture, the targeted perceptual term could be stacked onto stronger decoders than the SRGAN backbone used here and would likely combine with architectural gains.
  • Inference: a direct quantitative test of boundary sharpness, such as edge-profile width or gradient statistics on the boundary strip, would complement the user studies and reveal whether the perceptual wins come from edges, textures, or both.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

4 major / 4 minor

Summary. The paper proposes SROBB, a single-image super-resolution method that augments the SRGAN objective with a targeted perceptual loss. Using segmentation labels (from COCO-Stuff), the method partitions each image into background, boundary, and object regions, and applies different VGG feature layers to each: low-level ReLU 2-2 features for boundary sharpness and mid-level ReLU 4-3 features for background texture, while applying no perceptual loss to object regions. The decoder is the same SRGAN generator, trained with MSE, adversarial, and the proposed targeted perceptual loss. The authors report qualitative results on Set5/Set14 and COCO-Stuff, quantitative metrics on two benchmark images, and two user studies favoring SROBB over RCAN, SRGAN, SFT-GAN, and ESRGAN. The central claim is that the method produces more realistic textures and sharper edges and outperforms state-of-the-art methods both on standard benchmarks and in user studies.

Significance. The underlying idea of semantic-aware, spatially targeted perceptual losses is reasonable and potentially useful: it avoids penalizing object interiors with inappropriate feature statistics and matches feature level to region content. The paper also demonstrates a practical advantage: unlike SFT-GAN, the method requires no segmentation input at test time, and the user-study vote margins are large (617 vs. 436 votes for the nearest competitor). If properly supported, the approach would be a credible contribution to perceptual SR. However, the current evidence does not establish the claimed across-the-board superiority on standard benchmarks, and the evaluation has in-distribution and statistical-rigor issues.

major comments (4)
  1. [Sec. 4.2.1, Table 1, Fig. 5] The abstract claims that the method outperforms state-of-the-art algorithms on standard benchmarks, but the quantitative evidence on Set5 and Set14 is limited to two images (baby and baboon), and Table 1 does not show consistent superiority: on baboon, SRGAN achieves better PSNR (19.147 vs. 18.660), better SSIM (0.615 vs. 0.607), and better LPIPS (0.220 vs. 0.245) than SROBB. No aggregate PSNR, SSIM, or LPIPS values are reported for the full Set5 or Set14 datasets, and no user study is performed on standard benchmark images. The claim of outperformance on standard benchmarks therefore rests on a subjective reading of two examples and is not quantitatively established.
  2. [Sec. 4.3.2 and Sec. 4.3.3] Both user studies are conducted on 35 images from COCO-Stuff selected for outdoor scenes, which directly match the training distribution and contain the background classes (sky, plant, ground, water) used to define the targeted loss. This evaluates in-distribution performance and does not test the generalization claim to standard benchmarks. Furthermore, the studies report only raw aggregate vote counts and percentages, without per-image vote distributions, confidence intervals, or significance tests against chance-level voting, so the reported large margins cannot be assessed statistically.
  3. [Sec. 3.1 and Fig. 2] The mapping from semantic region to VGG feature layer, specifically ReLU 2-2 for boundaries and ReLU 4-3 for background textures, is justified by a single qualitative comparison in Figure 2. Because the entire method depends on this mapping, the authors should provide a quantitative analysis (e.g., reconstruction or perceptual metrics for boundary and background regions across candidate VGG layers) to show that the chosen layers are indeed the most appropriate for each region and that the result is not sensitive to this choice.
  4. [Sec. 4.1] The loss weights alpha, beta, the boundary dilation diameter d1, and the set of background classes are fixed without ablations or sensitivity analysis. The reported improvements could be contingent on these specific choices; the authors should report results for variations of these hyperparameters and for different background class sets to demonstrate robustness.
minor comments (4)
  1. [Sec. 4.3.2] There is a typo in the list of methods: 'SROBBB (ours)' should read 'SROBB (ours)'.
  2. [Sec. 3.1, Eq. (1)] The notation is inconsistent: the loss is introduced as Lperc., and the terms Ge, Gb, Go are used before being formally defined. Please define the feature-distance functions and specify the VGG layers in the equation or immediately after it.
  3. [Sec. 4.3.1] The claim that LPIPS has a similar trend to distortion metrics is made by citing reference [10]; please clarify whether this refers to the cited workshop paper and provide the specific finding.
  4. [Fig. 7 and Fig. 8] The pie charts report percentages without stating the total number of votes represented in each chart; adding the vote counts to the figures would improve clarity.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity: the targeted perceptual loss is defined, trained, and evaluated against external benchmarks and user judgments, with no equation reducing to its inputs.

full rationale

The paper's central contribution is an empirical method: a targeted perceptual loss (Eq. 1) that combines a boundary term using ReLU 2-2, a background term using ReLU 4-3, and no object perceptual term, with hyperparameters alpha and beta set to fixed values chosen during training (Section 4.1). The loss is defined directly in terms of the OBB masks, which are constructed from segmentation labels via standard image-processing operations (derivative and dilation, Section 3.2). No result is 'predicted' from a fitted parameter; the user study (Section 4.3.2) and ablation (Section 4.3.3) compare trained models against external human judgments and against a standard perceptual-loss baseline. The only self-citation is to the authors' prior work [26] 'inspired by' the OBB label construction, but this is not load-bearing: the labeling approach is described in full in Section 3.2 and does not rely on any theorem or uniqueness claim from [26]. The layer-selection choice (ReLU 2-2 vs. ReLU 4-3) is justified by a qualitative figure but is an empirical design decision, not a circularity. Thus the derivation is self-contained with respect to circularity.

Assumptions & free parameters 5 free parameters · 5 assumptions · 0 invented entities

The method introduces no new physical entities. It relies on standard VGG features, a hand-designed label conversion, and hand-tuned loss weights. The main free parameters are the loss weights and mask dilation size; the main assumptions are about VGG layer semantics and the background class list.

free parameters (5)
  • alpha (boundary loss weight) = 2e-6
    Hand-chosen to balance boundary perceptual loss; set in Section 4.1.
  • beta (background loss weight) = 1.5e-6
    Hand-chosen to balance background perceptual loss; set in Section 4.1.
  • d1 (boundary dilation disk diameter) = 2.0
    Hand-chosen to set boundary strip width in OBB label generation; Section 3.2.
  • Background class set = sky, plant, ground, water
    Hand-chosen set of classes considered as background; Section 3.2.
  • VGG layer choices = ReLU 2-2 for boundary, ReLU 4-3 for background
    Chosen by hand based on qualitative observation; Section 3.1 and Figure 2.
assumptions (5)
  • domain assumption VGG-16 feature maps at different layers correspond to different levels of image semantics: early layers for edges, mid-level for textures.
    Section 3.1 and Figure 2; this is a widely used but not formally proven assumption, and the paper relies on it to select layers.
  • domain assumption Applying the same OBB mask to both HR and SR images makes the artificial boundary contribution to the perceptual distance negligible.
    Section 3.1, paragraph after Eq. (1); reasonable but not rigorously tested for non-linear CNN features.
  • ad hoc to paper The four classes sky, plant, ground, water constitute the background for the purpose of texture loss.
    Section 3.2; this is specific to outdoor scenes and chosen by the authors.
  • ad hoc to paper No perceptual loss on object regions is sufficient; background and boundary losses will indirectly improve objects.
    Section 3.1, Object paragraph; the paper provides no direct measurement of object quality improvement.
  • domain assumption User preference is the appropriate ground truth for perceptual quality.
    Section 4.3.2; the paper uses user studies as the primary quantitative evaluation, but the user study itself lacks statistical analysis.

how reviews work

0 comments
Cite this review

Pith. "Pith review of SROBB: Targeted Perceptual Loss for Single Image Super-Resolution." pith.science (2026). https://pith.science/paper/DBL7WEDE

@misc{pith2026190807222,
  author       = {Pith},
  title        = {Pith review of: SROBB: Targeted Perceptual Loss for Single Image Super-Resolution},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/DBL7WEDE}},
  note         = {Machine review of arXiv:1908.07222}
}
read the original abstract

By benefiting from perceptual losses, recent studies have improved significantly the performance of the super-resolution task, where a high-resolution image is resolved from its low-resolution counterpart. Although such objective functions generate near-photorealistic results, their capability is limited, since they estimate the reconstruction error for an entire image in the same way, without considering any semantic information. In this paper, we propose a novel method to benefit from perceptual loss in a more objective way. We optimize a deep network-based decoder with a targeted objective function that penalizes images at different semantic levels using the corresponding terms. In particular, the proposed method leverages our proposed OBB (Object, Background and Boundary) labels, generated from segmentation labels, to estimate a suitable perceptual loss for boundaries, while considering texture similarity for backgrounds. We show that our proposed approach results in more realistic textures and sharper edges, and outperforms other state-of-the-art algorithms in terms of both qualitative results on standard benchmarks and results of extensive user studies.

Figures

Figures reproduced from arXiv: 1908.07222 by the authors.

Figure 1
Figure 1. We propose a method for exploiting the segmentation la [PITH_FULL_IMAGE:figures/full_fig_p001_1.png] view at source ↗
Figure 2
Figure 2. The effect of choosing different CNN layers to estimate [PITH_FULL_IMAGE:figures/full_fig_p003_2.png] view at source ↗
Figure 3
Figure 3. Constructing an OBB label. We assign each area to one [PITH_FULL_IMAGE:figures/full_fig_p004_3.png] view at source ↗
Figures from the paper (5 more)
Figure 4
Figure 4. Figure 4: Schematic diagram of the SR decoder. We train the SR decoder using the targeted perceptual loss alongside with MSE and [PITH_FULL_IMAGE:figures/full_fig_p005_4.png]
Figure 5
Figure 5. Figure 5: Sample results on the “baby” (top) and “baboon” (bottom) images from Set5 [1] and Set14 5 datasets, respectively. From left to [PITH_FULL_IMAGE:figures/full_fig_p006_5.png]
Figure 6
Figure 6. Figure 6: Qualitative results on a subset of the COCO-Stuff dataset [4] images. Cropped regions are zoomed in with a factor of 2 to 5 to [PITH_FULL_IMAGE:figures/full_fig_p007_6.png]
Figure 8
Figure 8. Figure 8: The results of the ablation study showing the effect of [PITH_FULL_IMAGE:figures/full_fig_p008_8.png]
Figure 7
Figure 7. Figure 7: The results of the user study, comparing SROBB [PITH_FULL_IMAGE:figures/full_fig_p008_7.png]

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

46 extracted references · 36 canonical work pages

  1. [1]

    Low-Complexity Single-Image Super-Resolution based on Nonnegative Neighbor Embed- ding

    Marco Bevilacqua, Aline Roumy, Christine Guillemot, and Marie-Line Alberi Morel. Low-Complexity Single-Image Super-Resolution based on Nonnegative Neighbor Embed- ding. In British Machine Vision Conference (BMVC), Guild- ford, Surrey, United Kingdom, Sept. 2012

  2. [2]

    The 2018 PIRM Challenge on Perceptual Image Super-resolution

    Yochai Blau, Roey Mechrez, Radu Timofte, Tomer Michaeli, and Lihi Zelnik-Manor. 2018 PIRM challenge on perceptual image super-resolution. CoRR, abs/1809.07517, 2018

  3. [3]

    Super- resolution with deep convolutional sufficient statistics

    Joan Bruna, Pablo Sprechmann, and Yann LeCun. Super- resolution with deep convolutional sufficient statistics. arXiv preprint arXiv:1511.05666, 2015

  4. [4]

    Holger Caesar, Jasper R. R. Uijlings, and Vittorio Fer- rari. Coco-stuff: Thing and stuff classes in context. 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition, pages 1209–1218, 2016

  5. [5]

    Image super-resolution using deep convolutional net- works

    Chao Dong, Chen Change Loy, Kaiming He, and Xiaoou Tang. Image super-resolution using deep convolutional net- works. IEEE Transactions on Pattern Analysis and Machine Intelligence, 38:295–307, 2014

  6. [6]

    Learning a deep convolutional network for im- age super-resolution

    Chao Dong, Chen Change Loy, Kaiming He, and Xiaoou Tang. Learning a deep convolutional network for im- age super-resolution. In David Fleet, Tomas Pajdla, Bernt Schiele, and Tinne Tuytelaars, editors, Computer Vision – ECCV 2014, pages 184–199, Cham, 2014. Springer Interna- tional Publishing

  7. [7]

    W. Dong, L. Zhang, G. Shi, and X. Wu. Image deblurring and super-resolution by adaptive sparse domain selection and adaptive regularization. IEEE Transactions on Image Pro- cessing, 20(7):1838–1857, July 2011

  8. [8]

    Gatys, Alexander S

    Leon A. Gatys, Alexander S. Ecker, and Matthias Bethge. A neural algorithm of artistic style. CoRR, abs/1508.06576, 2015

Show all 46 references
  1. [9]

    Gatys, Alexander S

    Leon A. Gatys, Alexander S. Ecker, and Matthias Bethge. Texture synthesis and the controlled generation of natu- ral stimuli using convolutional neural networks. CoRR, abs/1505.07376, 2015

  2. [10]

    The unreasonable effectiveness of texture transfer for single image super-resolution

    Muhammad Waleed Gondal, Bernhard Sch ¨olkopf, and Michael Hirsch. The unreasonable effectiveness of texture transfer for single image super-resolution. In ECCV Work- shops, 2018

  3. [11]

    Generative adversarial nets

    Ian Goodfellow, Jean Pouget-Abadie, Mehdi Mirza, Bing Xu, David Warde-Farley, Sherjil Ozair, Aaron Courville, and Yoshua Bengio. Generative adversarial nets. In Z. Ghahra- mani, M. Welling, C. Cortes, N. D. Lawrence, and K. Q. Weinberger, editors, Advances in Neural Informatio...

  4. [12]

    Deep residual learning for image recognition

    Kaiming He, Xiangyu Zhang, Shaoqing Ren, and Jian Sun. Deep residual learning for image recognition. 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), pages 770–778, 2015

  5. [13]

    Identity mappings in deep residual networks

    Kaiming He, Xiangyu Zhang, Shaoqing Ren, and Jian Sun. Identity mappings in deep residual networks. ECCV, 2016

  6. [14]

    Sin- gle image super-resolution from transformed self-exemplars

    Jia-Bin Huang, Abhishek Singh, and Narendra Ahuja. Sin- gle image super-resolution from transformed self-exemplars. In IEEE Conference on Computer Vision and Pattern Recog- nition), 2015

  7. [15]

    Perceptual losses for real-time style transfer and super-resolution

    Justin Johnson, Alexandre Alahi, and Li Fei-Fei. Perceptual losses for real-time style transfer and super-resolution. In ECCV, 2016

  8. [16]

    Accu- rate image super-resolution using very deep convolutional networks

    Jiwon Kim, Jung Kwon Lee, and Kyoung Mu Lee. Accu- rate image super-resolution using very deep convolutional networks. 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), pages 1646–1654, 2015

  9. [17]

    Deeply- recursive convolutional network for image super-resolution

    Jiwon Kim, Jung Kwon Lee, and Kyoung Mu Lee. Deeply- recursive convolutional network for image super-resolution. 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), pages 1637–1645, 2015

  10. [18]

    Adam: A method for stochastic optimization

    Diederik Kingma and Jimmy Ba. Adam: A method for stochastic optimization. International Conference on Learn- ing Representations, 2014

  11. [19]

    Deep laplacian pyramid networks for fast and accurate super-resolution

    Wei-Sheng Lai, Jia-Bin Huang, Narendra Ahuja, and Ming- Hsuan Yang. Deep laplacian pyramid networks for fast and accurate super-resolution. 2017 IEEE Conference on Com- puter Vision and Pattern Recognition (CVPR), pages 5835– 5843, 2017

  12. [20]

    Aitken, Alykhan Tejani, Johannes Totz, Zehan Wang, and Wenzhe Shi

    Christian Ledig, Lucas Theis, Ferenc Husz´ar, Jose Caballero, Andrew P. Aitken, Alykhan Tejani, Johannes Totz, Zehan Wang, and Wenzhe Shi. Photo-realistic single image super- resolution using a generative adversarial network. 2017 IEEE Conference on Computer Vision and Pattern...

  13. [21]

    Enhanced deep residual networks for single image super-resolution

    Bee Lim, Sanghyun Son, Heewon Kim, Seungjun Nah, and Kyoung Mu Lee. Enhanced deep residual networks for single image super-resolution. 2017 IEEE Conference on Computer Vision and Pattern Recognition Workshops (CVPRW), pages 1132–1140, 2017

  14. [22]

    Microsoft coco: Common objects in context

    Tsung-Yi Lin, Michael Maire, Serge Belongie, James Hays, Pietro Perona, Deva Ramanan, Piotr Doll´ar, and C Lawrence Zitnick. Microsoft coco: Common objects in context. In European conference on computer vision , pages 740–755. Springer, 2014

  15. [23]

    Visualizing deep convolutional neural networks using natural pre-images

    Aravindh Mahendran and Andrea Vedaldi. Visualizing deep convolutional neural networks using natural pre-images. In- ternational Journal of Computer Vision , 120(3):233255, May 2016

  16. [24]

    Learning to maintain natural image statistics

    Roey Mechrez, Itamar Talmi, Firas Shama, and Lihi Zelnik- Manor. Learning to maintain natural image statistics. arXiv preprint arXiv:1803.04626, 2018

  17. [25]

    Eduardo P ´erez-Pellitero, Mehdi S. M. Sajjadi, Michael Hirsch, and Bernhard Sch ¨olkopf. Photorealistic video super resolution. In Workshop and Challenge on Perceptual Image Restoration and Manipulation (PIRM) at the 15th European Conference on Computer Vision (ECCV), 2018

  18. [26]

    Benefiting from multitask learn- ing to improve single image super-resolution

    Mohammad Saeed Rad, Behzad Bozorgtabar, Claudiu Musat, Urs-Viktor Marti, Max Basler, Hazim Kemal Ekenel, and Jean-Philippe Thiran. Benefiting from multitask learn- ing to improve single image super-resolution. accepted at Neurocomputing (Special Issue on Deep Learning for Image...

  19. [27]

    Mehdi S. M. Sajjadi, Bernhard Sch ¨olkopf, and Michael Hirsch. Enhancenet: Single image super-resolution through automated texture synthesis. 2017 IEEE International Con- ference on Computer Vision (ICCV) , pages 4501–4510, 2016

  20. [28]

    Deep inside convolutional networks: Visualising image clas- sification models and saliency maps

    Karen Simonyan, Andrea Vedaldi, and Andrew Zisserman. Deep inside convolutional networks: Visualising image clas- sification models and saliency maps. CoRR, abs/1312.6034, 2013

  21. [29]

    Very deep convo- lutional networks for large-scale image recognition

    Karen Simonyan and Andrew Zisserman. Very deep convo- lutional networks for large-scale image recognition. CoRR, abs/1409.1556, 2014

  22. [30]

    J. Sun, J. Zhu, and M. F. Tappen. Context-constrained hallu- cination for image super-resolution. In2010 IEEE Computer Society Conference on Computer Vision and Pattern Recog- nition, pages 231–238, June 2010

  23. [31]

    Mem- net: A persistent memory network for image restoration

    Ying Tai, Jian Yang, Xiaoming Liu, and Chunyan Xu. Mem- net: A persistent memory network for image restoration. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pages 4539–4547, 2017

  24. [32]

    Seman- tic super-resolution: When and where it is useful? Computer Vision and Image Understanding, September 2015

    Radu Timofte, Vincent De Smet, and Luc Van Gool. Seman- tic super-resolution: When and where it is useful? Computer Vision and Image Understanding, September 2015

  25. [33]

    Tsai and T

    R. Tsai and T. Huang. Multiframe image restoration and registration. Advances in Computer Vision and Image Pro- cessing, 1:317339, 1984

  26. [34]

    Subeesh Vasu, Thekke Madam Nimisha, and A. N. Ra- jagopalan. Analyzing perception-distortion tradeoff using enhanced perceptual super-resolution network. In ECCV Workshops, 2018

  27. [35]

    Recovering realistic texture in image super-resolution by deep spatial feature transform

    Xintao Wang, Ke Yu, Chao Dong, and Chen Change Loy. Recovering realistic texture in image super-resolution by deep spatial feature transform. 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition , pages 606– 615, 2018

  28. [36]

    Esrgan: En- hanced super-resolution generative adversarial networks

    Xintao Wang, Ke Yu, Shixiang Wu, Jinjin Gu, Yihao Liu, Chao Dong, Yu Qiao, and Chen Change Loy. Esrgan: En- hanced super-resolution generative adversarial networks. In ECCV Workshops, 2018

  29. [37]

    Zhou Wang, A. C. Bovik, H. R. Sheikh, and E. P. Simon- celli. Image quality assessment: from error visibility to struc- tural similarity. IEEE Transactions on Image Processing , 13(4):600–612, April 2004

  30. [38]

    Fuchs, and Hod Lipson

    Jason Yosinski, Jeff Clune, Anh Mai Nguyen, Thomas J. Fuchs, and Hod Lipson. Understanding neural networks through deep visualization. CoRR, abs/1506.06579, 2015

  31. [39]

    Craft- ing a toolchain for image restoration by deep reinforcement learning

    Ke Yu, Chao Dong, Liang Lin, and Chen Change Loy. Craft- ing a toolchain for image restoration by deep reinforcement learning. In Proceedings of the IEEE Conference on Com- puter Vision and Pattern Recognition , pages 2443–2452, 2018

  32. [40]

    Visualizing and comparing convolutional neural net- works, 2014

    Wei Yu, Kuiyuan Yang, Yalong Bai, Hongxun Yao, and Yong Rui. Visualizing and comparing convolutional neural net- works, 2014

  33. [41]

    Unsupervised image super- resolution using cycle-in-cycle generative adversarial net- works

    Yuan Yuan, Siyuan Liu, Jiawei Zhang, Yongbing Zhang, Chao Dong, and Liang Lin. Unsupervised image super- resolution using cycle-in-cycle generative adversarial net- works. 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW) , pages 814– 81409, 2018

  34. [42]

    On single image scale-up using sparse-representations

    Roman Zeyde, Michael Elad, and Matan Protter. On single image scale-up using sparse-representations. In Proceedings of the 7th International Conference on Curves and Surfaces, pages 711–730, Berlin, Heidelberg, 2012. Springer-Verlag

  35. [43]

    Efros, Eli Shecht- man, and Oliver Wang

    Richard Zhang, Phillip Isola, Alexei A. Efros, Eli Shecht- man, and Oliver Wang. The unreasonable effectiveness of deep features as a perceptual metric. 2018 IEEE/CVF Con- ference on Computer Vision and Pattern Recognition, pages 586–595, 2018

  36. [44]

    Image super-resolution using very deep residual channel attention networks

    Yulun Zhang, Kunpeng Li, Kai Li, Lichen Wang, Bineng Zhong, and Yun Fu. Image super-resolution using very deep residual channel attention networks. In ECCV, 2018

  37. [45]

    Residual dense network for image super-resolution

    Yulun Zhang, Yapeng Tian, Yu Kong, Bineng Zhong, and Yun Fu. Residual dense network for image super-resolution. In The IEEE Conference on Computer Vision and Pattern Recognition (CVPR), June 2018

  38. [46]

    Scene parsing through ade20k dataset

    Bolei Zhou, Hang Zhao, Xavier Puig, Sanja Fidler, Adela Barriuso, and Antonio Torralba. Scene parsing through ade20k dataset. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, volume 1, page 4. IEEE, 2017

Pith tools

Reviewed August 14, 2026 · model on record in the stance chip above.