Ensembles for Normal and Surface Reconstructions

The majority of the existing techniques for surface reconstruction and the closely related problem of normal estimation are deterministic. Their main advantages are the speed and, given a reasonably good initial input, the high quality of the reconstructed surfaces. Nevertheless, their deterministic nature may hinder them from effectively handling incomplete data with noise and outliers. In our previous work [1], we applied a statistical technique, called ensembles, to the problem of surface reconstruction. We showed that an ensemble can improve the performance of a deterministic algorithm by putting it into a statistics based probabilistic setting. In this paper, with several experiments, we further study the suitability of ensembles in surface reconstruction, and also apply ensembles to normal estimation. We experimented with a widely used normal estimation technique [2] and Multi-level Partitions of Unity implicits for surface reconstruction [3], showing that normal and surface ensembles can successfully be combined to handle noisy point sets.

[1]  Hans-Peter Seidel,et al.  Using growing cell structures for surface reconstruction , 2003, 2003 Shape Modeling International..

[2]  Holly E. Rushmeier,et al.  The 3D Model Acquisition Pipeline , 2002, Comput. Graph. Forum.

[3]  Tamal K. Dey,et al.  Tight cocone: a water-tight surface reconstructor , 2003, SM '03.

[4]  Yoav Freund,et al.  Experiments with a New Boosting Algorithm , 1996, ICML.

[5]  Chandrajit L. Bajaj,et al.  Automatic reconstruction of surfaces and scalar fields from 3D scans , 1995, SIGGRAPH.

[6]  Paolo Cignoni,et al.  Metro: Measuring Error on Simplified Surfaces , 1998, Comput. Graph. Forum.

[7]  Jie Xu,et al.  Bilateral Estimation of Vertex Normal for Point-Sampled Models , 2005, ICCSA.

[8]  Hans-Peter Seidel,et al.  Ensembles for Surface Reconstruction , 2005 .

[9]  Marc Levoy,et al.  Fitting smooth surfaces to dense polygon meshes , 1996, SIGGRAPH.

[10]  Frédo Durand,et al.  Normal improvement for point rendering , 2004, IEEE Computer Graphics and Applications.

[11]  Tony DeRose,et al.  Surface reconstruction from unorganized points , 1992, SIGGRAPH.

[12]  Hans-Peter Seidel,et al.  Neural mesh ensembles , 2004, Proceedings. 2nd International Symposium on 3D Data Processing, Visualization and Transmission, 2004. 3DPVT 2004..

[13]  Samuel R. Buss,et al.  Spherical averages and applications to spherical splines and interpolation , 2001, TOGS.

[14]  Sunghee Choi,et al.  The power crust, unions of balls, and the medial axis transform , 2001, Comput. Geom..

[15]  Marshall W. Bern,et al.  A new Voronoi-based surface reconstruction algorithm , 1998, SIGGRAPH.

[16]  Hans-Peter Seidel,et al.  Neural meshes: surface reconstruction with a learning algorithm , 2004 .

[17]  Niloy J. Mitra,et al.  Estimating surface normals in noisy point cloud data , 2003, SCG '03.

[18]  Tim Weyrich,et al.  Post-processing of Scanned 3D Surface Data , 2004, PBG.

[19]  Tamal K. Dey,et al.  Eurographics Symposium on Point-based Graphics (2005) Normal Estimation for Point Clouds: a Comparison Study for a Voronoi Based Method , 2022 .

[20]  James F. O'Brien,et al.  Spectral surface reconstruction from noisy point clouds , 2004, SGP '04.

[21]  Renato Pajarola,et al.  A simple approach for point-based object capturing and rendering , 2004, IEEE Computer Graphics and Applications.

[22]  R. Schapire.  The Strength of Weak Learnability , 1990, Machine Learning.

[23]  Richard K. Beatson,et al.  Reconstruction and representation of 3D objects with radial basis functions , 2001, SIGGRAPH.

[24]  Meenakshisundaram Gopi,et al.  Surface Reconstruction based on Lower Dimensional Localized Delaunay Triangulation , 2000, Comput. Graph. Forum.

[25]  Hans-Peter Seidel,et al.  Multi-level partition of unity implicits , 2003, ACM Trans. Graph..

[26]  Markus H. Gross,et al.  Shape modeling with point-sampled geometry , 2003, ACM Trans. Graph..