An Effective and Efficient Approach to 3D Reconstruction and Quantification of Brain Tumor on Magnetic Resonance Images

Three dimensional (3D) reconstruction of the tumor from medical images is an important operation in the medical field as it helps the radiologist in the diagnosis, surgical planning and biological research. Thus in this paper, we propose an effective and efficient approach to 3D reconstruction of brain tumor and estimation of its volume from a set of two dimensional (2D) cross sectional magnetic resonance (MR) images of the brain. In the first step, MR images are preprocessed to improve the quality of the image. Next, abnormal slices are identified based on histogram analysis and tumor on those slices is segmented using modified fuzzy c-means (MFCM) clustering algorithm. Next, the proposed enhanced shape based interpolation technique is applied to estimate the missing slices accurately and efficiently. Then, the surface mesh of the tumor is reconstructed by applying the marching cubes (MC) algorithm on a set of abnormal slices. The large number of triangles generated by the MC algorithm was reduced by our proposed mesh simplification algorithm to accelerate the rendering phase. Finally, rendering was performed by applying Phong lighting and shading model on the reconstructed mesh to add realism to the 3D model of the tumor. The volume of the tumor was also computed to assist the radiologist in estimating the stage of the cancer. All experiments were carried out on MR image datasets of brain tumor patients and satisfactory results were achieved. Thus, our proposed method can be incorporated into the computer aided diagnosis (CAD) system to assist the radiologist in finding the tumor location, volume and 3D information.

[1]  D. Levin,et al.  Optimizing 3D triangulations using discrete curvature analysis , 2001 .

[2]  Roberto Scopigno,et al.  A modified look-up table for implicit disambiguation of Marching Cubes , 1994, The Visual Computer.

[3]  Ichiro Hagiwara,et al.  A Topology Preserved Mesh Simplification Algorithm , 2009, 2009 WRI World Congress on Computer Science and Information Engineering.

[4]  Carolyn A. Bucholtz,et al.  Shape-based interpolation , 1992, IEEE Computer Graphics and Applications.

[5]  M. Carter Computer graphics: Principles and practice , 1997 .

[6]  Michael Garland,et al.  Surface simplification using quadric error metrics , 1997, SIGGRAPH.

[7]  Gunilla Borgefors,et al.  Distance transformations in digital images , 1986, Comput. Vis. Graph. Image Process..

[8]  Bernardino Arcay,et al.  A new method for the initialization of clustering algorithms based on histogram analysis , 2007 .

[9]  Taku Komura,et al.  Topology matching for fully automatic similarity estimation of 3D shapes , 2001, SIGGRAPH.

[10]  Lutz-Peter Nolte,et al.  Anatomical structure modeling from medical images , 2006, Comput. Methods Programs Biomed..

[11]  Greg Turk,et al.  Fast and memory efficient polygonal simplification , 1998 .

[12]  G. Ram Mohana Reddy,et al.  Efficient Fuzzy Clustering Based Approach to Brain Tumor Segmentation on MR Images , 2011 .

[13]  William E. Lorensen,et al.  Marching cubes: A high resolution 3D surface construction algorithm , 1987, SIGGRAPH.

[14]  P. Danielsson Euclidean distance mapping , 1980 .

[15]  J. Udupa,et al.  Shape-based interpolation of multidimensional objects. , 1990, IEEE transactions on medical imaging.

[16]  Tom Lyche,et al.  Mathematical Methods for Curves and Surfaces , 2016, Lecture Notes in Computer Science.