Deconvolution of 3D Fluorescence Microscopy Images Using Graphics Processing Units
We consider the deconvolution of 3D Fluorescence Microscopy RGB images, describing the benefits arising from facing medical imaging problems on modern graphics processing units (GPUs), that are non expensive parallel processing devices available on many up-to-date personal computers. We found that execution time of CUDA version is about 2 orders of magnitude less than the one of sequential algorithm. Anyway, the experiments lead some reflections upon the best setting for the CUDA-based algorithm. That is, we notice the need to model the GPUs architectures and their characteristics to better describe the performance of GPU-algorithms and what we can expect of them.
KeywordsExecution Time Graphic Processing Unit Discrete Fourier Transform Fast Fourier Transform Algorithm Inverse Discrete Fourier Transform
Unable to display preview. Download preview PDF.
- 1.Agard, D.A., Hiraoki, Y., Sedat, J.W.: Three-dimensional microscopy: image processing for high-resolution subcellular imaging. In: Proc. SPIE, vol. 1161, pp. 24–30 (1989)Google Scholar
- 3.Brigham, E.O.: The Fast Fourier Transform and its application. Prentice Hall Signal Processing Series Alan V. Oppenheim, Series EditorGoogle Scholar
- 9.Johnson, S.G., Frigo, M.: Implementing FFTs in practice in Fast Fourier Transforms. In: Burrus, C.S. (ed.), ch. 11, Rice University, Houston TX: Connexions (September 2008)Google Scholar
- 11.Sarder, P., Nehorai, A.: Deconvolution methods for 3-D fluorescence microscopy images. IEEE Signal Process. Mag. 23, 32–45Google Scholar
- 15.NVIDIA Corporation, Documentation for CUDA FFT (CUFFT) Library (2008), http://developer.download.nvidia.com/compute/cuda/2_0/docs/CUBLAS_Library_2.0.pdf
- 16.Mele, V., Murli, A., Romano, D.: Some remarks on performance evaluation in parallel GPU computing. Preprint del Dipartimento di Matematica e applicazioni. Univerity of Naples Federico II (2011)Google Scholar