Shin, Dongjoe and Tjahjadi, Tardi. (2008) Local hull-based surface construction of volumetric data from silhouettes. IEEE Transactions on Image Processing, Vol.17 (No.8). pp. 1251-1260. ISSN 1057-7149

Preview

PDF WRAP_Shin_091211-shintjahjaditip2008.pdf - Accepted Version - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader Download (4Mb)

Abstract

The marching cubes (MC) is a general method which can construct a surface of an object from its volumetric data generated using a shape from silhouette method. Although MC is efficient and straightforward to implement, a MC surface may have discontinuity even though the volumetric data is continuous. This is because surface construction is more sensitive to image noise than the construction of volumetric data. To address this problem, we propose a surface construction algorithm which aggregates local surfaces constructed by the 3-D convex hull algorithm. Thus, the proposed method initially classifies local convexities from imperfect MC vertices based on sliced volumetric data. Experimental results show that continuous surfaces are obtained from imperfect silhouette images of both convex and nonconvex objects.

Item Type:	Journal Article
Subjects:	T Technology > TA Engineering (General). Civil engineering (General) T Technology > TK Electrical engineering. Electronics Nuclear engineering
Divisions:	Faculty of Science > Engineering
Library of Congress Subject Headings (LCSH):	Image processing -- Digital techniques, Three-dimensional imaging
Journal or Publication Title:	IEEE Transactions on Image Processing
Publisher:	IEEE
ISSN:	1057-7149
Date:	August 2008
Volume:	Vol.17
Number:	No.8
Number of Pages:	10
Page Range:	pp. 1251-1260
Identification Number:	10.1109/TIP.2008.926149
Status:	Peer Reviewed
Publication Status:	Published
Access rights to Published version:	Restricted or Subscription Access
Funder:	Tardi Tjahjadi Publications
References:	[1] A. Laurentini, “The visual hull concept for silhouette-based image understanding,” IEEE Trans. Pattern Anal. Mach. Intell., vol. 16, no. 2, pp. 150–162, 1994. [2] E. Trucco and A. Verri, Introductory Techniques for 3D Computer Vision, 1st ed., New Jersey: Prentice Hall, 1998. [3] T. H. Hong and M. O. Shneier, “Describing a robot’s workspace using a sequence of views from a moving camera,” IEEE Trans. Pattern Anal. Mach. Intell., vol. 7, no. 6, pp. 721–726, 1985. [4] W. E. Lorensen and H. E. Cline, “Marching cubes: A high resolution 3D surface reconstruction algorithm,” Comput. Graphics, vol. 21, no. 4, pp. 163–169, 1987. [5] B. Mercier and D. Meneveaux, “Shape from silhouette: Image pixels for marching cubes,” in Proc. 13th Int. Conf. Central Europe on Computer Graphics, Visualization and Computer Vision (Journal of WSCG’05), 2005, vol. 13, pp. 112–118. [6] C. Zhou, R. Shu and M. S. Kankanhalli, “Handling small features in isosurface generation using marching cubes,” Comput. Graph., vol. 18, no. 1, pp. 845–848, 1994. [7] K. S. Delibasis, G. K. Matsopoulos, N. A. Mouravliansky and K. S. Nikita, “A novel and efficient impelementation of the marching cubes algorithm,” Comput. Med. Imag. Grap., vol. 25, pp. 343–352, 2001. [8] N. Chen, L. Serra and H. Ng, “Surface extraction: Dividing voxels,” in Proc. 18th Int. Congress and Exhibition Computer Assisted Radiology and Surgery, 2004, vol. 1268, pp. 225–230. [9] R. Szeliski, “Rapid octree construction from image sequence,” Compt. Vis. Graph. Image Process., vol. 58, no. 1, pp. 23–32, 1993. [10] I. R. Khan, M. Okuda and S. Takahashi, “Regular 3D mesh reconstruction based on cylindrical mapping,” in Proc. 2004 IEEE Int. Conf. on Multimedia and Expo(ICME 2004), 2004, pp. 133–136. [11] R. Hartley and A. Zisserman, Multiple View Geometry, 1st ed. Cambridge: Cambridge University Press, 2000. [12] R. Y. Raj Shekhar, E. Fayyad and J. F. Cornhil, “Octree based decimation of marching cubes surfaces,” in Proc. Visualization 1996, 1996, pp. 335–342, 499. [13] L. P. Kobbelt, M. Botsch, U. Schwanecke and H. P. Seidel, “Feature-sensitive surface extraction from volume data,” in Proc. SIGGRAPH 2001, 2001, pp. 57–66. [14] Y. Yemez and F. Schmitt, “3D reconstruction of real objects with high resolution shape and texture,” Image Vision Comput., vol. 22, no, 13, pp. 1137–1153, 2004. [15] F. Aurenhammer, “Voronoi diagram - a survey of a fundamental geometric data structure,” ACM Comput. Surv., vol. 23, no. 3, pp. 345–405,1991. [16] A. Bowyer, “Computing dirichlet tessellations,” Comput. J., vol. 24, no. 2, pp. 162–166, 1981. [17] L. P. Chew, “Constrained delaunay triangulations,” Algorithmica, vol. 4, no. 1, pp. 97–108, 1989. [18] J. Ruppert and R. Seidel, “On the difficulty of triangulating three dimensional nonconvex polyhedra,” Discrete Comput. Geom., vol. 7, no. 3, pp. 227–253, 1992. [19] Y.-J. Yang, J.-H. Y. and J. -G. Sun, “An algorithm for tetrahedral mesh generation based on conforming constrained delaunay tetrahedralization,” Comput. Graph., vol. 29, no. 4, pp. 606–615, 2005. [20] Q. Du and D. Wang, “Boundary recovery for three dimensional conforming delaunay triangulation,” Comput. Method. Appl. M., vol. 193, no. 23 , pp. 2547–2563, 2004. [21] J. O’rourke, Computaional Geometry in C, 2nd ed. Cambridge: Cambridge University Press, 1998. [22] M. Potmesil, “Generating octree models of 3D objects from their silhouettes in a sequnce of images,” Comput. Vis. Graph. Image Process., vol. 40, no. 1, pp. 1–29, 1987. [23] C. H. Chien and J. K. Aggarwal, “Volume / surface otrees for the representation of three dimensional objects,” Comput. Vis. Graph. Image Process., vol. 36, no. 1, pp. 100–113, 1986. [24] N. Ahuja and J. Veenstra, “Generating octrees from object silhouettes in orthographic views,” IEEE Trans. Pattern Anal. Mach. Intell., vol. 11, no. 2, pp. 137–149, 1989. [25] H. Noborio, S. Fukuda and S. Arimoto, “Construction of the octree approximating three dimensional objects by using multiple views,” IEEE Trans. Pattern Anal. Mach. Intell., vol. 10, no. 6, pp. 769–781, 1988. [26] S. K. Srivastava and N. Ahuja, “Octree generation from object silhouettes in perspective views,” Comput. Vis. Graph. Image Process., vol. 49, no. 1, pp. 68–84, 1990. [27] D. Shin and T. Tjahjadi, “Triangular mesh generation of octrees of non-convex 3d objects,” in Proc. 18th Int. Conf. Patt. Recognition (ICPR2006), 2006, vol. 3, pp. 950–953. [28] R. O. Duda, P. E. Hart and D. G. Stork, Pattern Classification, 2nd ed., New York: Wiley-interscience, 2000. [29] C. Barber, D. P. Dobkin, and H. T. Huhdanpaa, ”The Quickhull Algorithm for Convex Hulls,” ACM Trans. Math. Software, vol. 22, no. 4, pp. 469–483, 1996.
URI:	http://wrap.warwick.ac.uk/id/eprint/29636

Data sourced from Thomson Reuters' Web of Knowledge

Request changes to a record

Actions (login required)

View Item