Skip to content
naulon
Not checkedNot checked for notices yet.

Low-Dose CT Image Reconstruction With a Deep Learning Prior

Hyoung Suk Park, Kyungsang Kim, Kiwan Jeon

IEEE Access · 2020

doi:10.1109/access.2020.3020040 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

In low-dose computed tomography (LDCT), a penalized weighted least squares (PWLS) approach that incorporates the Poisson statistics of X-ray photons can significantly reduce excessive quantum noise. To improve the quality of LDCT images, prior information such as the total variation, Markov random field, and nonlocal mean, can be imposed onto the target image. However, this information may be limited to reflect the characteristics of the target images, thereby resulting in unexpected side effects (e.g. blurry images). In this paper, we propose a PWLS method combined with a deep learning prior, which is learned from standard dose CT (SDCT) images. The proposed model learns a noise reduction function that maps an LDCT image to its corresponding SDCT images and estimates the prior distribution using a Pearson &#x03C7;<sup>2</sup> divergence. The model can be converted to the least squares generative adversarial network with an added PWLS objective, where the optimal generator acts as the noise reduction function. We reformulate the proposed model as a constrained optimization problem and solve it using the alternating optimization (AO) algorithm. Clinical SDCT and simulated LDCT scans of ten patients were used to show the validity of the proposed method. Results show that the proposed method outperforms other PWLS methods, by imposing priors such as the total variation and the nonlocal mean.

Abstract licence: CC BY-NC-ND

References26

    26 more references, whose wording the paper’s licence keeps private.

    Reads

    Read by people on this page

    None yet.

    Checked or read by AI through naulon

    None yet.

    A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

    Are you an author?

    Is this your paper?

    Claim it to add your note and be paid when agents cite it. Free.