Browse State-of-the-Art › Defocus Blur Detection
Defocus Blur Detection
9 papers with code · 5 benchmarks · 3 datasets archive 2025-07-28
Benchmarks archive 2025-07-28
5 leaderboard tables shown for this task, 5 with rows (a “benchmark” on this site is a table with at least one row, as on /sota), ordered by row count. “Best model” is the first row in the archive's own order at snapshot; nothing is re-ranked here and metric direction is not recorded in the archive. PwC's Trend sparklines are not in the archive, so that column is omitted.
| Dataset | Best model (first row in archive order) | Paper | Code | Syntology | Compare |
|---|---|---|---|---|---|
| CUHK (2 rows) | D-DFFNet | Depth and DOF Cues Make A Better Defocus Blur Detector | code | — | Compare |
| CTCUG (1 row) | D-DFFNet | Depth and DOF Cues Make A Better Defocus Blur Detector | code | — | Compare |
| DUT (1 row) | Distill-DBDGAN | Distill-DBDGAN: Knowledge Distillation and Adversarial Learning... | code | — | Compare |
| EBD (1 row) | D-DFFNet | Depth and DOF Cues Make A Better Defocus Blur Detector | code | — | Compare |
| SZU blur detection (1 row) | Distill-DBDGAN | Distill-DBDGAN: Knowledge Distillation and Adversarial Learning... | code | — | Compare |
Syntology column: samples harvested from the paper's repositories and executed on synthesized fixtures; “ran” is not a correctness claim and does not order the table. A dash means no Syntology record for that paper, not a recorded non-run. Read from the graph 2026-09-24.
Libraries
Not in the archive: the export carries no per-task library table, so there is nothing to show at snapshot 2025-07-28.
Datasets archive 2025-07-28
3 datasets whose archive record lists this task, ordered by the archive's paper count.
Subtasks archive 2025-07-28
No subtask under this task in the archive's task tree.
Most implemented papers archive 2025-07-28
9 shown of 9 papers with code (15 tagged with this task in all), ordered by repositories listed in the archive, not by stars (the archive holds no stars, so PwC's “Social” and “Latest” sorts cannot be reproduced). Papers without a page here are shown as plain text.
-
29 May 2023 2 repositories listedWe take inspiration from the widely-used pre-training and then prompt tuning protocols in NLP and propose a new visual prompting model, named Explicit Visual Prompting (EVP).
-
9 Jan 2025 1 repository listedForeground segmentation is a fundamental task in computer vision, encompassing various subdivision tasks.
-
12 Mar 2024 1 repository listedWe developed DL pipelines using two MoEs and two multiclass models of state-of-the-art deep convolutional neural networks (DCNNs) and vision transformers (ViTs).
-
23 Dec 2023 1 repository listedWe achieved 0.
-
20 Jun 2023 1 repository listedOur method proposes a depth feature distillation strategy to obtain depth knowledge from a pre-trained monocular depth estimation model and uses a DOF-edge loss to understand the relationship between DOF and depth.
-
20 Mar 2023 1 repository listed Syntology ran 4 of 4 samples · 0 unverifiedDifferent from the previous visual prompting which is typically a dataset-level implicit embedding, our key insight is to enforce the tunable parameters focusing on the explicit visual content from each individual…
-
Distill-DBDGAN: Knowledge Distillation and Adversarial Learning Framework for Defocus Blur Detection1 Feb 2023 1 repository listedDefocus blur detection (DBD) aims to segment the blurred regions from a given image affected by defocus blur.
-
19 Jun 2021 1 repository listedThe core insight is that a defocus blur region/focused clear area can be arbitrarily pasted to a given realistic full blurred image/full clear image without affecting the judgment of the full blurred image/full clear…
-
16 Jul 2020 1 repository listedIn detail, we learn the defocus blur from ground truth and the depth distilled from a well-trained depth estimation network at the same time.
Syntology lines on 1 of the papers shown; no Syntology record for the others (a paper without an arXiv id cannot be joined to the graph, and absence from the graph layer is not a recorded non-run). “Ran” means the sample executed on a synthesized fixture, not that the paper's result was reproduced. Read from the graph 2026-09-24.
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