Fast iterative algorithm for reconstruction from divergent-ray projections

Access Full Text

Fast iterative algorithm for reconstruction from divergent-ray projections

For access to this article, please select a purchase option:

Buy article PDF
£12.50
(plus tax if applicable)
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
IEE Proceedings E (Computers and Digital Techniques) — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

A convergent algorithm is introduced which solves the exact system relating the Lagrange multipliers and the projections using the successive relaxation method without any approximation. The system gives the minimum-energy solution which is different from that of the convolution algorithm, but it is the same as the ART reconstruction except that it discretises the Lagrange multipliers instead of the image. Its reconstructions are substantially better than those of the convolution algorithm. Although the new algorithm uses the exact matrix of this system, its speed is very high because it utilises the special matrix structure; namely the areas of equal elements. The statistics of the error between the ‘true’ projections and the projections corresponding to the reconstruction can be made the same as the noise statistics in the projection data, but the algorithm does not aim to produce the minimum norm solution to the problem of fitting noisy data. The number of projections N should be related to the number of measurements per projection P by P = vN/2, where v is an integer. Computed results verifying these conclusions are included. The algorithm can also use the object boundaries to improve its reconstruction.

Inspec keywords: iterative methods; computerised picture processing

Other keywords: fast iterative algorithm; reconstruction; ART reconstruction; convolution algorithm; Lagrange multipliers; successive relaxation method; convergent algorithm; divergent-ray projections

Subjects: Digital signal processing; Optical information, image and video signal processing; Communications computing

References

    1. 1)
      • C.E. Goutis , T.S. Durrani . Tomographic algorithms for general line integrals. IEEE Trans. , 1399 - 1404
    2. 2)
      • C.E. Goutis , T.S. Durrani . Constrained optimisation algorithms for divergent ray tomography. IEEE Trans. , 3620 - 3627
    3. 3)
      • Goutis, C.E.: `Constraint optimisation algorithms for digital image reconstructions from projections', 1978, Ph.D. Thesis, Southampton University, England.
    4. 4)
      • T.S. Durrani , C.E. Goutis . Optimisation techniques for digital image reconstructions from their projections. IEE Proc. E, Comput. & Digital Tech. , 5 , 161 - 169
    5. 5)
      • G.T. Herman , A.V. Laksminarayan , A. Naparstek . Convolution reconstruction techniques for divergent beams. Comput. Biol. & Med. , 259 - 271
http://iet.metastore.ingenta.com/content/journals/10.1049/ip-e.1984.0014
Loading

Related content

content/journals/10.1049/ip-e.1984.0014
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading