Accelerating optimization-based computed tomography via sparse matrix approximations
From MaRDI portal
Publication:6286941
arXiv1705.07497MaRDI QIDQ6286941FDOQ6286941
Authors: Richard C. Barnard, Rick Archibald 
Publication date: 21 May 2017
Abstract: Variational formulations of reconstruction in computed tomography have the notable drawback of requiring repeated evaluations of both the forward Radon transform and either its adjoint or an approximate inverse transform which are relatively expensive. We look at two methods for reducing the effect of this resulting computational bottleneck via approximating the transform evaluation with sparse matrix multiplications. The first method is applicable for general iterative optimization algorithms. The second is applicable in error-forgetting algorithms such as split Bregman. We demonstrate these approximations significantly reduce the needed computational time needed for the iterative algorithms needed to solve the reconstruction problem while still providing good reconstructions.
This page was built for publication: Accelerating optimization-based computed tomography via sparse matrix approximations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6286941)
