IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v11y2023i9p2127-d1137805.html
   My bibliography  Save this article

A Novel Reconstruction of the Sparse-View CBCT Algorithm for Correcting Artifacts and Reducing Noise

Author

Listed:
  • Jie Zhang

    (College of Missile Engineering, Rocket Force University of Engineering, Xi’an 710025, China)

  • Bing He

    (College of Missile Engineering, Rocket Force University of Engineering, Xi’an 710025, China)

  • Zhengwei Yang

    (College of Missile Engineering, Rocket Force University of Engineering, Xi’an 710025, China)

  • Weijie Kang

    (College of Missile Engineering, Rocket Force University of Engineering, Xi’an 710025, China)

Abstract

X-ray tomography is often affected by noise and artifacts during the reconstruction process, such as detector offset, calibration errors, metal artifacts, etc. Conventional algorithms, including FDK and SART, are unable to satisfy the sampling theorem requirements for 3D reconstruction under sparse-view constraints, exacerbating the impact of noise and artifacts. This paper proposes a novel 3D reconstruction algorithm tailored to sparse-view cone-beam computed tomography (CBCT). Drawing upon compressed sensing theory, we incorporate the weighted Schatten p-norm minimization (WSNM) algorithm for 2D image denoising and the adaptive steepest descent projection onto convex sets (ASD-POCS) algorithm, which employs a total variation (TV) regularization term. These inclusions serve to reduce noise and ameliorate artifacts. Our proposed algorithm extends the WSNM approach into three-dimensional space and integrates the ASD-POCS algorithm, enabling 3D reconstruction with digital brain phantoms, clinical medical data, and real projections from our portable CBCT system. The performance of our algorithm surpasses traditional methods when evaluated using root mean square error (RMSE), peak signal-to-noise ratio (PSNR), and structural similarity index measure (SSIM) metrics. Furthermore, our approach demonstrates marked enhancements in artifact reduction and noise suppression.

Suggested Citation

  • Jie Zhang & Bing He & Zhengwei Yang & Weijie Kang, 2023. "A Novel Reconstruction of the Sparse-View CBCT Algorithm for Correcting Artifacts and Reducing Noise," Mathematics, MDPI, vol. 11(9), pages 1-16, May.
  • Handle: RePEc:gam:jmathe:v:11:y:2023:i:9:p:2127-:d:1137805
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/11/9/2127/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/11/9/2127/
    Download Restriction: no
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:11:y:2023:i:9:p:2127-:d:1137805. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.