Article information

2008 , Volume 13, ¹ 6, p.121-133

Pickalov V.V., Kazantsev D.I.

Properties of the regularized Gerchberg-Papoulis algorithm in a fan-beam type tomography

Problems of computational tomography with a small number of views require application of algorithms utilizing a priori information regarding the solution. Gerchberg-Papoulis algorithm (G-P), based on the theorem of a central slice, is known to be one of the best iterative methods of a few-view tomography for a parallel geometry of scanning. In a fan-beam tomography case such algorithm has not been yet investigated, because of there is no an analog of the central slice theorem for this case. In the present contribution, a recently developed generalization of the central slice theorem for fan-beam geometry is described. A new iterative G-P algorithm is developed based on the generalization. Two versions of the numerical scheme are investigated. An influence of the superimposed random noise on accuracy of reconstructions is studied; regularization criteria are developed which allow suppression of noise in measurements.

[full text]
Keywords: few-view tomography, fan-beam tomography, Gerchberg-Papoulis algorithm, regularization, noise influence

Author(s):
Pickalov Valery Vladimirovich
Dr. , Senior Scientist
Position: Leading research officer
Office: Khristianovich Institute of Theoretical and Applied Mechanics SB RAS
Address: 630090, Russia, Novosibirsk, 4/1, str.Institutskaya
Phone Office: (383) 330 36 74
E-mail: pickalov@itam.nsc.ru

Kazantsev Daniel Ivanovich
Position: Junior Research Scientist
Office: Khristianovich Institute of Theoretical and Applied Mechanics SB RAS
Address: 630090, Russia, Novosibirsk, 4/1, str.Institutskaya
Phone Office: (383) 330 73 32
E-mail: dkazanc@ngs.ru


Bibliography link:
Pickalov V.V., Kazantsev D.I. Properties of the regularized Gerchberg-Papoulis algorithm in a fan-beam type tomography // Computational technologies. 2008. V. 13. ¹ 6. P. 121-133
Home| Scope| Editorial Board| Content| Search| Subscription| Rules| Contacts
ISSN 1560-7534
© 2024 FRC ICT