For tomography reconstruction, the iteration methods based on spare regularization have recently emerged and are proven effective especially in the situation that projection data is insufficient or noisy in low radiation dose. Because iterative tomography reconstruction algorithms have heavy computational demanding especially for clinical data sets and is far from being close to real-time reconstruction. So there is incentive to develop fast algorithms of the optimization problem. We present new accelerating iterative shrinkage algorithms for sparse-based tomography reconstruction, which base on the existing shrinkage algorithms and combine with traditional algebra methods, linear search method and preconditioning techniques to solve large dense linear systems. We give two different weighted matrixes as the preconditioner and get the different convergence speeds. From the experimental results it can be seen that using the sparsity in the transform domain as the regularization term can greatly improve the visual effect of the reconstructed images compared with corresponding algebraic algorithms, and the linear search method can obviously accelerates the converge rate.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.