Improving the convergence of iterative filtered backprojection algorithms

David S. Lalush, Benjamin Tsui

Research output: Contribution to journalArticle

Abstract

Several authors have proposed variations of the iterative filtered backprojection (IFBP) reconstruction algorithms claiming fast initial convergence rates. We have found that these algorithms are trying to minimize an unusual squared-error criterion in a suboptimal way. As a result, existing IFBP algorithms are inefficient in the minimization of the criterion, and may become unstable at higher iteration numbers. We show that existing IFBP algorithms can be modified to use the steepest descent technique by simply optimizing the step size at each iteration. Further gains in convergence rates can be achieved with conjugate gradient IFBP algorithms derived from the same criterion. The steepest descent and conjugate gradient IFBP algorithms are guaranteed to converge, unlike some IFBP algorithms, and will do so in fewer iterations than existing IFBP algorithms.

Original languageEnglish (US)
Pages (from-to)1283-1286
Number of pages4
JournalMedical Physics
Volume21
Issue number8
DOIs
StatePublished - 1994
Externally publishedYes

Keywords

  • attenuation compensation
  • iterative optimization
  • reconstruction algorithms

ASJC Scopus subject areas

  • Biophysics
  • Radiology Nuclear Medicine and imaging

Cite this

Improving the convergence of iterative filtered backprojection algorithms. / Lalush, David S.; Tsui, Benjamin.

In: Medical Physics, Vol. 21, No. 8, 1994, p. 1283-1286.

Research output: Contribution to journalArticle

@article{edbdbfb7bb5e49e38e212e8096ef1a38,
title = "Improving the convergence of iterative filtered backprojection algorithms",
abstract = "Several authors have proposed variations of the iterative filtered backprojection (IFBP) reconstruction algorithms claiming fast initial convergence rates. We have found that these algorithms are trying to minimize an unusual squared-error criterion in a suboptimal way. As a result, existing IFBP algorithms are inefficient in the minimization of the criterion, and may become unstable at higher iteration numbers. We show that existing IFBP algorithms can be modified to use the steepest descent technique by simply optimizing the step size at each iteration. Further gains in convergence rates can be achieved with conjugate gradient IFBP algorithms derived from the same criterion. The steepest descent and conjugate gradient IFBP algorithms are guaranteed to converge, unlike some IFBP algorithms, and will do so in fewer iterations than existing IFBP algorithms.",
keywords = "attenuation compensation, iterative optimization, reconstruction algorithms",
author = "Lalush, {David S.} and Benjamin Tsui",
year = "1994",
doi = "10.1118/1.597210",
language = "English (US)",
volume = "21",
pages = "1283--1286",
journal = "Medical Physics",
issn = "0094-2405",
publisher = "AAPM - American Association of Physicists in Medicine",
number = "8",

}

TY - JOUR

T1 - Improving the convergence of iterative filtered backprojection algorithms

AU - Lalush, David S.

AU - Tsui, Benjamin

PY - 1994

Y1 - 1994

N2 - Several authors have proposed variations of the iterative filtered backprojection (IFBP) reconstruction algorithms claiming fast initial convergence rates. We have found that these algorithms are trying to minimize an unusual squared-error criterion in a suboptimal way. As a result, existing IFBP algorithms are inefficient in the minimization of the criterion, and may become unstable at higher iteration numbers. We show that existing IFBP algorithms can be modified to use the steepest descent technique by simply optimizing the step size at each iteration. Further gains in convergence rates can be achieved with conjugate gradient IFBP algorithms derived from the same criterion. The steepest descent and conjugate gradient IFBP algorithms are guaranteed to converge, unlike some IFBP algorithms, and will do so in fewer iterations than existing IFBP algorithms.

AB - Several authors have proposed variations of the iterative filtered backprojection (IFBP) reconstruction algorithms claiming fast initial convergence rates. We have found that these algorithms are trying to minimize an unusual squared-error criterion in a suboptimal way. As a result, existing IFBP algorithms are inefficient in the minimization of the criterion, and may become unstable at higher iteration numbers. We show that existing IFBP algorithms can be modified to use the steepest descent technique by simply optimizing the step size at each iteration. Further gains in convergence rates can be achieved with conjugate gradient IFBP algorithms derived from the same criterion. The steepest descent and conjugate gradient IFBP algorithms are guaranteed to converge, unlike some IFBP algorithms, and will do so in fewer iterations than existing IFBP algorithms.

KW - attenuation compensation

KW - iterative optimization

KW - reconstruction algorithms

UR - http://www.scopus.com/inward/record.url?scp=0027939803&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0027939803&partnerID=8YFLogxK

U2 - 10.1118/1.597210

DO - 10.1118/1.597210

M3 - Article

VL - 21

SP - 1283

EP - 1286

JO - Medical Physics

JF - Medical Physics

SN - 0094-2405

IS - 8

ER -