A general cone-beam reconstruction algorithm

Publisher Website
Google Scholar
Abstract
Considering the characteristics of the X-ray microscope system being developed at SUNY at Buffalo and the limitations of available cone-beam reconstruction algorithms, a general cone-beam reconstruction algorithm and several special versions of it are proposed and validated by simulation. The cone-beam algorithm allows various scanning loci, handles reconstruction of rod-shaped specimens which are common in practice, and facilitates near real-time reconstruction by providing the same computational efficiency and parallelism as L.A. Feldkamp et al.'s (1984) algorithm. Although the present cone-beam algorithm is not exact, it consistently gives satisfactory reconstructed images. Furthermore, it has several nice properties if the scanning locus meets some conditions. First, reconstruction within a midplane is exact using a planar scanning locus. Second, the vertical integral of a reconstructed image is equal to that of the actual image. Third, reconstruction is exact if an actual image is independent of rotation axis coordinate z. Also, the general algorithm can uniformize and reduce z-axis artifacts, if a helix-like scanning locus is used.