Papers › Unfolded Deep Kernel Estimation for Blind Image Super-resolution

Unfolded Deep Kernel Estimation for Blind Image Super-resolution

10 Mar 2022arXiv:2203.05568archive 2025-07-28

Hongyi Zheng, Hongwei Yong, Lei Zhang

Blind image super-resolution (BISR) aims to reconstruct a high-resolution image from its low-resolution counterpart degraded by unknown blur kernel and noise. Many deep neural network based methods have been proposed to tackle this challenging problem without considering the image degradation model. However, they largely rely on the training sets and often fail to handle images with unseen blur kernels during inference. Deep unfolding methods have also been proposed to perform BISR by utilizing the degradation model. Nonetheless, the existing deep unfolding methods cannot explicitly solve the data term of the unfolding objective function, limiting their capability in blur kernel estimation. In this work, we propose a novel unfolded deep kernel estimation (UDKE) method, which, for the first time to our best knowledge, explicitly solves the data term with high efficiency. The UDKE based BISR method can jointly learn image and kernel priors in an end-to-end manner, and it can effectively exploit the information in both training data and image degradation model. Experiments on benchmark datasets and real-world data demonstrate that the proposed UDKE method could well predict complex unseen non-Gaussian blur kernels in inference, achieving significantly better BISR performance than state-of-the-art. The source code of UDKE is available at: https://github.com/natezhenghy/UDKE.

PaperPDFCodeCode Syntology ranMethod as code

In Syntology View this paper on Syntology, its page in Syntology's graph. That page adds which of its functions are also present in other papers' code Syntology holds, with dates, and its dated run record as JSON and a README badge. It also lists the repositories linked to the paper, the abstract and the calls for agents.

Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, on Syntology's MCP service (how to connect):

Code

Syntology 17 code samples harvested from 1 repository linked to this paper: 12 ran (of which 9 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 3 where Syntology's instrument failed) · 5 unverified. Where Syntology's instrument failed: 3 where our contract draft was wrong; failures of Syntology's instrument, not of the code.

By repository: official repository: 17 samples from 1 repository, 12 ran (9 with no instrument failure; 3 where Syntology's instrument failed). The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

Levels written on 2026-09-22 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed.

natezhenghy/udke officialmentioned in papermentioned on GitHubpytorchSyntology: 17 samples, 12 ran (3 instrument-failed) · 5 unverified report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

17 samples harvested: 12 ran (of which 9 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 3 where Syntology's instrument failed) · 5 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Syntology's record for this page has not changed since , the first build that kept a record date for it; when this build read Syntology's graph is in the build record. That date is not when the samples ran.

3ran · our draft was wrong
9ran
5unverified

Licence: 17 of the 17 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from natezhenghy/udke. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. A line beginning “fixture:” under a sample that ran gives the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right. “Level recorded” gives the UTC date when Syntology's graph wrote the sample's verification level, not when the code executed; where the level was written before Syntology's graph kept that date, the row says “level recorded, date not recorded”. For 3 samples that ran, the graph records a signature this page does not show: for a class the fixture built without calling, the harness called the object with inputs it made up itself, so the recorded signature is the harness's probe, not the fixture's arguments. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself. “Our draft was wrong” and “the contract check could not run” are failures of Syntology's instrument, not of the code: the sample ran on Syntology's synthesized input, and then the drafted contract did not describe it, or the check itself raised an error (RAISES), lacked a dependency (DEP_MISSING) or ran out of time (TIMEOUT); hover the label for which. A metamorphic tier, where shown, is evidence of the output's shape, not that the sample implements the method.

Each sample ends with its code_sha256. A sample's code_sha256 is Syntology's identity for that exact code. It is printed in full (16 hexadecimal characters for every sample in this build), and get_code(code_sha256="…") takes it exactly as printed. An agent calls it on Syntology's MCP service (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples are grouped by repository: a repository marked official first, then by how directly the repository is tied to the paper, then in the archive's order; never by how many ran. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of six reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar); this paper's copy was not located, so its licence is not recorded; or this paper's copy is cleared, but the stored copy of the same code that Syntology serves is not. Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

A function or class name links to its page when the name occurs in the harvested code of at least 5 papers; the name is a string, not an identity. A census tag appears when Syntology's census ran implementations with that name on one shared input per bucket: it gives how many were compared, from how many papers, and how many distinct outputs they produced, and names this sample's bucket when this sample was one of them.

natezhenghy/udke official repository 17 samples, 12 ran (3 instrument-failed) · 5 unverified
CholeskySolve models/network_sr.py ran no licence file found · pointer only · 7c56b258ead50df4 · report fixture: returned CholeskySolve · level recorded 2026-09-22
HeadNet models/network_sr.py ran fingerprinted no licence file found · pointer only · ef191ef578a3527f · report fixture: returned HeadNet · level recorded 2026-09-22
HyPaNet models/network_sr.py ran no licence file found · pointer only · 80bfa2d5209cd506 · report fixture: returned HyPaNet · level recorded 2026-09-22
LSTSQSolve models/network_sr.py ran no licence file found · pointer only · bd4d38b0cdb8120b · report fixture: returned LSTSQSolve · level recorded 2026-09-22
LSTSQSolveUniversal models/network_sr.py ran no licence file found · pointer only · f79303ea7df55a6e · report fixture: returned LSTSQSolveUniversal · level recorded 2026-09-22
LUSolve models/network_sr.py ran no licence file found · pointer only · 03dcdc2ba11df024 · report fixture: returned LUSolve · level recorded 2026-09-22
NetK models/network_sr.py ran no licence file found · pointer only · b494a97462e257e5 · report fixture: returned NetK · level recorded 2026-09-22
NetX models/network_sr.py ran no licence file found · pointer only · e676ecdd9d2b986f · report fixture: returned NetX · level recorded 2026-09-22
ResBlock in 127 papers
census: 6 implementations from 5 papers, 6 distinct outputs across 2 buckets, one shared input per bucket
models/network_sr.py ran fingerprinted no licence file found · pointer only · 412ce589a9cf5bb0 · report fixture: returned ResBlock · level recorded 2026-09-22
conv in 178 papers models/network_sr.py ran · our draft was wrong no licence file found · pointer only · 2da0372ce5122959 · report fixture: signature in_channels:int/0/int, out_channels:int/0/int, kernel_size:int/0/int, stride:int/0/int, padding:int/0/int, bias:bool/0/bool, mode:str/0/str, negative_slope:float/0/float · returned Sequential · level recorded 2026-09-22
downsample_strideconv models/network_sr.py ran · our draft was wrong no licence file found · pointer only · 2b03ad707aa93340 · report fixture: signature in_channels:int/0/int, out_channels:int/0/int, kernel_size:int/0/int, stride:int/0/int, padding:int/0/int, bias:bool/0/bool, mode:str/0/str, negative_slope:float/0/float · returned Sequential · level recorded 2026-09-22
upsample_convtranspose models/network_sr.py ran · our draft was wrong no licence file found · pointer only · f444f9523164e159 · report fixture: signature in_channels:int/0/int, out_channels:int/0/int, kernel_size:int/0/int, stride:int/0/int, padding:int/0/int, bias:bool/0/bool, mode:str/0/str, negative_slope:float/0/float · returned Sequential · level recorded 2026-09-22
BodyNet models/network_sr.py unverified no licence file found · pointer only · 82684b109b7bb56d · report
SolveFFT models/network_sr.py unverified no licence file found · pointer only · e34d363196526e17 · report
SolveLS models/network_sr.py unverified no licence file found · pointer only · 53e5dd39d13509c2 · report
TailNet models/network_sr.py unverified no licence file found · pointer only · c501a18c5e14d5f5 · report
UDKE models/network_sr.py unverified no licence file found · pointer only · 2ad026c6b2d18772 · report

Method as code Syntology

What Syntology's graph records as this paper's claimed method, lifted into code: each assembly names its bricks (functions and classes), each with its own role and its own verification level. An assembly is not a check that the code implements the method correctly or reproduces the paper's results. Levels are each brick's own verification level in Syntology's graph (level 0: no recorded run), listed brick by brick and never combined into one level; “ran” means the brick executed on a synthesized input, not that its output is correct, and the instrument figure counts failures of Syntology's instrument, not of the code. Where a model read the code against the paper's claim, each assembly's label verdict is one model's judgement, kept in this page's JSON twin; it is not calibrated, so no card prints it.

1 assembly on this paper: 1 harvested, 0 generated.

harvested Assembly for Unfolded Deep Kernel Estimation (UDKE) (graph method: Unfolded Deep Kernel Estimation (UDKE)). 18 bricks; individually on a fixture: 12 ran (of which 9 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 3 where Syntology's instrument failed) · 6 unverified. The assembly has not been run end-to-end.

  1. UDKE entry · level 0 · unverified · 2ad026c6b2d18772
  2. BodyNet model · level 0 · unverified · 82684b109b7bb56d
  3. HeadNet helper · level 1 · ran · ef191ef578a3527f
  4. HyPaNet model · level 1 · ran · 80bfa2d5209cd506
  5. TailNet helper · level 0 · unverified · c501a18c5e14d5f5
  6. NetK model · level 1 · ran · b494a97462e257e5
  7. NetX model · level 1 · ran · e676ecdd9d2b986f
  8. SolveFFT helper · level 0 · unverified · e34d363196526e17
  9. SolveLS helper · level 0 · unverified · 53e5dd39d13509c2
  10. ResBlock helper · level 1 · ran · 412ce589a9cf5bb0
  11. conv helper · level 1 · ran · our draft was wrong · 2da0372ce5122959
  12. downsample_strideconv helper · level 1 · ran · our draft was wrong · 2b03ad707aa93340
  13. sequential helper · level 0 · unverified · 9287bb06d307bde7
  14. upsample_convtranspose helper · level 1 · ran · our draft was wrong · f444f9523164e159
  15. CholeskySolve helper · level 1 · ran · 7c56b258ead50df4
  16. LSTSQSolve helper · level 1 · ran · bd4d38b0cdb8120b
  17. LSTSQSolveUniversal helper · level 1 · ran · f79303ea7df55a6e
  18. LUSolve helper · level 1 · ran · 03dcdc2ba11df024

Each brick ends with its code_sha256, Syntology's identity for that exact code; click one to copy the get_code call that returns it. For agents, on Syntology's MCP service: assembly(arxiv_id="2203.05568") returns these assemblies with each brick's role and wiring (how to connect).

Tasks

Image Super-ResolutionSuper-Resolution

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections