Skip to main page content
U.S. flag

An official website of the United States government

Dot gov

The .gov means it’s official.
Federal government websites often end in .gov or .mil. Before sharing sensitive information, make sure you’re on a federal government site.

Https

The site is secure.
The https:// ensures that you are connecting to the official website and that any information you provide is encrypted and transmitted securely.

Access keys NCBI Homepage MyNCBI Homepage Main Content Main Navigation
. 2017 Dec;36(12):2487-2498.
doi: 10.1109/TMI.2017.2767290.

Robust Low-Dose CT Sinogram Preprocessing via Exploiting Noise-Generating Mechanism

Robust Low-Dose CT Sinogram Preprocessing via Exploiting Noise-Generating Mechanism

Qi Xie et al. IEEE Trans Med Imaging. 2017 Dec.

Abstract

Computed tomography (CT) image recovery from low-mAs acquisitions without adequate treatment is always severely degraded due to a number of physical factors. In this paper, we formulate the low-dose CT sinogram preprocessing as a standard maximum a posteriori (MAP) estimation, which takes full consideration of the statistical properties of the two intrinsic noise sources in low-dose CT, i.e., the X-ray photon statistics and the electronic noise background. In addition, instead of using a general image prior as found in the traditional sinogram recovery models, we design a new prior formulation to more rationally encode the piecewise-linear configurations underlying a sinogram than previously used ones, like the TV prior term. As compared with the previous methods, especially the MAP-based ones, both the likelihood/loss and prior/regularization terms in the proposed model are ameliorated in a more accurate manner and better comply with the statistical essence of the generation mechanism of a practical sinogram. We further construct an efficient alternating direction method of multipliers algorithm to solve the proposed MAP framework. Experiments on simulated and real low-dose CT data demonstrate the superiority of the proposed method according to both visual inspection and comprehensive quantitative performance evaluation.

PubMed Disclaimer

Figures

Fig. 1
Fig. 1
(a) An example of noise-free CT image. (b) The amplified illustration of the red box in (a). (c) The FBP reconstruction result with only simulated quanta fluctuation added to projection data. (d) The FBP reconstruction result with only simulated electronic noise added to projection data. (e) The FBP reconstruction result with both simulated quanta fluctuation and simulated electronic noise added to projection data.
Fig. 2
Fig. 2
(a) The manifold of an example sinogram data with axis along detector elements and projection views. The upper right is the illustration of the example sinogram. The upper left is the amplified area at a 2.5 times larger scale for easy observation of details; (b) and (c) are the absolute of the first and second order vertical derivatives calculated on the example sinogram, respectively, where the deeper the color is, the larger the value is. It can be observed from (a) that it is better to describe the sinogram as piecewise linear rather than piecewise constant (as what TV encourages). From (b) and (c), one can see that the second order derivative of a sinogram is evidently more sparse the first order one.
Fig. 3
Fig. 3
(a) illustration of the 1st frame of the noise-free digital myocardial perfusion phantom; (b) The noise-free image anthropomorphic torso phantom.
Fig. 4
Fig. 4
(a) The noise-free digital XCAT image; (b)–(h) The images reconstructed by the FBP PL, PWLS, POCS-TV, PWLS-TV2, IMAP-TV and IMAP-TV2 methods at 20 mAs, respectively. The demarcated area in each image is amplified at a 3 time larger scale for easy observation.
Fig. 5
Fig. 5
The vertical profiles of the noise-free image and recovery results of the 7 competing methods of digital XCAT images at 20 mAs. The vertical profiles is located at the pixel positions x = 245 and y from 155 to 180. as shown in Fig. 3(a).
Fig. 6
Fig. 6
(a) The noise-free image of the anthropomorphic torso phantom study; (b)–(h) The images reconstructed by FBP. PL, PWLS, POCS-TV, PWLS-TV2, IMAP-TV and IMAP-TV2 at 17 mAs, respectively. The demarcated area in each image is amplified at a 3 time larger scale for easy observation of details.
Fig. 7
Fig. 7
The vertical profiles of the noise-free image and recovery result of the 7 methods of digital anthropomorphic torso phantom at 17 mAs. The vertical profiles is located at the pixel positions x = 240 and y from 160 to 195. as shown in Fig. 3(b).
Fig. 8
Fig. 8
The NVF images at the position shown as ROI 3 in Fig. 3(b), (a) noise-free image, (b)–(h) the results reconstructed by FBP, PL, PWLS, POCS-TV, PWLS-TV2, IMAP-TV and IMAP-TV2.
Fig. 9
Fig. 9
(a)–(f) Residuals of the result reconstructed by PL, PWLS, POCS-TV, PWLS-TV2, IMAP-TV, IMAP-TV2 at 17 mAs, respectively.
Fig. 10
Fig. 10
Comparison of ROI reconstructed by the 6 competing methods.
Fig. 11
Fig. 11
(a) The high-dose image of the 11th frame of preclinical porcine data; (b)–(h) The images reconstructed by the FBP, PL, PWLS, POCS-TV, PWLS-TV2, IMAP-TV and IMAP-TV2 methods at 20 mAs, respectively. The demarcated area in each image is amplified at a 3 time larger scale for easy observation.
Fig. 12
Fig. 12
(a) The MBF maps from high-dose images; (b)–(h) The MBF maps from simulated low-dose images reconstructed by FBP, PL, PWLS, POCS-TV, PWLS-TV2. IMAP-TV and IMAP-TV2 methods, respectively. The demarcated area in each image is amplified at a 3 time larger scale for easy observation.

Similar articles

Cited by

References

    1. Beck A, Teboulle M. A fast iterative shrinkage-thresholding algorithm for linear inverse problems. Siam Journal on Imaging Sciences. 2009;2(1):183–202.
    1. Boyd S, Parikh N, Chu E, Peleato B, Eckstein J. Distributed optimization and statistical learning via the alternating direction method of multipliers. Foundations & Trends in Machine Learning. 2011;3(1):1–122.
    1. Boyd VLS. Convex optimization. Cambridge university press; 2004.
    1. Chambolle A, Lions PL. Image recovery via total variation minimization and related problems. Numerische Mathematik. 1997;76(2):167–188.
    1. Chen C, He B, Ye Y, Yuan X. The direct extension of admm for multi-block convex minimization problems is not necessarily convergent. Mathematical Programming. 2016;155(1):57–79.

Publication types