Surface Area Estimation in Practice

Consider a complex, convoluted three dimensional object that has been digitized and is available as a set of voxels. We describe a fast, practical scheme for delineating a region of interest on the surface of the object and estimating its original area. The voxel representation is maintained and no triangulation is carried out. The methods presented rely on a theoretical result of Mullikin and Verbeek, and bridge the gap between their idealized setting and the harsh reality of 3D medical data. Performance evaluation results are provided, and operation on segmented white matter MR brain data is demonstrated.

[1]  Piet W. Verbeek,et al.  Surface area estimation of digitized planes , 1993 .

[2]  Robert T. Schultz,et al.  Segmentation and Measurement of the Cortex from 3D MR Images , 1998, MICCAI.

[3]  Ken Knowlton,et al.  Computer-produced grey scales , 1972, Comput. Graph. Image Process..

[4]  Reinhard Klette,et al.  A Global Surface Area Estimation Algorithm for Digital Regular Solids , 2000 .

[5]  William E. Lorensen,et al.  Marching cubes: a high resolution 3D surface construction algorithm , 1996 .

[6]  Reinhard Klette,et al.  Surface area estimation for digitized regular solids , 2000, SPIE Optics + Photonics.

[7]  Reinhard Klette,et al.  Multigrid Convergence of Surface Approximations , 1998 .

[8]  Joakim Lindblad,et al.  Surface Area Estimation of Digitized 3D Objects Using Local Computations , 2002, DGCI.

[9]  Gabor T. Herman,et al.  The theory, design, implementation and evaluation of a three-dimensional surface detection algorit , 1981 .

[10]  Arnold W. M. Smeulders,et al.  Length estimators for digitized contours , 1987, Comput. Vis. Graph. Image Process..

[11]  Gabriele Lohmann,et al.  Volumetric image analysis , 1998 .

[12]  Alfred M. Bruckstein,et al.  Design of Perimeter Estimators for Digitized Planar Shapes , 1989, IEEE Trans. Pattern Anal. Mach. Intell..

[13]  Gábor Székely,et al.  Estimating shortest paths and minimal distances on digitized three-dimensional surfaces , 1993, Pattern Recognit..

[14]  J A Sethian,et al.  Computing geodesic paths on manifolds. , 1998, Proceedings of the National Academy of Sciences of the United States of America.

[15]  E LorensenWilliam,et al.  Marching cubes: A high resolution 3D surface construction algorithm , 1987 .