Feasibility of Simulated Annealing Tomography

Simulated annealing tomography (SAT) is a simple iterative image reconstruction technique which can yield a superior reconstruction compared with filtered back-projection (FBP). However, the very high computational cost of iteratively calculating discrete Radon transform (DRT) has limited the feasibility of this technique. In this paper, we propose an approach based on the pre-calculated intersection lengths array (PILA) which helps to remove the step of computing DRT in the simulated annealing procedure and speed up SAT by over 300 times. The enhancement of convergence speed of the reconstruction process using the best of multiple-estimate (BoME) strategy is introduced. The performance of SAT under different conditions and in comparison with other methods is demonstrated by numerical experiments.

[1]  H H Barrett,et al.  Reconstruction of an object from its coded image and object constraints. , 1984, Applied optics.

[2]  Ignace Lemahieu,et al.  PET image reconstruction using simulated annealing , 1995, Medical Imaging.

[3]  Lin Ma,et al.  Applications of critical temperature in minimizing functions of continuous variables with simulated annealing algorithm , 2010, Comput. Phys. Commun..

[4]  Cheng-Chien Kuo,et al.  Modified particle swarm optimization algorithm with simulated annealing behavior and its numerical verification , 2011, Appl. Math. Comput..

[5]  S Webb,et al.  SPECT reconstruction by simulated annealing. , 1989 .

[6]  Avinash C. Kak,et al.  Principles of computerized tomographic imaging , 2001, Classics in applied mathematics.

[7]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[8]  N Ohyama,et al.  Three-dimensional blood vessel reconstruction by simulated annealing. , 1989, Optics letters.

[9]  K A Girodias,et al.  Parallel simulated annealing for emission tomography. , 1991, Physics in medicine and biology.

[10]  S. Mirza,et al.  Hybrid simulated annealing image reconstruction for transmission tomography , 2009 .

[11]  H H Barrett,et al.  Image reconstruction from coded data: I. Reconstruction algorithms and experimental results. , 1985, Journal of the Optical Society of America. A, Optics and image science.

[12]  Peter Ross,et al.  Improving Evolutionary Timetabling with Delta Evaluation and Directed Mutation , 1994, PPSN.

[13]  R. Siddon.  Fast calculation of the exact radiological path for a three-dimensional CT array. , 1985, Medical physics.

[14]  Isaac E. Lagaris,et al.  GenAnneal: Genetically modified Simulated Annealing , 2006, Comput. Phys. Commun..

[15]  T. J. Hebert,et al.  Numerical evaluation of methods for computing tomographic projections , 1994 .

[16]  Lin Ma,et al.  Investigation of temperature parallel simulated annealing for optimizing continuous functions with application to hyperspectral tomography , 2011, Appl. Math. Comput..

[17]  H H Barrett,et al.  Reconstruction of objects from coded images by simulated annealing. , 1983, Optics letters.

[18]  Jeffrey A. Fessler.  Penalized weighted least-squares image reconstruction for positron emission tomography , 1994, IEEE Trans. Medical Imaging.

[19]  H H Barrett,et al.  Image reconstruction from coded data: II. Code design. , 1985, Journal of the Optical Society of America. A, Optics and image science.

[20]  N Ohyama,et al.  Analysis of the cost function used in simulated annealing for CT image reconstruction. , 1990, Applied optics.

[21]  Thiago de Castro Martins,et al.  Image Reconstruction Using Interval Simulated Annealing in Electrical Impedance Tomography , 2012, IEEE Transactions on Biomedical Engineering.