Cited by 143Advanced Image Processing TechniquesAdvanced Neural Network ApplicationsImage Enhancement Techniques

End-to-End Image Super-Resolution via Deep and Shallow Convolutional Networks

Open access
Wang, Yifan, Wang, Lijun, Wang, Hongyu, Li, Peihua·2019·IEEE Access

Abstract

In this paper, we propose a new image super-resolution (SR) approach based on a convolutional neural network (CNN), which jointly learns the feature extraction, upsampling, and high-resolution (HR) reconstruction modules, yielding a completely end-to-end trainable deep CNN. However, directly training such a deep network in an end-to-end fashion is challenging, which takes a longer time to converge and may lead to sub-optimal results. To address this issue, we propose to jointly train an ensemble of deep and shallow networks. The shallow network with weaker learning capability restores the main structure of the image content, while the deep network with stronger representation power captures the high-frequency details. Since the shallow network is much easier to optimize, it significantly lowers the difficulty of deep network optimization during joint training. To further ensure more accurate restoration of HR images, the high-frequency details are reconstructed in a multi-scale manner to simultaneously incorporate both short- and long-range contextual information. The proposed method is extensively evaluated on widely adopted data sets and compares favorably against state-of-the-art methods. In-depth ablation studies are conducted to verify the contributions of different network designs to image SR, providing additional insights for future research.

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/access.2019.2903582

Cites

50 of 50 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Zero-padded identity mapping requires fewer parameters than projection-based shortcut connections, which in turn leads to enhanced generalization.

    “In comparison to the projection-based shortcut connections, zero-padded identity mapping requires fewer parameters, which in turn leads to enhanced generalization [124].”

    From Review of deep learning: concepts, CNN architectures, challenges, applications, future directions (2021) · cites this paper as [124]

    The Feature Extraction section describes an identity-mapping shortcut and says zero padding preserves feature-map size, but it does not describe a zero-padded identity mapping. The shortcut-connection analysis compares a network with and without shortcuts, not identity mappings with projection-based shortcuts. Searches for that comparison and for improved generalization from fewer parameters found no supporting passage in our copy. (LLM, conf=0.72)

    Experimental — accuracy not yet measured

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Research works printed but not linked: 4

  1. J. Salvador and E. Perez-Pellitero, ''Naïve Bayes super-resulution forest,'' in Proc. IEEE Int. Conf. Comput. Vis., Dec. 2015, pp. 325-333.
  2. C. E. Duchon, ''Lanczos filtering in one and two dimensions,'' J. Appl. Meteorol., vol. 18, no. 8, pp. 1016-1022, 1979.
  3. D. R. Martin, C. C. Fowlkes, D. Tal, and J. Malik, ''A database of human segmented natural images and its application to evaluating segmentation algorithms and measuring ecological statistics,'' in Proc. IEEE Int. Conf. Comput. Vis., Jul. 2001, pp. 416-425.
  4. PEIHUA LI received the Ph.D. degree from the Harbin Institute of Technology, in 2002. He was a recipient of the honorary nomination of National Excellent Doctoral Dissertation, in 2005. He was supported by the Program for New Century Excel- lent Talents in University of the Ministry of Educa- tion of China, in 2011. He is currently a Professor with the School of Information and Communica- tion Engineering, Dalian University of Technol- ogy. He has published over 50 papers in referred conferences and journals. His current research interests include image clas- sification and search using theoretical and computational methods of infor- mation geometry.

Cited by

Sorted by citations

Authors
Wang, Y., Wang, L., Wang, H., & Li, P.
Affiliations
Dalian University of Technology (CN)
Venue
IEEE Access
Published
2019
Volume
7
Pages
31959-31970
ISSN
2169-3536 (ISSN-L)
OpenAlex
W2963103155
Cited by
143
References
50
Citations by year
2026: 1 · 2025: 9 · 2024: 8 · 2023: 13 · 2022: 10 · 2021: 22 · 2020: 30 · 2019: 22 · 2018: 22 · 2017: 5 · 2016: 1
FWCI
9.39
Type
journal article
Language
en
Open access
Locations
  • IEEE Access (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
  • arXiv (Cornell University)
Funders
National Natural Science Foundation of China (61471082, 61671103)
Topics
  • Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Advanced Image Processing Techniques
  • Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Advanced Neural Network Applications
  • Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Image Enhancement Techniques
Keywords
image super-resolution, end-to-end learning, network ensembles, upsampling, high-frequency detail reconstruction, multi-scale reconstruction, feature extraction

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review