Abstract

Sparse-view sampling scans reduce the patient's radiation dose by reducing the total exposure duration. CT reconstructions under such scan mode are often accompanied by severe artifacts due to the high ill-posedness of the problem. In this paper, we use a Non-Local means kernel as a regularization constraint to reconstruct image volumes from sparse-angle sampled cone-beam CT scans. To overcome the huge computational cost of the 3D reconstruction, we propose a sequential update scheme relying on ordered subsets in the image domain. It is shown through experiments on simulated and real data and comparisons with other methods that the proposed approach is robust enough to deal with the number of views reduced up to 1/10. When coupled with a CUDA parallel computing technique, the computation speed of the iterative reconstruction is greatly improved.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call