论文信息 - A new algorithm for 3D binary tomography

A new algorithm for 3D binary tomography

Abstract In this paper we propose a new algorithm for reconstructing 3D binary images on a lattice from a small number of their projections. The algorithm is iterative; a new 3D image is computed in each iteration, using network flow methods. It is based on an algorithm for computing 2D reconstructions, which performs very well for a large class of images. We demonstrate the performance of our algorithm on a set of characteristic test images.

Kees Joost Batenburg

[1] Joost Batenburg. Reconstructing binary images from discrete X-rays , 2004 .

[2] Kees Joost Batenburg,et al. Discrete Tomography of Ga and InGa Particles from HREM Image Simulation and Exit Wave Reconstruction. , 2004 .

[3] K. J. Batenburg,et al. Prospects for Bright Field and Dark Field Electron Tomography on a Discrete Grid , 2004, Microscopy and Microanalysis.

[4] William Schroeder,et al. The Visualization Toolkit: An Object-Oriented Approach to 3-D Graphics , 1997 .

[5] G. Herman,et al. Discrete tomography : foundations, algorithms, and applications , 1999 .

[6] Peter Gritzmann,et al. On the computational complexity of reconstructing lattice sets from their X-rays , 1999, Discret. Math..

[7] David K. Smith. Network Flows: Theory, Algorithms, and Applications , 1994 .

[8] Peter Schwander,et al. An approach to quantitative high-resolution transmission electron microscopy of crystalline materials , 1995 .

[9] Kim,et al. Mapping projected potential, interfacial roughness, and composition in general crystalline solids by quantitative transmission electron microscopy. , 1993, Physical review letters.

[10] V.,et al. Discrete Tomography of Ga and InGa Particles from HREM Image Simulation and Exit Wave Reconstruction , 2004 .