Discrete tomography has proven itself as a powerful approach to image reconstruction from limited data. In recent years, algebraic reconstruction methods have been applied successfully to a range of experimental data sets. However, the computational cost of such reconstruction techniques currently prevents routine application to large data-sets. In this paper we investigate the use of adaptive refinement on QuadTree grids to reduce the number of pixels (or voxels) needed to represent an image. Such locally refined grids match well with the domain of discrete tomography as they are optimally suited for representing images containing large homogeneous regions. Reducing the number of pixels ultimately promises a reduction in both the computation time of discrete algebraic reconstruction techniques as well as reduced memory requirements. At the same time, a reduction of the number of unknowns can reduce the influence of noise on the reconstruction. The resulting refined grid can be used directly for further post-processing (such as segmentation, feature extraction or metrology). The proposed approach can also be used in a non-adaptive manner for region-of-interest tomography. We present a computational approach for automatic determination of the locations where the grid must be defined. We demonstrate how algebraic discrete tomography algorithms can be constructed based on the QuadTree data structure, resulting in reconstruction methods that are fast, accurate and memory efficient.
, , ,
Lecture Notes in Computer Science
IAPR International Conference, DGCI
Scientific Computing

van Leeuwen, T., & Batenburg, J. (2014). Adaptive Grid Refinement for Discrete Tomography. In Proceedings of IAPR International Conference, DGCI 2014 (pp. 297–308). Springer.