Abstract

Reducing X-ray radiation is beneficial for reducing the risk of cancer in patients. There are two main approaches for achieving this goal namely, one is to reduce the X-ray current, and another is to apply sparse-view protocols to do image scanning and projections. However, these techniques usually lead to degradation of the reconstructed image quality, resulting in excessive noise and severe edge artifacts, which seriously affect the diagnosis result. In order to overcome such limitation, this study proposes and tests an algorithm based on guided kernel filtering. The algorithm combines the characteristics of anisotropic edges between adjacent image voxels, expresses the relevant weights with an exponential function, and adjusts the weights adaptively through local gray gradients to better preserve the image structure while suppressing noise information. Experiments show that the proposed method can effectively suppress noise and preserve the image structure. Comparing with similar algorithms, the proposed algorithm greatly improves the peak signal-to-noise ratio (PSNR), structural similarity (SSIM), and root mean square error (RMSE) of the reconstructed image. The proposed algorithm has the best effect in quantitative analysis, which verifies the effectiveness of the proposed method and good image reconstruction performance. Overall, this study demonstrates that the proposed method can reduce the number of projections required for repeated CT scans and has potential for medical applications in reducing radiation doses.

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.