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 marching cube algorithm is currently one of the most popular three-dimensional(3D)reconstruction surface rendering algorithms.It forms cube voxels based on an input image and then uses 15 basic topological configu...The marching cube algorithm is currently one of the most popular three-dimensional(3D)reconstruction surface rendering algorithms.It forms cube voxels based on an input image and then uses 15 basic topological configurations to extract isosurfaces from the voxels.The algorithm processes each cube voxel in a traversal-based manner,but it does not consider the relationship between the isosurfaces in adjacent cubes.Owing to ambiguity,the final reconstructed model may have holes.In this paper,we propose a marching cube algorithm based on edge growth.The algorithm first extracts seed triangles,grows these seed triangles,and then reconstructs the entire 3D model.According to the position of the growth edge,we propose 17 topological configurations with isosurfaces.The reconstruction results showed that the algorithm can reconstruct the 3D model well.When only the main contour of the 3D model is required,the algorithm performs well.In addition,when there are multiple scattered parts in the data,the algorithm can extract only the 3D contours of the parts connected to the seed by setting the region selected based on the seed.展开更多
基金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.
基金the NSFC(61972117)the Natural Science Foundation of Heilongjiang Province of China(ZD2019E007)。
文摘The marching cube algorithm is currently one of the most popular three-dimensional(3D)reconstruction surface rendering algorithms.It forms cube voxels based on an input image and then uses 15 basic topological configurations to extract isosurfaces from the voxels.The algorithm processes each cube voxel in a traversal-based manner,but it does not consider the relationship between the isosurfaces in adjacent cubes.Owing to ambiguity,the final reconstructed model may have holes.In this paper,we propose a marching cube algorithm based on edge growth.The algorithm first extracts seed triangles,grows these seed triangles,and then reconstructs the entire 3D model.According to the position of the growth edge,we propose 17 topological configurations with isosurfaces.The reconstruction results showed that the algorithm can reconstruct the 3D model well.When only the main contour of the 3D model is required,the algorithm performs well.In addition,when there are multiple scattered parts in the data,the algorithm can extract only the 3D contours of the parts connected to the seed by setting the region selected based on the seed.
