Blind deconvolution subject to sparse representation for fluorescence microscopy

Blind deconvolution is an effective fluorescence microscopic image processing technique to improve the quality of degraded digital images resulting from photon counting noise and out-of-focus blur. For solving the severely ill-posed problem of deconvolution, in this paper we propose an alternate min...

Full description

Saved in:
Bibliographic Details
Published inOptics communications Vol. 286; pp. 60 - 68
Main Authors Wang, Yu, Dai, Qionghai, Cai, Qiang, Guo, Peiyuan, Liu, Zaiwen
Format Journal Article
LanguageEnglish
Published Elsevier B.V 01.01.2013
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:Blind deconvolution is an effective fluorescence microscopic image processing technique to improve the quality of degraded digital images resulting from photon counting noise and out-of-focus blur. For solving the severely ill-posed problem of deconvolution, in this paper we propose an alternate minimized blind deconvolution method which considers sparse representation as constraint condition to confine the solution space of traditional Richardson–Lucy method and Gaussian model as initial value of point spread function (PSF). We assume that Poisson noise is dominating during the course of imaging. The maximum-likelihood estimation on a fluorescence image and corresponding point spread function (PSF) is developed. By solving the Euler–Lagrange equation of the total cost function, including the data term obtained by the hypothetical Poisson noise distribution model and the regularized term corresponding to the sparse representation constraint, and using gradient descent method we can get the iterative equations of the original fluorescence image and PSF respectively. Compared with the related blind deconvolution methods, our model shows superior performance in terms of both objective criteria and subjective human vision via processing simulated and real fluorescence microscopic degraded images.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0030-4018
1873-0310
DOI:10.1016/j.optcom.2012.07.073