We consider in this paper the problem of reconstructing 3D Computed Tomography images from limited data. The problem is modeled as a nonnegatively constrained minimization problem of very large size. In order to obtain an acceptable image in short time, we propose a scaled gradient projection method, accelerated by exploiting a suitable scaling matrix and efficient rules for the choice of the step-length. In particular, we select the step-length either by alternating Barzilai-Borwein rules or by exploiting a limited number of back gradients for approximating second-order information. Numerical results on a 3D Shepp-Logan phantom are presented and discussed.
A fast gradient projection method for 3D image reconstruction from limited tomographic data
COLI, Vanna Lisa;
2017
Abstract
We consider in this paper the problem of reconstructing 3D Computed Tomography images from limited data. The problem is modeled as a nonnegatively constrained minimization problem of very large size. In order to obtain an acceptable image in short time, we propose a scaled gradient projection method, accelerated by exploiting a suitable scaling matrix and efficient rules for the choice of the step-length. In particular, we select the step-length either by alternating Barzilai-Borwein rules or by exploiting a limited number of back gradients for approximating second-order information. Numerical results on a 3D Shepp-Logan phantom are presented and discussed.File | Dimensione | Formato | |
---|---|---|---|
piccolomini_ncmip.pdf
accesso aperto
Descrizione: Post print
Tipologia:
Post-print
Licenza:
Creative commons
Dimensione
461.52 kB
Formato
Adobe PDF
|
461.52 kB | Adobe PDF | Visualizza/Apri |
Coli_2017_J._Phys.__Conf._Ser._904_012013.pdf
accesso aperto
Descrizione: Full text editoriale
Tipologia:
Full text (versione editoriale)
Licenza:
Creative commons
Dimensione
712.92 kB
Formato
Adobe PDF
|
712.92 kB | Adobe PDF | Visualizza/Apri |
I documenti in SFERA sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.