A variable scale approach for neighbor search in point cloud data

An algorithm for selecting nearest neighbors at a variable scale rather than a fixed search radius in point cloud neighbor search is proposed in this paper. We employ the concepts in differential geometry and divide the point cloud into different clusters according to their surface types. Not only the distance metric but also the clusters' surface type is taken into condition when we search the neighbors of a certain point. This results in a variable scale in nearest neighbor search which can preserve good enough details even using a big scale as well as reduce side effects of noise data caused by using a small scale. The proposed algorithm is tested with the data of Stanford Bunny by simulation. Its effectiveness is confirmed by the experiments.

[1]  Martin Buss,et al.  Comparison of surface normal estimation methods for range sensing applications , 2009, 2009 IEEE International Conference on Robotics and Automation.

[2]  Ramesh C. Jain,et al.  Invariant surface characteristics for 3D object recognition in range images , 1985, Comput. Vis. Graph. Image Process..

[3]  Alan M. McIvor,et al.  A comparison of local surface geometry estimation methods , 1997, Machine Vision and Applications.

[4]  Martin Buss,et al.  Realtime segmentation of range data using continuous nearest neighbors , 2009, 2009 IEEE International Conference on Robotics and Automation.

[5]  Terry Caelli,et al.  Computation of Surface Geometry and Segmentation Using Covariance Techniques , 1994, IEEE Trans. Pattern Anal. Mach. Intell..

[6]  William E. Lorensen,et al.  Marching cubes: A high resolution 3D surface construction algorithm , 1987, SIGGRAPH.

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

[8]  Andrew W. Fitzgibbon,et al.  An Experimental Comparison of Range Image Segmentation Algorithms , 1996, IEEE Trans. Pattern Anal. Mach. Intell..

[9]  Leonidas J. Guibas,et al.  Estimating surface normals in noisy point cloud data , 2004, Int. J. Comput. Geom. Appl..

[10]  Nico Blodow,et al.  Fast Point Feature Histograms (FPFH) for 3D registration , 2009, 2009 IEEE International Conference on Robotics and Automation.

[11]  Markus H. Gross,et al.  Efficient simplification of point-sampled surfaces , 2002, IEEE Visualization, 2002. VIS 2002..

[12]  Nico Blodow,et al.  Fast geometric point labeling using conditional random fields , 2009, 2009 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[13]  Radu Bogdan Rusu,et al.  Semantic 3D Object Maps for Everyday Manipulation in Human Living Environments , 2010, KI - Künstliche Intelligenz.

[14]  Shuangshuang Jin,et al.  A comparison of algorithms for vertex normal computation , 2005, The Visual Computer.

[15]  Andrew Zisserman,et al.  MLESAC: A New Robust Estimator with Application to Estimating Image Geometry , 2000, Comput. Vis. Image Underst..

[16]  Jonathon Shlens,et al.  A Tutorial on Principal Component Analysis , 2014, ArXiv.

[17]  Hans-Peter Seidel,et al.  An efficient construction of reduced deformable objects , 2013, ACM Trans. Graph..

[18]  Marc Alexa,et al.  Computing and Rendering Point Set Surfaces , 2003, IEEE Trans. Vis. Comput. Graph..

[19]  Bir Bhanu,et al.  RANGE DATA PROCESSING: REPRESENTATION OF SURFACES BY EDGES. , 1986 .