A Robust and Fast Reconstruction Framework for Noisy and Large Point Cloud Data

In this paper we present a robust reconstruction framework on noisy and large point cloud data. Though Poisson reconstruction performs well in recovering the surface from noisy point cloud data, it's problematic to reconstruct underlying surface from large cloud data, especially on a general processor. An inaccurate estimation of point normal for noisy and large dataset would result in local distortion on the reconstructed mesh. We adopt a systematical combination of Poisson-disk sampling, normal estimation and Poisson reconstruction to avoid the inaccuracy of normal calculated from k-nearest neighbors. With the fewer dataset obtained by sampling on original points, the normal estimated is more reliable for subsequent Poisson reconstruction and the time spent in normal estimation and reconstruction is much less. We demonstrate the effectiveness of the framework in recovering topology and geometry information when dealing with point cloud data from real world. The experiment results indicate that the framework is superior to Poisson reconstruction directly on raw point dataset in the aspects of time consumption and visual fidelity.

[1]  Paolo Cignoni,et al.  Ieee Transactions on Visualization and Computer Graphics 1 Efficient and Flexible Sampling with Blue Noise Properties of Triangular Meshes , 2022 .

[2]  Gabriel Taubin,et al.  SSD: Smooth Signed Distance Surface Reconstruction , 2011, Comput. Graph. Forum.

[3]  Gabriel Taubin,et al.  A benchmark for surface reconstruction , 2013, TOGS.

[4]  M. Kazhdan,et al.  Interactive and anisotropic geometry processing using the screened Poisson equation , 2011, SIGGRAPH 2011.

[5]  Lihui Wang,et al.  Normal Vector Estimation for Point Clouds via Local Delaunay Triangle Mesh Matching , 2013 .

[6]  Michael M. Kazhdan,et al.  Interactive and anisotropic geometry processing using the screened Poisson equation , 2011, ACM Trans. Graph..

[7]  Florent Lafarge,et al.  Surface Reconstruction through Point Set Structuring , 2013, Comput. Graph. Forum.

[8]  Renato Pajarola,et al.  Shape Reconstruction from Raw Point Clouds using Depth Carving , 2012, Eurographics.

[9]  Yan Huang,et al.  Point cloud compression based on hierarchical point clustering , 2013, 2013 Asia-Pacific Signal and Information Processing Association Annual Summit and Conference.

[10]  Jian Liu,et al.  Point cloud normal estimation via low-rank subspace clustering , 2013, Comput. Graph..

[11]  Tim Weyrich,et al.  Real-Time 3D Reconstruction in Dynamic Scenes Using Point-Based Fusion , 2013, 2013 International Conference on 3D Vision.

[12]  David Cohen-Steiner,et al.  Reconstructing 3D compact sets , 2012, Comput. Geom..

[13]  Alina Sultana,et al.  Triangular mesh simplification using an adaptive subdivision , 2013, International Symposium on Signals, Circuits and Systems ISSCS2013.

[14]  Michael M. Kazhdan,et al.  Poisson surface reconstruction , 2006, SGP '06.

[15]  Jean-Michel Morel,et al.  Scale Space Meshing of Raw Data Point Sets , 2011, Comput. Graph. Forum.

[16]  Michael M. Kazhdan,et al.  Screened poisson surface reconstruction , 2013, TOGS.

[17]  Nico Blodow,et al.  Real-time compression of point cloud streams , 2012, 2012 IEEE International Conference on Robotics and Automation.

[18]  Roland Siegwart,et al.  Normal estimation for pointcloud using GPU based sparse tensor voting , 2012, 2012 IEEE International Conference on Robotics and Biomimetics (ROBIO).

[19]  Greg Humphreys,et al.  A spatial data structure for fast Poisson-disk sample generation , 2006, ACM Trans. Graph..

[20]  Anttoni Jaakkola,et al.  Improved Sampling for Terrestrial and Mobile Laser Scanner Point Cloud Data , 2013, Remote. Sens..