Blind Image Deblurring
Using Structured Sparse Representations

BD-RCS


ABSTRACT

Blind image deblurring is a particularly challenging inverse problem where the blur kernel is unknown and must be estimated en route to recovering the de-blurred image. The problem is of strong practical relevance since many imaging devices such as cellphone cameras, must rely on deblurring algorithms to yield satisfactory image quality. Despite significant research effort, handling large motions remains an open problem. In this paper, we develop a new method called Blind Image Deblurring Using Row-Column Sparse Representations (BD-RCS) to address this issue. Specifically, we model the outer product of kernel and image coefficients in certain transformation domains as a rank-one matrix, and recover it via a rank minimization problem. Our central contribution then involves solving {m two new} optimization problems involving row and column sparsity to automatically determine blur kernel and image support respectively. The kernel and image can then be recovered through a singular value decomposition (SVD). Experimental results on linear motion deblurring demonstrate that BD-RCS can yield better results than state of the art, particularly when the blur is caused by large motion. This is confirmed both visually and through quantitative measures.

Flowchart

Simulation Results

Results for small and medium kernels (Numerical results in supplementary document)

Related Publications

  1. M. Tofighi, Y. Li, V. Monga, "Blind Image Deblurring Using Row-Column Sparse Representations", IEEE Signal Processing Letters, Vol. 25, No. 2, pp. 273-277, 2017. [arXiv][IEEE Xplore]

Supplementary Document

Supplementary document is available here.

Convergence Analysis

Convergence analysis is available here.

Code

The codes for this pape are available here.

Selected References

  1. A. Ahmed, B. Recht, and J. Romberg, "Blind deconvolution using convex programming," IEEE Transactions on Information Theory, vol. 60, no. 3, pp. 1711-1732, March 2014[paper].

  2. A. Levin, Y. Weiss, F. Durand, and W. T. Freeman, "Understanding blind deconvolution algorithms," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 33, no. 12, pp. 2354-2367, Dec 2011[paper].

  3. D. Perrone and P. Favaro, "A clearer picture of total variation blind deconvolution," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 38, no. 6, pp. 1041-1055, June 2016.. [paper].

Email
ipal.psu@gmail.com

Address
104 Electrical Engineering East,
University Park, PA 16802, USA

Lab Phone:
814-863-7810
814-867-4564