Jump to content

Simultaneous algebraic reconstruction technique

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Prodx3 (talk | contribs) at 19:21, 6 February 2015 (Fixed the dead link). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

The SART algorithm[1] (Simultaneous Algebraic Reconstruction Technique), proposed by Anders Andersen and Avinash Kak in 1984, has had a major impact in computerized tomography (CT) imaging applications where the projection data is limited.

As a measure of its popularity, researchers have proposed various extensions to SART: OS-SART, FA-SART, VW-OS-SART[2], SARTF, etc. Researchers have also studied how SART can best be implemented on different parallel processing architectures. SART and its proposed extensions are used in emission CT in nuclear medicine, dynamic CT, and holographic tomography, and other reconstruction applications.[3] Convergence of the SART algorithm was theoretically established in 2004 by Jiang and Wang.[4] Further convergence analysis was done by Yan.[5]

An application of SART to ionosphere was presented by Hobiger et al.[6]

References

  1. ^ Andersen, A. and Kak, A., "Simultaneous Algebraic Reconstruction Technique (SART): A Superior Implementation of ART," Ultrasonic Imaging, 1984 http://www.sciencedirect.com/science/article/pii/0161734684900087
  2. ^ http://www.hindawi.com/journals/ijbi/2006/010398/abs/
  3. ^ Byrne, C. A unified treatment of some iterative algorithms in signal processing and image reconstruction. Inverse Problems 20 103 (2004)
  4. ^ Jiang, M. and Wang, G., "Convergence of the simultaneous algebraic reconstruction technique (SART)" IEEE Transactions on Image Processing, Vol. 12, August 2003, pp. 957–961.
  5. ^ ftp://ftp.math.ucla.edu/pub/camreport/cam10-27.pdf
  6. ^ http://www.terrapub.co.jp/journals/EPS/abstract/6007/60070727.html