Name
Abstract | ||
|---|---|---|
The maximum a posterior (MAP)-based blind deconvolution framework generally involves two stages: blur kernel estimation and non-blind restoration. For blur kernel estimation, sharp edge prediction and carefully designed image priors are vital to the success of MAP. In this paper, we propose a blind deconvolution framework together with iteration specific priors for better blur kernel estimation. The family of hyper-Laplacian (Pr(d) ∝ ℯ−∥d∥pp/λ) is adopted for modeling iteration-wise priors of image gra- dients, where each iteration has its own model parameters {λ(t), p(t)}. To avoid heavy parameter tuning, all iteration-wise model parameters can be learned using our principled discriminative learning model from a training set, and can be directly applied to other dataset and real blurry images. Interestingly, with the generalized shrinkage / thresholding operator, negative p value (p <0) is allowable and we find that it contributes more in estimating the coarse shape of blur kernel. Experimental results on synthetic and real world images demonstrate that our method achieves better deblurring results than the existing gradient prior-based methods. Compared with the state-of-the-art patch prior-based method, our method is competitive in restoration results but is much more efficient. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1109/CVPR.2015.7298943 | IEEE Conference on Computer Vision and Pattern Recognition |
Field | DocType | ISSN |
Kernel (linear algebra),Computer vision,Pattern recognition,Deblurring,Blind deconvolution,Computer science,Deconvolution,Artificial intelligence,Thresholding,Image restoration,Prior probability,Kernel density estimation | Conference | 1063-6919 |
Citations | PageRank | References |
19 | 0.64 | 31 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wangmeng Zuo | 1 | 3833 | 173.11 |
| Dongwei Ren | 2 | 103 | 12.26 |
| Shuhang Gu | 3 | 701 | 28.25 |
| Liang Lin | 4 | 3007 | 151.07 |
| Lei Zhang | 5 | 16326 | 543.99 |