IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0140579.html
   My bibliography  Save this article

An Efficient Augmented Lagrangian Method for Statistical X-Ray CT Image Reconstruction

Author

Listed:
  • Jiaojiao Li
  • Shanzhou Niu
  • Jing Huang
  • Zhaoying Bian
  • Qianjin Feng
  • Gaohang Yu
  • Zhengrong Liang
  • Wufan Chen
  • Jianhua Ma

Abstract

Statistical iterative reconstruction (SIR) for X-ray computed tomography (CT) under the penalized weighted least-squares criteria can yield significant gains over conventional analytical reconstruction from the noisy measurement. However, due to the nonlinear expression of the objective function, most exiting algorithms related to the SIR unavoidably suffer from heavy computation load and slow convergence rate, especially when an edge-preserving or sparsity-based penalty or regularization is incorporated. In this work, to address abovementioned issues of the general algorithms related to the SIR, we propose an adaptive nonmonotone alternating direction algorithm in the framework of augmented Lagrangian multiplier method, which is termed as “ALM-ANAD”. The algorithm effectively combines an alternating direction technique with an adaptive nonmonotone line search to minimize the augmented Lagrangian function at each iteration. To evaluate the present ALM-ANAD algorithm, both qualitative and quantitative studies were conducted by using digital and physical phantoms. Experimental results show that the present ALM-ANAD algorithm can achieve noticeable gains over the classical nonlinear conjugate gradient algorithm and state-of-the-art split Bregman algorithm in terms of noise reduction, contrast-to-noise ratio, convergence rate, and universal quality index metrics.

Suggested Citation

  • Jiaojiao Li & Shanzhou Niu & Jing Huang & Zhaoying Bian & Qianjin Feng & Gaohang Yu & Zhengrong Liang & Wufan Chen & Jianhua Ma, 2015. "An Efficient Augmented Lagrangian Method for Statistical X-Ray CT Image Reconstruction," PLOS ONE, Public Library of Science, vol. 10(10), pages 1-19, October.
  • Handle: RePEc:plo:pone00:0140579
    DOI: 10.1371/journal.pone.0140579
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0140579
    Download Restriction: no

    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0140579&type=printable
    Download Restriction: no

    File URL: https://libkey.io/10.1371/journal.pone.0140579?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:plo:pone00:0140579. 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: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .

    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.