EPFL
 Biomedical Imaging GroupSTI
EPFL
  Publications
English only   BIG > Publications > 3D Fluorescence Deconvolution


 CONTENTS
 Home Page
 News & Events
 People
 Publications
 Tutorials and Reviews
 Research
 Demos
 Download Algorithms

 DOWNLOAD
 PDF
 Postscript
 All BibTeX References

Deconvolution of 3D Fluorescence Micrographs with Automatic Risk Minimization

S. Ramani, C. Vonesch, M. Unser

Proceedings of the Fifth IEEE International Symposium on Biomedical Imaging: From Nano to Macro (ISBI'08), Paris, French Republic, May 14-17, 2008, pp. 732-735.



We investigate the problem of automatic tuning of a deconvolution algorithm for three-dimensional (3D) fluorescence microscopy; specifically, the selection of the regularization parameter λ. For this, we consider a realistic noise model for data obtained from a CCD detector: Poisson photon-counting noise plus Gaussian read-out noise. Based on this model, we develop a new risk measure which unbiasedly estimates the original mean-squared-error of the deconvolved signal estimate. We then show how to use this risk estimate to optimize the regularization parameter for Tikhonov-type deconvolution algorithms. We present experimental results on simulated data and numerically demonstrate the validity of the proposed risk measure. We also present results for real 3D microscopy data.


@INPROCEEDINGS(http://bigwww.epfl.ch/publications/ramani0804.html,
AUTHOR="Ramani, S. and Vonesch, C. and Unser, M.",
TITLE="Deconvolution of {3D} Fluorescence Micrographs with Automatic
        Risk Minimization",
BOOKTITLE="Proceedings of the Fifth {IEEE} International Symposium on
        Biomedical Imaging: {F}rom Nano to Macro ({ISBI'08})",
YEAR="2008",
editor="",
volume="",
series="",
pages="732--735",
address="Paris, French Republic",
month="May 14-17,",
organization="",
publisher="",
note="")

© 2008 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from IEEE.
This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.