Abstract
AbstractIn algebraic reconstruction of images in computerized tomography we are dealing with rectangular, large, sparse and ill‐conditioned linear systems of equations. In this paper we describe a two‐grid algorithm for solving such kind of linear systems, which uses Kaczmarz's projection method as relaxation. The correction step is performed with a special “local” aggregation / disaggregation type procedure. In this respect, we have to solve a small sized minimization problem associated to each coarse grid pixel. The information so obtained is then “distributed” to the neighbour fine grid pixels. Some image reconstruction experiments are also presented. (© 2010 Wiley‐VCH Verlag GmbH & Co. KGaA, Weinheim)
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
