Blind deconvolution of images using optimal sparse representations

Michael M. Bronstein*, Alexander M. Bronstein, Michael Zibulevsky, Yehoshua Y. Zeevi

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review


The relative Newton algorithm, previously proposed for quasi-maximum likelihood blind source separation and blind deconvolution of one-dimensional signals is generalized for blind deconvolution of images. Smooth approximation of the absolute value is used as the nonlinear term for sparse sources. In addition, we propose a method of sparsification, which allows blind deconvolution of arbitrary sources, and show how to find optimal sparsifying transformations by supervised learning.

Original languageEnglish
Pages (from-to)726-736
Number of pages11
JournalIEEE Transactions on Image Processing
Issue number6
StatePublished - Jun 2005
Externally publishedYes


FundersFunder number
Ollendorff Minerva Center
European Commission


    • Blind deconvolution
    • Quasi-maximum likelihood
    • Relative Newton optimization
    • Sparse representations


    Dive into the research topics of 'Blind deconvolution of images using optimal sparse representations'. Together they form a unique fingerprint.

    Cite this