Transitive Learning: Exploring the Transitivity of Degradations for
Blind Super-Resolution
- URL: http://arxiv.org/abs/2103.15290v1
- Date: Mon, 29 Mar 2021 02:51:09 GMT
- Title: Transitive Learning: Exploring the Transitivity of Degradations for
Blind Super-Resolution
- Authors: Yuanfei Huang, Jie Li, Yanting Hu, Xinbo Gao, Wen Lu
- Abstract summary: We propose a novel Transitive Learning method for blind Super-Resolution on transitive degradations (TLSR)
We analyze and demonstrate the transitivity of degradations, including the widely used additive and convolutive degradations.
We show that the proposed TLSR achieves superior performance and consumes less time against the state-of-the-art blind SR methods.
- Score: 89.4784684863403
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Being extremely dependent on the iterative estimation and correction of data
or models, the existing blind super-resolution (SR) methods are generally
time-consuming and less effective. To address it, this paper proposes a
transitive learning method for blind SR using an end-to-end network without any
additional iterations in inference. To begin with, we analyze and demonstrate
the transitivity of degradations, including the widely used additive and
convolutive degradations. We then propose a novel Transitive Learning method
for blind Super-Resolution on transitive degradations (TLSR), by adaptively
inferring a transitive transformation function to solve the unknown
degradations without any iterative operations in inference. Specifically, the
end-to-end TLSR network consists of a degree of transitivity (DoT) estimation
network, a homogeneous feature extraction network, and a transitive learning
module. Quantitative and qualitative evaluations on blind SR tasks demonstrate
that the proposed TLSR achieves superior performance and consumes less time
against the state-of-the-art blind SR methods. The code is available at
https://github.com/YuanfeiHuang/TLSR.
Related papers
- Content-decoupled Contrastive Learning-based Implicit Degradation Modeling for Blind Image Super-Resolution [33.16889233975723]
Implicit degradation modeling-based blind super-resolution (SR) has attracted more increasing attention in the community.
We propose a new Content-decoupled Contrastive Learning-based blind image super-resolution (CdCL) framework.
arXiv Detail & Related papers (2024-08-10T04:51:43Z) - Iterative Token Evaluation and Refinement for Real-World
Super-Resolution [77.74289677520508]
Real-world image super-resolution (RWSR) is a long-standing problem as low-quality (LQ) images often have complex and unidentified degradations.
We propose an Iterative Token Evaluation and Refinement framework for RWSR.
We show that ITER is easier to train than Generative Adversarial Networks (GANs) and more efficient than continuous diffusion models.
arXiv Detail & Related papers (2023-12-09T17:07:32Z) - Meta-Learning based Degradation Representation for Blind
Super-Resolution [54.93926549648434]
We propose a Meta-Learning based Region Degradation Aware SR Network (MRDA)
We use the MRDA to rapidly adapt to the specific complex degradation after several iterations and extract implicit degradation information.
A teacher network MRDA$_T$ is designed to further utilize the degradation information extracted by MLN for SR.
arXiv Detail & Related papers (2022-07-28T09:03:00Z) - Truncated tensor Schatten p-norm based approach for spatiotemporal
traffic data imputation with complicated missing patterns [77.34726150561087]
We introduce four complicated missing patterns, including missing and three fiber-like missing cases according to the mode-drivenn fibers.
Despite nonity of the objective function in our model, we derive the optimal solutions by integrating alternating data-mputation method of multipliers.
arXiv Detail & Related papers (2022-05-19T08:37:56Z) - Unpaired Image Super-Resolution with Optimal Transport Maps [128.1189695209663]
Real-world image super-resolution (SR) tasks often do not have paired datasets limiting the application of supervised techniques.
We propose an algorithm for unpaired SR which learns an unbiased OT map for the perceptual transport cost.
Our algorithm provides nearly state-of-the-art performance on the large-scale unpaired AIM-19 dataset.
arXiv Detail & Related papers (2022-02-02T16:21:20Z) - Discovering "Semantics" in Super-Resolution Networks [54.45509260681529]
Super-resolution (SR) is a fundamental and representative task of low-level vision area.
It is generally thought that the features extracted from the SR network have no specific semantic information.
Can we find any "semantics" in SR networks?
arXiv Detail & Related papers (2021-08-01T09:12:44Z) - Blind Image Super-Resolution via Contrastive Representation Learning [41.17072720686262]
We design a contrastive representation learning network that focuses on blind SR of images with multi-modal and spatially variant distributions.
We show that the proposed CRL-SR can handle multi-modal and spatially variant degradation effectively under blind settings.
It also outperforms state-of-the-art SR methods qualitatively and quantitatively.
arXiv Detail & Related papers (2021-07-01T19:34:23Z) - Unsupervised Degradation Representation Learning for Blind
Super-Resolution [27.788488575616032]
CNN-based super-resolution (SR) methods suffer a severe performance drop when the real degradation is different from their assumption.
We propose an unsupervised degradation representation learning scheme for blind SR without explicit degradation estimation.
Our network achieves state-of-the-art performance for the blind SR task.
arXiv Detail & Related papers (2021-04-01T11:57:42Z) - Towards Understanding Label Smoothing [36.54164997035046]
Label smoothing regularization (LSR) has a great success in deep neural networks by training algorithms.
We show that an appropriate LSR can help to speed up convergence by reducing the variance.
We propose a simple yet effective strategy, namely Two-Stage LAbel smoothing algorithm (TSLA)
arXiv Detail & Related papers (2020-06-20T20:36:17Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.