Abstract

In planar objects computed tomography (CT), restricted to the scanning environment, projections can only be collected from limited angles. Moreover, limited by the emitting power of the x-ray source, only a few photons penetrate the long side of the planar objects, which results in the noise increasing in projections. Planar objects CT reconstruction based on these two conditions is mathematically corresponding to solving an ill-posed inverse problem. Although several iterative reconstruction algorithms of limited-angle CT were proposed, high-quality planar objects CT reconstruction algorithms with fast convergence are still the goals of many researchers. In order to address the aforementioned problems, we proposed a new optimization model for planar objects CT reconstruction. Inspired by the theory of ‘visible boundary and invisible boundary’ in limited-angle CT and the differentiation property of Fourier transform, a new optimization objective function is proposed in this paper. Based on the statistical noise model of existing CT system, the convex set constraint of the optimization model is given. Besides, the optimization model is solved by convex set projection and Fourier transform differentiation property. The proposed algorithm was evaluated with both simulated data and real data. The experimental results show that the proposed algorithm can achieve the effect of noise suppression, limited-angle artifacts reduction, and fast structure reconstruction when it applies to planar objects CT.

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

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.