Abstract
Projection Domain Decomposition (PDD) is a dual energy reconstruction method which implements the decomposition process before image reconstruction. The advantage of PDD is that it can alleviate beam hardening artifacts and metal artifacts effectively as energy spectra estimation is considered in PDD. However, noise amplification occurs during the decomposition process, which significantly impacts the accuracy of effective atomic number and electron density. Therefore, effective noise reduction techniques are required in PDD. This study aims to develop a new algorithm capable of minimizing noise while simultaneously preserving edges and fine details. In this study, a denoising algorithm based on low rank and similarity-based regularization (LRSBR) is presented. This algorithm incorporates the low-rank characteristic of tensors into similarity-based regularization (SBR) framework. This method effectively addresses the issue of instability in edge pixels within the SBR algorithm and enhances the structural consistency of dual-energy images. A series of simulation and practical experiments were conducted on a dual-layer dual-energy CT system. Experiments demonstrate that the proposed method outperforms exiting noise removal methods in Peak Signal-to-noise Ratio (PSNR), Root Mean Square Error (RMSE), and Structural Similarity (SSIM). Meanwhile, there has been a notable enhancement in the visual quality of CT images. The proposed algorithm has a significantly improved noise reduction compared to other competing approach in dual-energy CT. Meanwhile, the LRSBR method exhibits outstanding performance in preserving edges and fine structures, making it practical for PDD applications.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.