Binary Tomography with Deblurring
We study two scenarios of limited-angle binary tomography with data distorted with an unknown convolution: Either the projection data are taken from a blurred object, or the projection data themselves are blurred. These scenarios are relevant in case of scattering and due to a finite resolution of the detectors. Assuming that the unknown blurring process is adequately modeled by an isotropic Gaussian convolution kernel with unknown scale-parameter, we show that parameter estimation can be combined with the reconstruction process. To this end, a recently introduced Difference-of-Convex-Functions programming approach to limited-angle binary tomographic reconstruction is complemented with Expectation-Maximization iteration. Experimental results show that the resulting approach is able to cope with both ill-posed problems, limited-angle reconstruction and deblurring, simultaneously.
KeywordsBinary Tomography Reconstruction Algorithm Gaussian Kernel Projection Data Reconstruction Process
Unable to display preview. Download preview PDF.
- 1.Gonzales, R.C., Woods, R.E.: Digital Image Processing, 2nd edn. Addison Wesley, Reading (1992)Google Scholar
- 5.Carazo, J.M., Sorzano, C.O., Rietzel, E., Schröder, R., Marabini, R.: Discrete tomography in electron microscopy. In: Herman, G.T., Kuba, A. (eds.) Discrete Tomography. Foundations, Algorithms, and Applications, pp. 405–416. Birkhäuser, Boston (1999)Google Scholar
- 7.Weber, S., Schüle, T., Schnörr, C., Hornegger, J.: A linear programming approach to limited angle 3d reconstruction from dsa projections. Special Issue of Methods of Information in Medicine 4, 320–326 (2004)Google Scholar
- 8.Schnörr, C., Schüle, T., Weber, S.: Variational Reconstruction with DC-Programming. In: Herman, G.T., Kuba, A. (eds.) Advances in Discrete Tomography and Its Applications. Birkhäuser, Boston (to appear, 2006)Google Scholar
- 9.MacLachlan, G., Krishnan, T.: The EM Algorithm and Extensions. Wiley, Chichester (1996)Google Scholar
- 12.Pham Dinh, T., Elbernoussi, S.: Duality in d.c. (difference of convex functions) optimization subgradient methods. In: Trends in Mathematical Optimization. Int. Series of Numer. Math., vol. 84, pp. 277–293. Birkhäuser Verlag, Basel (1988)Google Scholar
- 14.Rockafellar, R.T.: Convex analysis, 2nd edn. Princeton Univ. Press, Princeton (1972)Google Scholar