Corner estimation for 3D point cloud on convex polyhedral surfaces using delaunay tetrahedralization

We propose a new corner estimation technique for 3D point cloud on convex polyhedral surfaces acquired by a 3D scanner. A corner is an important property of objects, and it is used in various technologies such as 2D or 3D object recognition system. The Harris corner detector and SUSAN are widely used as a method of finding corners in a 3D point cloud. In these methods, however, high processing cost will often be a problem. In this paper, we propose a new corner estimation technique using Delaunay tetrahedralization. This technique is able to estimate corners of convex polyhedral surfaces efficiently by using characteristic tetrahedrons generated by Delaunay tetrahedralization. In an experiment, we compared the proposed technique with the Harris corner detector. As a result of the experiment, for convex polyhedral surfaces used in the experiment, it is confirmed that the proposed technique can estimate corners with less cost than the half of the Harris corner detector without serious loss of the accuracy of each corner location.

[1]  Christopher G. Harris,et al.  A Combined Corner and Edge Detector , 1988, Alvey Vision Conference.

[2]  D. T. Lee,et al.  Two algorithms for constructing a Delaunay triangulation , 1980, International Journal of Computer & Information Sciences.

[3]  Houman Borouchaki,et al.  Delaunay Tetrahedralization using an Advancing-Front Approach , 1996 .

[4]  Maryna Kapustina,et al.  Structure alignment via Delaunay tetrahedralization , 2005, Proteins.

[5]  Dimitrios Katsoulas,et al.  Efficient 3D Vertex Detection in Range Images Acquired with a Laser Sensor , 2001, DAGM-Symposium.

[6]  Oyvind Hjelle,et al.  Triangulations and applications , 2006 .

[7]  Klaus Gärtner,et al.  Meshing Piecewise Linear Complexes by Constrained Delaunay Tetrahedralizations , 2005, IMR.

[8]  Benjamin Bustos,et al.  A Robust 3D Interest Points Detector Based on Harris Operator , 2010, 3DOR@Eurographics.

[9]  Benjamin Bustos,et al.  Harris 3D: a robust extension of the Harris operator for interest point detection on 3D meshes , 2011, The Visual Computer.

[10]  K. Gärtner,et al.  3D boundary recovery by constrained Delaunay tetrahedralization , 2011 .

[11]  Ø. Hjelle,et al.  Triangulations and Applications (Mathematics and Visualization) , 2006 .

[12]  David M. Mount,et al.  A point-placement strategy for conforming Delaunay tetrahedralization , 2000, SODA '00.

[13]  Marco Attene,et al.  Automatic Surface Reconstruction from Point Sets in Space , 2000, Comput. Graph. Forum.

[14]  Przemyslaw Glomb,et al.  Detection of Interest Points on 3D Data: Extending the Harris Operator , 2009, Computer Recognition Systems 3.

[15]  Olivier Aubreton,et al.  SUSAN 3D operator, principal saliency degrees and directions extraction and a brief study on the robustness to noise , 2009, 2009 16th IEEE International Conference on Image Processing (ICIP).

[16]  Stephen M. Smith,et al.  SUSAN—A New Approach to Low Level Image Processing , 1997, International Journal of Computer Vision.