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.展开更多
Medical images 3D reconstruction is an important part in medical image analysis and processing. Although lots of algorithms have been proposed continuously, speed and accuracy cannot conform to actual needs, which has...Medical images 3D reconstruction is an important part in medical image analysis and processing. Although lots of algorithms have been proposed continuously, speed and accuracy cannot conform to actual needs, which has always been the focus topic. In this paper, we propose an Improved Marching Cubes algorithm ( I-MC) based on the surface rendering theory, which implements 3D reconstruction of the vertebrae. Firstly, we preprocessed the original 2D vertebrae CT images with the bilateral-filter denoising algorithm. Secondly, on the basis of the traditional Marching Cubes algorithm, the seed voxels were extracted and the Region Growing algorithm was used to determine all voxels that contain isosurfaces. Then, the Golden Section instead of the traditional linear interpolation was used to calculate the equivalent point, and this method reduced the calculations of public edges. VTK and OpenGL implemented 3D reconstruction of the vertebrae on GPU quickly and accurately. The experimental results show that when compared with the traditional Marching Cubes algorithm and Mesh Simplification Marching Cubes algorithm, the improved algorithm achieves a significant improvement of reconstruction speed while preserving the accurate results. The efficiency of algorithm is improved dramatically. This method is real-time and achieves the goal of efficient 3D reconstruction of vertebrae CT images.展开更多
The traditional computed tomography(CT)reconstruction methods are noisy,low resolution,poor contrast,and generally not suitable to detect the smaller flaws.Besides,the filter design is also difficult.The CT characteri...The traditional computed tomography(CT)reconstruction methods are noisy,low resolution,poor contrast,and generally not suitable to detect the smaller flaws.Besides,the filter design is also difficult.The CT characteristics reconstruction technology was brought forward to improve in these aspects,which is defined to directly reconstruct the characteristics of the projection for the best requirements not the overall image quality.The two-dimension(2D)and three-dimension(3D)CT characteristics reconstruction algorithm were firstly introduced,then by detailed analysis,experimental results and comparsion of parameters calculated,its advantages in keeping better high-frequency feature,better noise immunity,short time-consuming and easier design are verified.展开更多
It is an active research area to reconstruct 3-D object and display its visible surfacesfrom cross-sectional images. In this paper, the methods of reconstructing 3-D object from medicalCT images and displaying the vis...It is an active research area to reconstruct 3-D object and display its visible surfacesfrom cross-sectional images. In this paper, the methods of reconstructing 3-D object from medicalCT images and displaying the visible surfaces are discussed. A polygon approximation methodthat forms polygon with the same number of segment points and a fast interpolation method forcross-sectional contours are presented at first. Then the voxel set of a human liver is reconstructed.And then the liver voxel set is displayed using depth and gradient shading methods. The softwareis written in C programming language at a microcomputer image processing system with a PC/ATcomputer as the host and a PC-VISION board as the image processing unit. The result of theprocessing is satisfying.展开更多
基金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.
基金Sponsored by the Science and Technology Research Projects of Education Department of Heilongjiang Province(Grant No.12531119)
文摘Medical images 3D reconstruction is an important part in medical image analysis and processing. Although lots of algorithms have been proposed continuously, speed and accuracy cannot conform to actual needs, which has always been the focus topic. In this paper, we propose an Improved Marching Cubes algorithm ( I-MC) based on the surface rendering theory, which implements 3D reconstruction of the vertebrae. Firstly, we preprocessed the original 2D vertebrae CT images with the bilateral-filter denoising algorithm. Secondly, on the basis of the traditional Marching Cubes algorithm, the seed voxels were extracted and the Region Growing algorithm was used to determine all voxels that contain isosurfaces. Then, the Golden Section instead of the traditional linear interpolation was used to calculate the equivalent point, and this method reduced the calculations of public edges. VTK and OpenGL implemented 3D reconstruction of the vertebrae on GPU quickly and accurately. The experimental results show that when compared with the traditional Marching Cubes algorithm and Mesh Simplification Marching Cubes algorithm, the improved algorithm achieves a significant improvement of reconstruction speed while preserving the accurate results. The efficiency of algorithm is improved dramatically. This method is real-time and achieves the goal of efficient 3D reconstruction of vertebrae CT images.
基金National Natural Science Foundation of China(No.61471325)
文摘The traditional computed tomography(CT)reconstruction methods are noisy,low resolution,poor contrast,and generally not suitable to detect the smaller flaws.Besides,the filter design is also difficult.The CT characteristics reconstruction technology was brought forward to improve in these aspects,which is defined to directly reconstruct the characteristics of the projection for the best requirements not the overall image quality.The two-dimension(2D)and three-dimension(3D)CT characteristics reconstruction algorithm were firstly introduced,then by detailed analysis,experimental results and comparsion of parameters calculated,its advantages in keeping better high-frequency feature,better noise immunity,short time-consuming and easier design are verified.
文摘It is an active research area to reconstruct 3-D object and display its visible surfacesfrom cross-sectional images. In this paper, the methods of reconstructing 3-D object from medicalCT images and displaying the visible surfaces are discussed. A polygon approximation methodthat forms polygon with the same number of segment points and a fast interpolation method forcross-sectional contours are presented at first. Then the voxel set of a human liver is reconstructed.And then the liver voxel set is displayed using depth and gradient shading methods. The softwareis written in C programming language at a microcomputer image processing system with a PC/ATcomputer as the host and a PC-VISION board as the image processing unit. The result of theprocessing is satisfying.
