z-logo
open-access-imgOpen Access
A reconstruction method for cone-beam differential x-ray phase-contrast computed tomography
Author(s) -
Jian Fu,
Astrid Velroyen,
Renbo Tan,
Junwei Zhang,
Liyuan Chen,
Arne Tapfer,
Martin Bech,
Franz Pfeiffer
Publication year - 2012
Publication title -
optics express
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.394
H-Index - 271
ISSN - 1094-4087
DOI - 10.1364/oe.20.021512
Subject(s) - optics , projection (relational algebra) , beam (structure) , physics , tomography , cone beam computed tomography , phase contrast imaging , focus (optics) , phase (matter) , iterative reconstruction , contrast (vision) , computer science , algorithm , computed tomography , computer vision , phase contrast microscopy , medicine , quantum mechanics , radiology
Most existing differential phase-contrast computed tomography (DPC-CT) approaches are based on three kinds of scanning geometries, described by parallel-beam, fan-beam and cone-beam. Due to the potential of compact imaging systems with magnified spatial resolution, cone-beam DPC-CT has attracted significant interest. In this paper, we report a reconstruction method based on a back-projection filtration (BPF) algorithm for cone-beam DPC-CT. Due to the differential nature of phase contrast projections, the algorithm restrains from differentiation of the projection data prior to back-projection, unlike BPF algorithms commonly used for absorption-based CT data. This work comprises a numerical study of the algorithm and its experimental verification using a dataset measured with a three-grating interferometer and a micro-focus x-ray tube source. Moreover, the numerical simulation and experimental results demonstrate that the proposed method can deal with several classes of truncated cone-beam datasets. We believe that this feature is of particular interest for future medical cone-beam phase-contrast CT imaging applications.

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