Acceleration of Landweber-type algorithms by suppression of projection on the maximum singular vector

Author

Pan, Tin-Su ; Yagle, Andrew E.

Author_Institution

Dept. of Electr. Eng. & Comput. Sci., Michigan Univ., Ann Arbor, MI, USA

Volume

11

Issue

4

fYear

1992

fDate

12/1/1992 12:00:00 AM

Firstpage

479

Lastpage

487

Abstract

A procedure that speeds up convergence during the initial stage (the first 100 forward and backward projections) of Landweber-type algorithms, for iterative image reconstruction for positron emission tomography (PET), which include the Landweber, generalized Landweber, and steepest descent algorithms, is discussed. The procedure first identifies the singular vector associated with the maximum singular value of the PET system matrix, and then suppresses projection of the data on this singular vector after a single Landweber iteration. It is shown that typical PET system matrices have a significant gap between their two largest singular values; hence, this suppression allows larger gains in subsequent iterations, speeding up convergence by roughly a factor of three

Keywords

computerised tomography; image reconstruction; radioisotope scanning and imaging; Landweber-type algorithms; algorithm acceleration; iterative image reconstruction; maximum singular vector; medical diagnostic imaging; nuclear medicine; positron emission tomography; projection suppression; Acceleration; Character generation; Convergence; Image reconstruction; Iterative algorithms; Nuclear medicine; Positron emission tomography; Reconstruction algorithms; Roundoff errors; Subspace constraints;

fLanguage

English

Journal_Title

Medical Imaging, IEEE Transactions on

Publisher

ieee

ISSN

0278-0062

Type

jour

DOI

10.1109/42.192683

Filename

192683