Abstract
Exploiting the x-ray measurements obtained in different energy bins, spectral computed tomography (CT) has the ability to recover the 3-D description of a patient in a material basis. This may be achieved solving two subproblems, namely the material decomposition and the tomographic reconstruction problems. In this work, we address the material decomposition of spectral x-ray projection images, which is a nonlinear ill-posed problem. Our main contribution is to introduce a material-dependent spatial regularization in the projection domain. The decomposition problem is solved iteratively using a Gauss-Newton algorithm that can benefit from fast linear solvers. A Matlab implementation is available online. The proposed regularized weighted least squares Gauss-Newton algorithm (RWLS-GN) is validated on numerical simulations of a thorax phantom made of up to five materials (soft tissue, bone, lung, adipose tissue, and gadolinium), which is scanned with a 120kV source and imaged by a 4-bin photon counting detector. To evaluate the method performance of our algorithm, different scenarios are created by varying the number of incident photons, the concentration of the marker and the configuration of the phantom. The RWLS-GN method is compared to the reference maximum likelihood Nelder-Mead algorithm (ML-NM). The convergence of the proposed method and its dependence on the regularization parameter are also studied. We show that material decomposition is feasible with the proposed method and that it converges in few iterations. Material decomposition with ML-NM was very sensitive to noise, leading to decomposed images highly affected by noise, and artifacts even for the best case scenario. The proposed method was less sensitive to noise and improved contrast-to-noise ratio of the gadolinium image. Results were superior to those provided by ML-NM in terms of image quality and decomposition was 70 times faster. For the assessed experiments, material decomposition was possible with the proposed method when the number of incident photons was equal or larger than 105 and when the marker concentration was equal or larger than 0.03g·cm-3 . The proposed method efficiently solves the nonlinear decomposition problem for spectral CT, which opens up new possibilities such as material-specific regularization in the projection domain and a parallelization framework, in which projections are solved in parallel.
Highlights
Spectral computed tomography (CT) is gaining increasing attention
For maximum likelihood Nelder-Mead algorithm (ML-NM), the largest errors are related to the recovery of gadolinium, which results in a dramatic cross-talk with the soft and bone tissue images
For regularized weighted least squares Gauss-Newton algorithm (RWLS-GN), it can be seen that the gadolinium image presents the lowest error and that the largest error occurred at borders of the spine
Summary
Spectral computed tomography (CT) is gaining increasing attention. Exploiting X-ray measurements acquired at multiple energies, this new imaging modality has the ability to recover the concentration maps of the constituents of the tissues in a quantitative manner. Despite its excellent decomposition quality [28,29,30,31,32], this approach is more difficult to implement when three materials or more are to be recovered This can be a serious drawback for K-edge imaging applications. We present a new framework for the decomposition of a single projection, assuming a physical image formation model is known. Projection-based approaches focus on penalties in the image domain which are imposed regularizing the tomographic problem. Gauss-Newton minimization was successfully applied to several medical imaging inverse problems [37,38,39,40] In this paper, it is implemented using explicit computation of the Hessian, which is a sparse and structured matrix. To promote reproducibility of this research, the computer code (MATLAB scripts) related to this study is available online [41]
Published Version (Free)
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have