The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.01 - January/February (2008 vol.14)
pp: 160-172
ABSTRACT
In this paper we describe a novel 3-D subdivision strategy to extract the surface of binary image data. This iterative approach generates a series of surface meshes that capture different levels of detail of the underlying structure. At the highest level of detail, the resulting surface mesh generated by our approach uses only about 10% of the triangles in comparison to the marching cube algorithm (MC) even in settings were almost no image noise is present. Our approach also eliminates the so-called 'staircase effect' which voxel based algorithms like the MC are likely to show, particularly if non-uniformly sampled images are processed. Finally, we show how the presented algorithm can be parallelized by subdividing 3-D image space into rectilinear blocks of subimages. As the algorithm scales very well with an increasing number of processors in a multi-threaded setting, this approach is suited to process large image data sets of several gigabytes. Although the presented work is still computationally more expensive than simple voxel based algorithms, it produces fewer surface triangles while capturing the same level of detail, is more robust towards image noise and eliminates the above mentioned 'stair-case' effect in anisotropic settings. These properties make it particularly useful for biomedical applications, where these conditions are often encountered.
INDEX TERMS
isosurface extraction, adaptive mesh generation, Delaunay triangulation, parallel computing
CITATION
YingLiang Ma, Kurt Saetzler, "A Parallelized Surface Extraction Algorithm for Large Binary Image Data Sets Based on an Adaptive 3-D Delaunay Subdivision Strategy", IEEE Transactions on Visualization & Computer Graphics, vol.14, no. 1, pp. 160-172, January/February 2008, doi:10.1109/TVCG.2007.1057
REFERENCES
[1] W.E. Lorensen and H.E. Cline, “Marching Cubes: A High Resolution 3D Surface Construction Algorithm,” Proc. ACM SIGGRAPH '87, pp. 163-169, 1987.
[2] G.M. Nielson and B. Hamann, “The Asymptotic Decider: Resolving the Ambiguity in Marching Cubes,” Proc. Second IEEE Conf. Visualization (VIS '91), pp. 83-91, 1991.
[3] S.L. Chan and E.O. Purisma, “A New Tetrahedral Tesselation Scheme for Isosurface Generation,” Computing and Graphics, vol. 22, pp. 83-90, 1998.
[4] J.C. Anderson, J.C. Bennett, and K.I. Joy, “Marching Diamonds for Unstructured Meshes,” Proc. 16th IEEE Conf. Visualization (VIS'05), pp. 423-429, 2005.
[5] J. Schreiner and C. Scheidegger, “High-Quality Extraction of Isosurfaces from Regular and Irregular Grids,” IEEE Trans. Visualization and Computer Graphics, vol. 12, pp. 1205-1212, 2006.
[6] G.M. Treece, R.W. Prager, and A.H. Gee, “Regularised Marching Tetrahedra Improved Iso-Surface Extraction,” Computers and Graphics, vol. 23, pp. 583-598, 1999.
[7] G.M. Nielson, “On Marching Cubes,” IEEE Trans. Visualization and Computer Graphics, vol. 9, pp. 283-297, 2003.
[8] A. Lopes and K. Brodlie, “Improving the Robustness and Accuracy of the Marching Cubes Algorithm for Isosurfacing,” IEEE Trans. Visualization and Computer Graphics, vol. 9, pp. 16-29, 2002.
[9] L. Kobbelt, M. Botsch, U. Schwanecke, and H. Seidel, “Feature Sensitive Surface Extraction from Volume Data,” Proc. ACM SIGGRAPH '01, pp. 57-66, 2001.
[10] S.F.F. Gibson, “Constrained Elastic Surface Nets: Generating Smooth Surfaces from Binary Segmented Data,” Lecture Notes in Computer Science, vol. 1496, pp. 888-898, 1998.
[11] G.M. Nielson, “Dual Marching Cubes,” Proc. 15th IEEE Conf. Visualization (VIS '04), 2004.
[12] T. Ju, F. Losasso, S. Schaefer, and J. Warren, “Dual Contouring of Hermite Data,” Proc. ACM SIGGRAPH '02, pp. 339-346, 2002.
[13] R. Shu, C. Zhou, and M.S. Kankanhalli, “Adaptive Marching Cubes,” The Visual Computer, vol. 11, pp. 202-217, 1995.
[14] R. Shekhar, E. Fayyad, R. Yagel, and J.F. Cornhill, “Octree-Based Decimation of Marching Cubes Surfaces,” Proc. Seventh IEEE Conf. Visualization (VIS '96), pp. 335-342, 1996.
[15] W.J. Schroeder, B. Geveci, and M. Malaterre, “Compatible Triangulations of Spatial Decompositions,” Proc. 15th IEEE Conf. Visualization (VIS '04), 2004.
[16] T. Poston, H.T. Nguyen, P. Heng, and T. Wong, ““Skeleton Climbing”: Fast Isosurfaces with Fewer Triangles,” Proc. Fifth Pacific Conf. Computer Graphics and Applications (PG '97), p. 117, 1997.
[17] T. Poston, T. Wong, and P. Heng, “Multiresolution Isosurface Extraction with Adaptive Skeleton Climbing,” Computer Graphics Forum, vol. 17, pp. 137-148, 1998.
[18] R. Eils and K. Sätzler, “Shape Reconstruction from Volumetric Data,” Handbook of Computer Vision and Applications, first ed., B. Jähne, H. Haußecker, and P. Geißler, eds., vol.2, pp. 791-815, Academic Press, 1999.
[19] R. Eils, E. Bertin, K. Saracoglu, B. Rinke, F. Parazza, E. Schröck, Y. Usson, M. Robert-Nicoud, J.M. Chassery, E.H.K. Stelzer, T. Cremer, and C. Cremer, “Application of Laser Confocal Microscopy and 3D-Voronoi Diagrams for Volume and Surface Estimates of Interphase Chromosomes,” J. Microscopy, vol. 177, pp. 150-161, 1995.
[20] Z. Yaniv and K. Cleary, “Image-Guided Procedures: A Review,” technical report, Imaging Science and Information Systems, Georgetown Univ., 2006.
[21] D.P. Luebke, “A Developer's Survey of Polygonal Simplification Algorithms,” IEEE Computer Graphics Application, vol. 21, no. 3, pp.24-35, May/June 2001.
[22] CGAL Web site, http:/www.cgal.org, 1997.
[23] D.A. Berry, Statistics: A Bayesian Perspective. Duxburry Press, 1996.
[24] W. Denk and H. Horstmann, “Serial Block-Face Scanning Electron Microscopy to Reconstruct Three-Dimensional Tissue Nanostructure,” PLoS Biology, vol. 2, p. e329, 2004.
[25] VTK Web site, http:/www.vtk.org, 1993.
[26] ImageJ Web site, http://rsb.info.nih.govij/, 1997.
[27] J. Boissonnat, O. Devillers, S. Pion, M. Teillaud, and M. Yvinec, “Triangulations in CGAL,” Computational Geometry, vol. 22, pp. 5-19, 2002.
[28] S. Bischoff and L. Kobbelt, “Isosurface Reconstruction with Topology Control,” Proc. 10th Pacific Conf. Computer Graphics and Applications (PG '02), pp. 246-255, 2002.
[29] S. Bischoff and L. Kobbelt, “Topologically Correct Extraction of the Cortical Surface of a Brain Using Level-Set Methods,” RWTH Aachen, 2004.
[30] http://www.cse.cuhk.edu.hk/~ttwong/papers/ ascasc.html, 1998.
[31] M. Garland and P.S. Heckbert, “Surface Simplification Using Quadric Error Metrics,” Proc. ACM SIGGRAPH '97, pp. 209-216, 1997.
[32] J.D. Boissonnat, “Shape Reconstruction Form Planar Cross-Sections,” Computer Vision, Graphics, and Image Processing, vol. 44, pp. 1-29, 1988.
[33] J.D. Boissonnat and B. Geiger, Three–Dimensional Reconstruction of Complex Shapes Based on the Delaunay Triangulation, INRIA Research Reports 1697, May 1992.
[34] http://www.cb.uu.se/~tc18/code_data_set3D_images.html , 2006.
19 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool