Blind deconvolution using a normalized sparsity measure
Authors:
Top Cited Papers
- 1 June 2011
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10636919,p. 233-240
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.Keywords
This publication has 27 references indexed in Scilit:
- Non-uniform deblurring for shaken images2010
- Understanding and evaluating blind deconvolution algorithms2009
- High-quality motion deblurring from a single image2008
- Total variation minimizing blind deconvolution with shock filter referenceImage and Vision Computing, 2008
- Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed SensingSIAM Journal on Imaging Sciences, 2008
- User Assisted Separation of Reflections from a Single Image Using a Sparsity PriorIEEE Transactions on Pattern Analysis and Machine Intelligence, 2007
- Image and depth from a conventional camera with a coded aperture2007
- What makes a good model of natural images?2007
- Fields of Experts: A Framework for Learning Image Priors2005
- Ensemble Learning for Blind Image Separation and Deconvolution2000