Blind deconvolution using a normalized sparsity measure

Citations Over TimeTop 1% of 2011 papers

Abstract

Blind image deconvolution is an ill-posed problem that requires regularization to solve. However, many common forms of image prior used in this setting have a major drawback in that the minimum of the resulting cost function does not correspond to the true sharp solution. Accordingly, a range of additional methods are needed to yield good results (Bayesian methods, adaptive cost functions, alpha-matte extraction and edge localization). In this paper we introduce a new type of image regularization which gives lowest cost for the true sharp image. This allows a very simple cost formulation to be used for the blind deconvolution model, obviating the need for additional methods. Due to its simplicity the algorithm is fast and very robust. We demonstrate our method on real images with both spatially invariant and spatially varying blur.

Related Papers

• → Blind deconvolution by means of the Richardson–Lucy algorithm(1995)513 cited
• → Blind deconvolution applied to acoustical systems identification with supporting experimental results(2003)20 cited
• → Blind Deconvolution Of Seismic Data(2002)1 cited
• → Deconvolution without system model or a new blind deconvolution(2005)2 cited
• → <title>Imaging through turbid media: post processing using blind deconvolution</title>(2001)1 cited