z-logo
open-access-imgOpen Access
The application of algebraic reconstruction techniques in X-ray refraction contrast CT
Author(s) -
Kai Zhang,
Ping Zhu,
Wanxia Huang,
Yuan Qin,
Liu Li,
Bin Yuan,
Junyue Wang,
Shu Hu,
Bo Chen,
Yijin Liu,
Enrong Li,
Xiaosong Liu,
Wu Zhang
Publication year - 2008
Publication title -
wuli xuebao
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.199
H-Index - 47
ISSN - 1000-3290
DOI - 10.7498/aps.57.3410
Subject(s) - refraction , tomography , contrast (vision) , projection (relational algebra) , computer science , optics , algebraic reconstruction technique , iterative reconstruction , iterative method , phase contrast imaging , algorithm , computer vision , physics , phase contrast microscopy
X-ray refraction contrast CT is the computer tomography based on phase contrast. When the biological samples are taken from organs or tissuesX-ray refraction contrast CT provides more internal subtle details compared with conventional absorption CT images and it is considered a novel and very promising imaging technique. The iterative and analytical algorithms are the two main strategies in computer tomography. In the field of X-ray refraction contrast CT several analytical algorithms have been reported in the past. However the algorithm using iterative method have not been proposed. In this studywe tested the application of iterative algorithm in X-ray refraction contrast CT image reconstructioninvestigated the influence of the order in which data are accessed in algebraic reconstruction techniquesand satisfactory CT images were obtained. Our data demonstrated that when biological samples are imaged or the complete projective data are not availableour iterative algorithm showed significant advantage over the analytical algorithms. It effectively reduces the number of the projection dataexposure timeas well as the radiation damage to the biology samples.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here