Sharp feature extraction in point clouds

Sharp feature extraction has been playing an important role in point cloud processing. In this study, a novel method for extracting sharp features from point clouds is presented. It is proposed that in a given point cloud, the displacement between each of the points and the weighted average position in the given neighbourhood of that point is calculated, and the point is labelled as the candidate sharp feature point if the displacement is salient. The normal directions of the obtained candidate sharp feature points are estimated by means of local principal component analysis. Tensor voting is performed to refine the normal estimates. The displacement between a point and its locally weighted average position is projected along the estimated normal direction. The points with extreme projection values are defined as the final sharp feature points. The implementation of the proposed method on both synthesised and practical scanned point clouds show that the method is effective and robust for the purpose of sharp feature extraction.

[1]  Markus H. Gross,et al.  Feature Preserving Point Set Surfaces based on Non‐Linear Kernel Regression , 2009, Comput. Graph. Forum.

[2]  Cláudio T. Silva,et al.  Spline-based feature curves from point-sampled geometry , 2008, The Visual Computer.

[3]  Cláudio T. Silva,et al.  Robust Smooth Feature Extraction from Point Clouds , 2007, IEEE International Conference on Shape Modeling and Applications 2007 (SMI '07).

[4]  Dirk Roose,et al.  Detection of closed sharp edges in point clouds using normal estimation and graph theory , 2007, Comput. Aided Des..

[5]  Cindy Grimm,et al.  Feature Detection Using Curvature Maps and the Min-cut/Max-flow Algorithm , 2006, GMP.

[6]  Charlie C. L. Wang,et al.  Bilateral recovering of sharp edges on feature-insensitive sampled meshes , 2006, IEEE Transactions on Visualization and Computer Graphics.

[7]  Cláudio T. Silva,et al.  Triangulating point set surfaces with bounded error , 2005, SGP '05.

[8]  Hans-Peter Seidel,et al.  Fast and robust detection of crest lines on meshes , 2005, SPM '05.

[9]  Marco Attene,et al.  Sharpen&Bend: recovering curved sharp edges in triangle meshes produced by feature-insensitive sampling , 2005, IEEE Transactions on Visualization and Computer Graphics.

[10]  Leif Kobbelt,et al.  A survey of point-based techniques in computer graphics , 2004, Comput. Graph..

[11]  Markus H. Gross,et al.  Multi‐scale Feature Extraction on Point‐Sampled Surfaces , 2003, Comput. Graph. Forum.

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

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

[14]  Joonki Paik,et al.  Robust crease detection and curvature estimation of piecewise smooth surfaces from triangle mesh approximations using normal voting , 2001, Proceedings of the 2001 IEEE Computer Society Conference on Computer Vision and Pattern Recognition. CVPR 2001.

[15]  Markus H. Gross,et al.  Multiresolution feature extraction for unstructured meshes , 2001, Proceedings Visualization, 2001. VIS '01..

[16]  Kouki Watanabe,et al.  Detection of Salient Curvature Features on Polygonal Surfaces , 2001, Comput. Graph. Forum.

[17]  A. Barr,et al.  Implicit fairing of irregular meshes using diffusion and curvature flow , 1999, SIGGRAPH.

[18]  Gérard G. Medioni,et al.  Inference of Surfaces, 3D Curves, and Junctions From Sparse, Noisy, 3D Data , 1997, IEEE Trans. Pattern Anal. Mach. Intell..

[19]  Paul S. Heckbert,et al.  Surface simplification using quadric error metrics , 1997, SIGGRAPH.

[20]  Sharath Pankanti,et al.  Robust feature detection for 3D object recognition and matching , 1993, Optics & Photonics.

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