Local hull-based surface construction of volumetric data from silhouettes

IEEE Transactions on Image Processing

Volumn 17, Issue 8, 2008, Pages 1251-1260

  Shin, Dongjoe ^a   Tjahjadi, Tardi ^a  

^a UNIVERSITY OF WARWICK   (United Kingdom)

Author keywords

Delaunay triangulation; Marching cubes (MC); Shape from silhouette (SfS); Surface extraction

Indexed keywords

GAIT ANALYSIS; GEODESY; SEMICONDUCTOR COUNTERS; THREE DIMENSIONAL; TREES (MATHEMATICS); TRIANGULATION; VOLUMETRIC ANALYSIS;

CONTINUOUS SURFACES; CONVEX HULL ALGORITHMS; DELAUNAY TRIANGULATION; GENERAL METHODS; IMAGE NOISES; LOCAL SURFACES; MARCHING CUBES (MC); NONCONVEX; SHAPE FROM SILHOUETTE (SFS); SILHOUETTE IMAGES; SURFACE CONSTRUCTIONS; SURFACE EXTRACTION; VOLUMETRIC DATUMS;

AGGLOMERATION;

ALGORITHM; ARTICLE; ARTIFICIAL INTELLIGENCE; AUTOMATED PATTERN RECOGNITION; COMPUTER ASSISTED DIAGNOSIS; IMAGE ENHANCEMENT; METHODOLOGY; REPRODUCIBILITY; SENSITIVITY AND SPECIFICITY; THREE DIMENSIONAL IMAGING;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; IMAGE ENHANCEMENT; IMAGE INTERPRETATION, COMPUTER-ASSISTED; IMAGING, THREE-DIMENSIONAL; PATTERN RECOGNITION, AUTOMATED; REPRODUCIBILITY OF RESULTS; SENSITIVITY AND SPECIFICITY;

EID: 48349083844     PISSN: 10577149     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIP.2008.926149     Document Type: Article

References (29)

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, Feb. 1994.
2. E. Trucco and A. Verri, Introductory Techniques for 3D Computer Vision, 1st ed. Englewood Cliffs, NJ: Prentice-Hall, 1998.
3. T. H. Hong and M. O. Shneier, "Describing a robot's workspace using a sequence of views from amoving camera," IEEE Trans. Pattern Anal. Mach. Intell., vol. PAMI-7, no. 6, pp. 721-726, Jun. 1985.
4. W. E. Lorensen and H. E. Cline, "Marching cubes: A high resolution 3D surface reconstruction algorithm," Comput. Graph., 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, 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. Graph., vol. 25, pp. 343-352, 2001.
8. N. Chen, L. Serra, and H. Ng, "Surface extraction: Dividing voxels," in Proc. 18th Int. Congr. Exhibition Computer Assisted Radiology and Surgery, 2004, vol. 1268, pp. 225-230.
9. R. Szeliski, "Rapid octree construction from image sequence," Comput. 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. IEEE Int. Conf. Multimedia and Expo, 2004, pp. 133-136.
11. R. Hartley and A. Zisserman, Multiple View Geometry, 1st ed. Cambridge, U.K.: Cambridge Univ. Press, 2000.
12. R. Y. R. Shekhar, E. Fayyad, and J. F. Cornhil, "Octree based decimation of marching cubes surfaces," in Proc. Visualization, 1996, vol. 499, pp. 335-342.
13. L. P. Kobbelt, M. Botsch, U. Schwanecke, and H. P. Seidel, "Feature-sensitive surface extraction from volume data," in Proc. SIGGRAPH, 2001, pp. 57-66.
14. Y. Yemez and F. Schmitt, "3D reconstruction of real objects with high resolution shape and texture," Image Vis. 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, U.K.: Cambridge Univ. Press, 1998.
22. M. Potmesil, "Generating octree models of 3D objects from their silhouettes in a sequence 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. PAMI-11, no. 2, pp. 137-149, Feb. 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, Jun. 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 nonconvex 3D objects," in Proc. 18th Int. Conf. Pattern Recognition 2006, vol. 3, pp. 950-953.
28. R. O. Duda, P. E. Hart, and D. G. Stork, Pattern Classification, 2nd ed. New York: Wiley, 2000.
29. C. Barber, D. P. Dobkin, and H. T. Huhdanpaa, "The quickhull algorithm for convex hulls," ACM Trans. Math. Softw., vol. 22, no. 4, pp. 469-483, 1996.