2019
DOI: 10.5201/ipol.2019.243
|View full text |Cite
|
Sign up to set email alerts
|

Blind Image Deblurring using the l0 Gradient Prior

Abstract: Many blind image deblurring methods rely on unnatural image priors that are explicitly designed to restore salient image structures, necessary to estimate the blur kernel. In this article, we analyze the blur kernel estimation method introduced by Pan and Su in 2013 that uses an 0 prior on the gradient image. We present deconvolution results using the estimated blur kernels. Our experiments show the effectiveness of the method as well as some of its shortcomings. Source Code The C++ source code, the code docum… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
17
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
5
3
2

Relationship

2
8

Authors

Journals

citations
Cited by 22 publications
(17 citation statements)
references
References 30 publications
0
17
0
Order By: Relevance
“…We use the efficient implementation of Anger et al [12]. Even if the 0 gradient prior kernel estimation method was designed for text and natural images, we argue that it is applicable to satellite images without any adaptation.…”
Section: Blur Kernel Estimationmentioning
confidence: 99%
“…We use the efficient implementation of Anger et al [12]. Even if the 0 gradient prior kernel estimation method was designed for text and natural images, we argue that it is applicable to satellite images without any adaptation.…”
Section: Blur Kernel Estimationmentioning
confidence: 99%
“…We adopted Lp-pseudonorm shrinkage to solve the Equation (14). In contrast to Wang et al, [21] where the value of p was the same, we separated the p values of different gradients and directions of the image.…”
Section: Z Imentioning
confidence: 99%
“…Our implementation is based on [28] which upscales the predicted sharp image by a factor two using bicubic interpolation. However, instead of 5 iterations per scale as performed in [28], our method requires only 2 iterations by warm-starting the second one using the the previous estimation of u. This allows to reduce the number of inner iterations required for the sharp prediction step by setting κ = 5 and β (0) u = 0.05 in (3) and (4).…”
Section: Kernel Estimationmentioning
confidence: 99%