Skip to content
naulon
Not checkedNot checked for notices yet.

Learning Image From Projection: A Full-Automatic Reconstruction (FAR) Net for Computed Tomography

Genwei Ma, Yining Zhu, Xing Zhao

IEEE Access · 2020

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

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

Abstract

The x-ray computed tomography (CT) is essential for medical diagnosis and industrial nondestructive testing. The aim of CT is to recover or reconstruct image from projection data. However, in particular, the reconstructed image usually suffers from complex artifacts and noise, such as the sampling is insufficient or low-dose CT. In order to deal with such issues and achieve reconstruction, a full automatic reconstruction (FAR) net is proposed for CT reconstruction via deep learning technique. Different with the usual network in deep learning reconstruction, the proposed neural network is an end-to-end network by which the image is predicted directly from projection data. The main challenge for such a FAR-net is the space complexity of the CT reconstruction in full-connected (FC) network. For a CT image with the size N &#x00D7; N, a typical requirement of memory space for the image reconstruction is O(N<sup>4</sup>), for which is unacceptable by conventional calculation device, e.g. GPU workstation. In this paper, we utilize a series of smaller fully connected layers (FCL) to replace the huge Radon transform matrix based on the sparse nonnegative matrix factorization (SNMF) theory. By applying such an approach, the FAR-net is able to reconstruct images with the size 512&#x00D7;512 on only single workstation. The results of numerical experiments show that the projection matrix and the FAR-net is able to reconstruct the CT image from projection data with a superior quality to conventional methods such as optimization based approach. Meanwhile, the factorization for the inverse projection matrix is validated in simulation and real experiments.

Abstract licence: CC BY-NC-ND

References48

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

    All 48 references

    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.