...
首页> 外文期刊>Journal of the Optical Society of America, A. Optics, image science, and vision >Fast maximum-likelihood image-restoration algorithms for three-dimensional fluorescence microscopy
【24h】

Fast maximum-likelihood image-restoration algorithms for three-dimensional fluorescence microscopy

机译:用于三维荧光显微镜的快速最大似然图像恢复算法

获取原文
获取原文并翻译 | 示例
           

摘要

We have evaluated three constrained, iterative restoration algorithms to find a fast, reliable algorithm for maximum-likelihood estimation of fluorescence microscopic images. Two algorithms used a Gaussian approximation to Poisson statistics, with variances computed assuming Poisson noise far the images. The third method used Csiszar's information-divergence. II-divergence! discrepancy measure. Each method included a nonnegativity constraint and a penalty term for regularization; optimization was performed with a conjugate gradient method. Performance of the methods was analyzed with simulated as well as biological images and the results compared with those obtained with the expectation-maximization-maximum-likelihood (EM-ML) algorithm. The I-divergence-based algorithm converged fastest and produced images similar to those restored by EM-ML as measured by several metrics. For a noiseless simulated specimen, the number of iterations required for the EM-X;IL method to reach a given log-likelihood value was approximately the square of the number required for the I-divergence-based method to reach the same value. (C) 2001 Optical Society of America. [References: 43]
机译:我们评估了三种受约束的迭代恢复算法,以找到一种快速,可靠的算法,用于荧光显微图像的最大似然估计。两种算法均使用高斯近似泊松统计量,并在假设泊松噪声远于图像的情况下计算出方差。第三种方法使用了Csiszar的信息分歧。 II分叉!差异度量。每种方法都包括非负约束和正则化的惩罚项。用共轭梯度法进行优化。分析了方法的性能,并通过仿真图像和生物学图像进行了分析,并将结果与​​通过期望-最大-最大可能性(EM-ML)算法获得的结果进行了比较。基于I散度的算法收敛最快,生成的图像类似于由EM-ML恢复的图像(通过多个指标进行测量)。对于无噪声的模拟样本,EM-X; IL方法达到给定对数似然值所需的迭代次数大约是基于I-散度的方法达到相同值所需的次数的平方。 (C)2001年美国眼镜学会。 [参考:43]

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号