As a complement to X-ray computed tomography(CT),neutron tomography has been extensively used in nuclear engineer-ing,materials science,cultural heritage,and industrial applications.Reconstruction of the attenuation m...As a complement to X-ray computed tomography(CT),neutron tomography has been extensively used in nuclear engineer-ing,materials science,cultural heritage,and industrial applications.Reconstruction of the attenuation matrix for neutron tomography with a traditional analytical algorithm requires hundreds of projection views in the range of 0°to 180°and typically takes several hours to complete.Such a low time-resolved resolution degrades the quality of neutron imaging.Decreasing the number of projection acquisitions is an important approach to improve the time resolution of images;however,this requires efficient reconstruction algorithms.Therefore,sparse-view reconstruction algorithms in neutron tomography need to be investigated.In this study,we investigated the three-dimensional reconstruction algorithm for sparse-view neu-tron CT scans.To enhance the reconstructed image quality of neutron CT,we propose an algorithm that uses OS-SART to reconstruct images and a split Bregman to solve for the total variation(SBTV).A comparative analysis of the performances of each reconstruction algorithm was performed using simulated and actual experimental data.According to the analyzed results,OS-SART-SBTV is superior to the other algorithms in terms of denoising,suppressing artifacts,and preserving detailed structural information of images.展开更多
The most critical part of a neutron computed tomography(NCT) system is the image processing algorithm,which directly affects the quality and speed of the reconstructed images.Various types of noise in the system can d...The most critical part of a neutron computed tomography(NCT) system is the image processing algorithm,which directly affects the quality and speed of the reconstructed images.Various types of noise in the system can degrade the quality of the reconstructed images.Therefore,to improve the quality of the reconstructed images of NCT systems,efficient image processing algorithms must be used.The anisotropic diffusion filtering(ADF) algorithm can not only effectively suppress the noise in the projection data,but also preserve the image edge structure information by reducing the diffusion at the image edges.Therefore,we propose the application of the ADF algorithm for NCT image reconstruction.To compare the performance of different algorithms in NCT systems,we reconstructed images using the ordered subset simultaneous algebraic reconstruction technique(OS-SART) algorithm with different regular terms as image processing algorithms.In the iterative reconstruction,we selected two image processing algorithms,the Total Variation and split Bregman solved total variation algorithms,for comparison with the performance of the ADF algorithm.Additionally,the filtered back-projection algorithm was used for comparison with an iterative algorithm.By reconstructing the projection data of the numerical and clock models,we compared and analyzed the effects of each algorithm applied in the NCT system.Based on the reconstruction results,OS-SART-ADF outperformed the other algorithms in terms of denoising,preserving the edge structure,and suppressing artifacts.For example,when the 3D Shepp–Logan was reconstructed at 25 views,the root mean square error of OS-SART-ADF was the smallest among the four iterative algorithms,at only 0.0292.The universal quality index,mean structural similarity,and correlation coefficient of the reconstructed image were the largest among all algorithms,with values of 0.9877,0.9878,and 0.9887,respectively.展开更多
Neutron computed tomography(NCT)is widely used as a noninvasive measurement technique in nuclear engineering,thermal hydraulics,and cultural heritage.The neutron source intensity of NCT is usually low and the scan tim...Neutron computed tomography(NCT)is widely used as a noninvasive measurement technique in nuclear engineering,thermal hydraulics,and cultural heritage.The neutron source intensity of NCT is usually low and the scan time is long,resulting in a projection image containing severe noise.To reduce the scanning time and increase the image reconstruction quality,an effective reconstruction algorithm must be selected.In CT image reconstruction,the reconstruction algorithms can be divided into three categories:analytical algorithms,iterative algorithms,and deep learning.Because the analytical algorithm requires complete projection data,it is not suitable for reconstruction in harsh environments,such as strong radia-tion,high temperature,and high pressure.Deep learning requires large amounts of data and complex models,which cannot be easily deployed,as well as has a high computational complexity and poor interpretability.Therefore,this paper proposes the OS-SART-PDTV iterative algorithm,which uses the ordered subset simultaneous algebraic reconstruction technique(OS-SART)algorithm to reconstruct the image and the first-order primal–dual algorithm to solve the total variation(PDTV),for sparse-view NCT three-dimensional reconstruction.The novel algorithm was compared with other algorithms(FBP,OS-SART-TV,OS-SART-AwTV,and OS-SART-FGPTV)by simulating the experimental data and actual neutron projection experiments.The reconstruction results demonstrate that the proposed algorithm outperforms the FBP,OS-SART-TV,OS-SART-AwTV,and OS-SART-FGPTV algorithms in terms of preserving edge structure,denoising,and suppressing artifacts.展开更多
Inspired by total variation(TV), this paper represents a new iterative algorithm based on diagonal total variation(DTV) to address the computed tomography image reconstruction problem. To improve the quality of a reco...Inspired by total variation(TV), this paper represents a new iterative algorithm based on diagonal total variation(DTV) to address the computed tomography image reconstruction problem. To improve the quality of a reconstructed image, we used DTV to sparsely represent images when iterative convergence of the reconstructed algorithm with TV-constraint had no effect during the reconstruction process. To investigate our proposed algorithm, the numerical and experimental studies were performed, and rootmean-square error(RMSE) and structure similarity(SSIM)were used to evaluate the reconstructed image quality. The results demonstrated that the proposed method could effectively reduce noise, suppress artifacts, and reconstruct highquality image from incomplete projection data.展开更多
CT(computed tomography)系统实际应用当中,经常会出现扫描数据不满足数据完备性条件的情况.针对不完全角度重建问题的研究,是目前迭代型算法研究中的一个热点.一系列基于带有约束的总变分最小化的重建算法近年来在不完全角度重建中取...CT(computed tomography)系统实际应用当中,经常会出现扫描数据不满足数据完备性条件的情况.针对不完全角度重建问题的研究,是目前迭代型算法研究中的一个热点.一系列基于带有约束的总变分最小化的重建算法近年来在不完全角度重建中取得了较好的效果,这其中基于交替方向法(alternating direction method,ADM)的重建算法表现出更好的性能.然而,ADM方法在求解过程中对矩阵求逆的处理效率不高,导致极大的计算开销.本文针对该问题,使用非精确ADM方法,利用线性近似的方式替换掉计算开销较大的项,使得矩阵求逆问题可以通过快速傅里叶变换加速实现.实验结果表明,本文提出的非精确交替方向总变分最小化重建算法与精确ADM重建算法相比,没有明显的精度损失,计算时间缩减30%左右.展开更多
目的稀疏角度CT具有加速数据采集和减少辐射剂量的优点。然而,由于采集信息的减少,使用传统滤波反投影算法(FBP)进行重建得到的图像中伴有严重的条形伪影和噪声。针对这一问题,本文提出基于多尺度小波残差网络(MWResNet)对稀疏角度CT图...目的稀疏角度CT具有加速数据采集和减少辐射剂量的优点。然而,由于采集信息的减少,使用传统滤波反投影算法(FBP)进行重建得到的图像中伴有严重的条形伪影和噪声。针对这一问题,本文提出基于多尺度小波残差网络(MWResNet)对稀疏角度CT图像进行恢复。方法本网络中将小波网络与残差块相结合,用以增强网络对图像特征的提取能力和加快网络训练效率。实验中使用真实的螺旋几何CT图像数据"Low-dose CT Grand Challenge"数据集训练网络。通过观察图像表征和计算定量参数的方法对结果进行评估,并与其他现有网络进行比较,包括图像恢复迭代残差卷积网络(IRLNet),残差编码解码卷积神经网络(REDCNN)和FBP卷积神经网络(FBPConvNet)。结果实验结果表明,本文提出的多尺度小波残差网络优于其余对比方法。结论本文提出的MWResNet网络能够在保持稀疏角度CT图像边缘细节信息的同时有效抑制噪声和伪影。展开更多
基金supported by the National Key Research and Development Program of China(No.2022YFB1902700)the National Natural Science Foundation of China(No.11875129)+3 种基金the Fund of the State Key Laboratory of Intense Pulsed Radiation Simulation and Effect(No.SKLIPR1810)the Fund of Innovation Center of Radiation Application(No.KFZC2020020402)the Fund of the State Key Laboratory of Nuclear Physics and Technology,Peking University(No.NPT2020KFY08)the Joint Innovation Fund of China National Uranium Co.,Ltd.,State Key Laboratory of Nuclear Resources and Environment,East China University of Technology(No.2022NRE-LH-02).
文摘As a complement to X-ray computed tomography(CT),neutron tomography has been extensively used in nuclear engineer-ing,materials science,cultural heritage,and industrial applications.Reconstruction of the attenuation matrix for neutron tomography with a traditional analytical algorithm requires hundreds of projection views in the range of 0°to 180°and typically takes several hours to complete.Such a low time-resolved resolution degrades the quality of neutron imaging.Decreasing the number of projection acquisitions is an important approach to improve the time resolution of images;however,this requires efficient reconstruction algorithms.Therefore,sparse-view reconstruction algorithms in neutron tomography need to be investigated.In this study,we investigated the three-dimensional reconstruction algorithm for sparse-view neu-tron CT scans.To enhance the reconstructed image quality of neutron CT,we propose an algorithm that uses OS-SART to reconstruct images and a split Bregman to solve for the total variation(SBTV).A comparative analysis of the performances of each reconstruction algorithm was performed using simulated and actual experimental data.According to the analyzed results,OS-SART-SBTV is superior to the other algorithms in terms of denoising,suppressing artifacts,and preserving detailed structural information of images.
基金supported by the National Key Research and Development Program of China (No. 2022YFB1902700)the National Natural Science Foundation of China (No. 11875129)+3 种基金the Fund of the State Key Laboratory of Intense Pulsed Radiation Simulation and Effect (No. SKLIPR1810)Fund of Innovation Center of Radiation Application (No. KFZC2020020402)Fund of the State Key Laboratory of Nuclear Physics and Technology,Peking University (No. NPT2020KFY08)the Joint Innovation Fund of China National Uranium Co.,Ltd.,State Key Laboratory of Nuclear Resources and Environment,East China University of Technology (No. 2022NRE-LH-02)。
文摘The most critical part of a neutron computed tomography(NCT) system is the image processing algorithm,which directly affects the quality and speed of the reconstructed images.Various types of noise in the system can degrade the quality of the reconstructed images.Therefore,to improve the quality of the reconstructed images of NCT systems,efficient image processing algorithms must be used.The anisotropic diffusion filtering(ADF) algorithm can not only effectively suppress the noise in the projection data,but also preserve the image edge structure information by reducing the diffusion at the image edges.Therefore,we propose the application of the ADF algorithm for NCT image reconstruction.To compare the performance of different algorithms in NCT systems,we reconstructed images using the ordered subset simultaneous algebraic reconstruction technique(OS-SART) algorithm with different regular terms as image processing algorithms.In the iterative reconstruction,we selected two image processing algorithms,the Total Variation and split Bregman solved total variation algorithms,for comparison with the performance of the ADF algorithm.Additionally,the filtered back-projection algorithm was used for comparison with an iterative algorithm.By reconstructing the projection data of the numerical and clock models,we compared and analyzed the effects of each algorithm applied in the NCT system.Based on the reconstruction results,OS-SART-ADF outperformed the other algorithms in terms of denoising,preserving the edge structure,and suppressing artifacts.For example,when the 3D Shepp–Logan was reconstructed at 25 views,the root mean square error of OS-SART-ADF was the smallest among the four iterative algorithms,at only 0.0292.The universal quality index,mean structural similarity,and correlation coefficient of the reconstructed image were the largest among all algorithms,with values of 0.9877,0.9878,and 0.9887,respectively.
基金supported by the National Key Research and Development Program of China(No.2022YFB1902700)the Joint Fund of Ministry of Education for Equipment Pre-research(No.8091B042203)+5 种基金the National Natural Science Foundation of China(No.11875129)the Fund of the State Key Laboratory of Intense Pulsed Radiation Simulation and Effect(No.SKLIPR1810)the Fund of Innovation Center of Radiation Application(No.KFZC2020020402)the Fund of the State Key Laboratory of Nuclear Physics and Technology,Peking University(No.NPT2023KFY06)the Joint Innovation Fund of China National Uranium Co.,Ltd.,State Key Laboratory of Nuclear Resources and Environment,East China University of Technology(No.2022NRE-LH-02)the Fundamental Research Funds for the Central Universities(No.2023JG001).
文摘Neutron computed tomography(NCT)is widely used as a noninvasive measurement technique in nuclear engineering,thermal hydraulics,and cultural heritage.The neutron source intensity of NCT is usually low and the scan time is long,resulting in a projection image containing severe noise.To reduce the scanning time and increase the image reconstruction quality,an effective reconstruction algorithm must be selected.In CT image reconstruction,the reconstruction algorithms can be divided into three categories:analytical algorithms,iterative algorithms,and deep learning.Because the analytical algorithm requires complete projection data,it is not suitable for reconstruction in harsh environments,such as strong radia-tion,high temperature,and high pressure.Deep learning requires large amounts of data and complex models,which cannot be easily deployed,as well as has a high computational complexity and poor interpretability.Therefore,this paper proposes the OS-SART-PDTV iterative algorithm,which uses the ordered subset simultaneous algebraic reconstruction technique(OS-SART)algorithm to reconstruct the image and the first-order primal–dual algorithm to solve the total variation(PDTV),for sparse-view NCT three-dimensional reconstruction.The novel algorithm was compared with other algorithms(FBP,OS-SART-TV,OS-SART-AwTV,and OS-SART-FGPTV)by simulating the experimental data and actual neutron projection experiments.The reconstruction results demonstrate that the proposed algorithm outperforms the FBP,OS-SART-TV,OS-SART-AwTV,and OS-SART-FGPTV algorithms in terms of preserving edge structure,denoising,and suppressing artifacts.
基金supported in part by the National Natural Science Foundation of China(No.61401049)the Chongqing Foundation and Frontier Research Project(Nos.cstc2016jcyjA0473,cstc2013jcyjA0763)+3 种基金the Graduate Scientific Research and Innovation Foundation of Chongqing,China(No.CYB16044)the Strategic Industry Key Generic Technology Innovation Project of Chongqing(No.cstc2015zdcy-ztzxX0002)China Scholarship Councilthe Fundamental Research Funds for the Central Universities Nos.CDJZR14125501,106112016CDJXY120003,10611CDJXZ238826
文摘Inspired by total variation(TV), this paper represents a new iterative algorithm based on diagonal total variation(DTV) to address the computed tomography image reconstruction problem. To improve the quality of a reconstructed image, we used DTV to sparsely represent images when iterative convergence of the reconstructed algorithm with TV-constraint had no effect during the reconstruction process. To investigate our proposed algorithm, the numerical and experimental studies were performed, and rootmean-square error(RMSE) and structure similarity(SSIM)were used to evaluate the reconstructed image quality. The results demonstrated that the proposed method could effectively reduce noise, suppress artifacts, and reconstruct highquality image from incomplete projection data.
文摘CT(computed tomography)系统实际应用当中,经常会出现扫描数据不满足数据完备性条件的情况.针对不完全角度重建问题的研究,是目前迭代型算法研究中的一个热点.一系列基于带有约束的总变分最小化的重建算法近年来在不完全角度重建中取得了较好的效果,这其中基于交替方向法(alternating direction method,ADM)的重建算法表现出更好的性能.然而,ADM方法在求解过程中对矩阵求逆的处理效率不高,导致极大的计算开销.本文针对该问题,使用非精确ADM方法,利用线性近似的方式替换掉计算开销较大的项,使得矩阵求逆问题可以通过快速傅里叶变换加速实现.实验结果表明,本文提出的非精确交替方向总变分最小化重建算法与精确ADM重建算法相比,没有明显的精度损失,计算时间缩减30%左右.
文摘目的稀疏角度CT具有加速数据采集和减少辐射剂量的优点。然而,由于采集信息的减少,使用传统滤波反投影算法(FBP)进行重建得到的图像中伴有严重的条形伪影和噪声。针对这一问题,本文提出基于多尺度小波残差网络(MWResNet)对稀疏角度CT图像进行恢复。方法本网络中将小波网络与残差块相结合,用以增强网络对图像特征的提取能力和加快网络训练效率。实验中使用真实的螺旋几何CT图像数据"Low-dose CT Grand Challenge"数据集训练网络。通过观察图像表征和计算定量参数的方法对结果进行评估,并与其他现有网络进行比较,包括图像恢复迭代残差卷积网络(IRLNet),残差编码解码卷积神经网络(REDCNN)和FBP卷积神经网络(FBPConvNet)。结果实验结果表明,本文提出的多尺度小波残差网络优于其余对比方法。结论本文提出的MWResNet网络能够在保持稀疏角度CT图像边缘细节信息的同时有效抑制噪声和伪影。
