We present a simple and effective blind image deblurring method based on the dark channel prior. Our work is inspired by the interesting observation that the dark channel of blurred images is less sparse. While most image patches in the clean image contain some dark pixels, these pixels are not dark when averaged with neighboring highintensity pixels during the blur process. This change in the sparsity of the dark channel is an inherent property of the blur process, which we both prove mathematically and validate using training data. Therefore, enforcing the sparsity of the dark channel helps blind deblurring on various scenarios, including natural, face, text, and low-illumination images. However, sparsity of the dark channel introduces a non-convex non-linear optimization problem. We introduce a linear approximation of the min operator to compute the dark channel. Our look-up-table-based method converges fast in practice and can be directly extended to non-uniform deblurring. Extensive experiments show that our method achieves state-of-the-art results on deblurring natural images and compares favorably methods that are well-engineered for specific scenarios.
|Title of host publication||Proceedings - 29th IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2016|
|Publisher||IEEE Computer Society|
|Number of pages||9|
|Publication status||Published - 2016 Dec 9|
|Event||29th IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2016 - Las Vegas, United States|
Duration: 2016 Jun 26 → 2016 Jul 1
|Name||Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition|
|Conference||29th IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2016|
|Period||16/6/26 → 16/7/1|
Bibliographical notePublisher Copyright:
© 2016 IEEE.
All Science Journal Classification (ASJC) codes
- Computer Vision and Pattern Recognition