Abstract

Multienergy computed tomography (MECT) is a promising imaging modality for material decomposition, lesion detection, and other clinical applications. However, there is an urgent need to design efficient and accurate algorithms to solve the inverse problems related to spectral reconstruction and improve image quality, especially under low-dose and incomplete datasets. The key issue for MECT reconstruction is how to efficiently describe the interchannel and intrachannel priors in multichannel images. In this model, in order to correlate the similarities of interchannel images and regularize the multichannel images, the global, local, and nonlocal priors are jointly integrated into the low-dose MECT reconstruction model. First, the subspace decomposition method first employs the global low-rankness to map the original MECT images to the low-dimensional eigenimages. Then, nonlocal self-similarity of the eigenimages is cascaded into the optimization model. Additionally, the L0 quasi-norm on gradient images is incorporated into the proposed method to further enhance the local sparsity of intrachannel images. The alternating direction method is applied to solve the optimization model in an iterative scheme. Simulation, preclinical, and real datasets were applied to validate the effectiveness of the proposed method. From the simulation dataset, the new method was found to reduce the root-mean-square error (RMSE) by 42.31% compared with the latest research fourth-order nonlocal tensor decomposition MECT reconstruction (FONT-SIR) method under 160 projection views. The calculation time of an iteration for the proposed method was 23.07% of the FONT-SIR method. The results of material decomposition in real mouse data further confirmed the accuracy of the proposed method for different materials. We developed a method in which the global, local, and nonlocal priors are jointly used to develop the reconstruction model for low-dose MECT, where the global low-rankness and nonlocal prior are cascaded by subspace decomposition and block-matching, and the L0 sparsity is applied to express the local prior. The results of the experiments demonstrate that the proposed method based on subspace improves computational efficiency and has advantages in noise suppression and structure preservation over competing algorithms.

Full Text
Paper version not known

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.