.png){kind=icon}
返回
Fast blind deconvolution using a deeper sparse patch-wise maximum gradient prior
.png){kind=icon}
PRE
AI
DOI：10.1016/j.image.2020.116050.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this study, we propose a patch-wise maximum gradient (PMG) prior for effective blind image deblurring. Our work is motivated by the fact that the maximum gradient values of non-overlapping local patches are significantly diminished by blurring; we demonstrate this inherent property both theoretically and using real data. Based on this, we propose a blur kernel estimation model using an L-0-regularized PMG prior and L-0 regularized gradient prior. Compared with previous image priors, our PMG prior exhibits a stronger ability to distinguish between clear and blurred images. It also has a deeper sparseness, which significantly reduces the computational cost. To solve the proposed PMG and L-0-regularized gradient terms, we design an efficient optimization algorithm by introducing a linear operator and improving the iteration strategy. Visual and quantitative experimental results show that our method can achieve excellent performance and is superior to state-of-the-art methods in terms of computational efficiency and recovery quality in various specific scenarios such as natural, face, saturated, and text images.
Keyword:
Blind deblurring
Patch-wise maximum gradient prior
L-0-regularized prior
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
S
IF:
2.7
论文数:
2.8K
被引数:
4.2K
机构
引用论文
.png){kind=icon}
分享收藏
查看更多内容