Surface-Normal Estimation with Neighborhood Reorganization for 3D Reconstruction

Fastest three-dimensional (3D) surface reconstruction algorithms, from point clouds, require of the knowledge of the surface-normals. The accuracy, of state of the art methods, depends on the precision of estimated surface-normals. Surface-normals are estimated by assuming that the surface can be locally modelled by a plane as was proposed by Hoppe et. al [1]. Thus, current methods for estimating surface-normals are prone to introduce artifacts at the geometric edges or corners of the objects. In this paper an algorithm for Normal Estimation with Neighborhood Reorganization (NENR) is presented. Our proposal changes the characteristics of the neighborhood in places with corners or edges by assuming a locally plane piecewise surface. The results obtained by NENR improve the quality of the normal with respect to the state of the art algorithms. The new neighborhood computed by NENR, use only those points that belong to the same plane and they are the nearest neighbors. Experiments in synthetic and real data shown an improvement on the geometric edges of 3D reconstructed surfaces when our algorithm is used.

[1]  Luis Enrique Sucar,et al.  MICAI 2004: Advances in Artificial Intelligence , 2004, Lecture Notes in Computer Science.

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

[3]  José Francisco Martínez-Trinidad,et al.  Progress in Pattern Recognition, Image Analysis and Applications, 12th Iberoamericann Congress on Pattern Recognition, CIARP 2007, Valparaiso, Chile, November 13-16, 2007, Proceedings , 2008, CIARP.

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

[5]  Mariano Rivera,et al.  The adaptive-rest condition spring system: an edge-preserving regularization technique , 2000, Proceedings 2000 International Conference on Image Processing (Cat. No.00CH37101).

[6]  Joseph O'Rourke,et al.  Computational Geometry in C. , 1995 .

[7]  Hans-Peter Seidel,et al.  Multi-level partition of unity implicits , 2005, SIGGRAPH Courses.

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

[9]  Mariano Rivera,et al.  Efficient half-quadratic regularization with granularity control , 2003, Image Vis. Comput..

[10]  Leonardo Romero,et al.  Non-parametric Registration as a Way to Obtain an Accurate Camera Calibration , 2004, MICAI.

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

[12]  Michael J. Black,et al.  On the unification of line processes, outlier rejection, and robust statistics with applications in early vision , 1996, International Journal of Computer Vision.

[13]  Michel Barlaud,et al.  Deterministic edge-preserving regularization in computed imaging , 1997, IEEE Trans. Image Process..

[14]  Jules Bloomenthal,et al.  An Implicit Surface Polygonizer , 1994, Graphics Gems.

[15]  Mariano Rivera,et al.  Adaptive Rest Condition Potentials: First and Second Order Edge-Preserving Regularization , 2002, Comput. Vis. Image Underst..

[16]  Sunghee Choi,et al.  The power crust , 2001, SMA '01.

[17]  Leonardo Romero,et al.  GA-SSD-ARC-NLM for Parametric Image Registration , 2006, CIARP.

[18]  Taku Komura,et al.  Topology matching for fully automatic similarity estimation of 3D shapes , 2001, SIGGRAPH.

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

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

[21]  John C. Hart,et al.  Sphere tracing: a geometric method for the antialiased ray tracing of implicit surfaces , 1996, The Visual Computer.

[22]  J. O´Rourke,et al.  Computational Geometry in C: Arrangements , 1998 .

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