Convex blind image deconvolution with inverse filtering. (23rd January 2018)

• Record Type: Journal Article
• Authors: Lv, Xiao-Guang; Li, Fang; Zeng, Tieyong
• Is Part Of: Inverse problems. Volume 34:Number 3(2018:Mar.)
• Publication Date: 2018-01-23
• Subjects: blind image deconvolution -- total variation -- star norm -- primal-dual -- regularization; Inverse problems (Differential equations) -- Periodicals; 515.357
• DOI: 10.1088/1361-6420/aaa4a7
• Languages: English
• ISSNs: 0266-5611

Abstract

Abstract: Blind image deconvolution is the process of estimating both the original image and the blur kernel from the degraded image with only partial or no information about degradation and the imaging system. It is a bilinear ill-posed inverse problem corresponding to the direct problem of convolution. Regularization methods are used to handle the ill-posedness of blind deconvolution and get meaningful solutions. In this paper, we investigate a convex regularized inverse filtering method for blind deconvolution of images. We assume that the support region of the blur object is known, as has been done in a few existing works. By studying the inverse filters of signal and image restoration problems, we observe the oscillation structure of the inverse filters. Inspired by the oscillation structure of the inverse filters, we propose to use the star norm to regularize the inverse filter. Meanwhile, we use the total variation to regularize the resulting image obtained by convolving the inverse filter with the degraded image. The proposed minimization model is shown to be convex. We employ the first-order primal-dual method for the solution of the proposed minimization model. Numerical examples for blind image restoration are given to show that the proposed method outperforms some existing methods in terms of peak signal-to-noise ratio (PSNR), structural similarity (SSIM), visual quality and time consumption.