Abstract
A new fast version of the reconstruction algorithm for computed tomography based on the simultaneous algebraic reconstruction technique (SART) is proposed. The algorithm iteration is asymptotically accelerated using the fast Hough transform from O(n 3) to O(n 2logn). Similarly to the algebraic reconstruction technique (RegART), which was proposed by us previously, the regularization operator is applied after each iteration. A bilateral filter plays the role of this operator. The algorithm behavior is investigated using the model experiment.
Similar content being viewed by others
References
F. Natterer, Mathematical Aspects of Computerized Tomography (Springer, 1981).
R. Gordon, IEEE Trans. Nucl. Sci. 21 (1974).
A. H. Andersen and A. C. Kak, Ultrasonic Imaging 6,81 (Jan 1984).
D. Nikolaev et al., Proc. 22th. Eur. Conf. on Modelling and Simulation, 2008, p. 238.
V. E. Prun et al., Avtomatika Telemekh. (2013) (in press).
M. Chukalina et al., Proc. Eur. Conf. on Modelling and Simulation, 2007, p. 309.
J. D. Kyle et al., Appl. Optics 50(6), 891 (2011).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Prun, V.E., Nikolaev, D.P., Buzmakov, A.V. et al. Effective regularized algebraic reconstruction technique for computed tomography. Crystallogr. Rep. 58, 1063–1066 (2013). https://doi.org/10.1134/S1063774513070158
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S1063774513070158