TL;DR
This paper introduces a novel blind super-resolution method combining meta-learning and MCMC to learn kernel priors, improving convergence and generalization in unsupervised image restoration tasks.
Contribution
It proposes a meta-learning framework with MCMC simulation for kernel prior learning, enabling plug-and-play blind super-resolution without supervised training.
Findings
Outperforms state-of-the-art methods on synthesis datasets
Demonstrates strong generalization to real-world images
Achieves better convergence and stability in kernel estimation
Abstract
Learning-based approaches have witnessed great successes in blind single image super-resolution (SISR) tasks, however, handcrafted kernel priors and learning based kernel priors are typically required. In this paper, we propose a Meta-learning and Markov Chain Monte Carlo (MCMC) based SISR approach to learn kernel priors from organized randomness. In concrete, a lightweight network is adopted as kernel generator, and is optimized via learning from the MCMC simulation on random Gaussian distributions. This procedure provides an approximation for the rational blur kernel, and introduces a network-level Langevin dynamics into SISR optimization processes, which contributes to preventing bad local optimal solutions for kernel estimation. Meanwhile, a meta-learning-based alternating optimization procedure is proposed to optimize the kernel generator and image restorer, respectively. In…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
