A Data Structure for the 3D Hough Transform for Plane Detection

Abstract The Hough Transform is a well-known method for detecting parametrized objects. It is the de facto standard for the detection of lines and circles in 2-dimensional data sets. For 3D it has attained little attention so far. Apart from computational costs, the main problem is the representation of the accumulator: Usual implementations favor geometrical objects with certain parameters due to uneven sampling of the parameter space. In this paper we present a novel approach to design the accumulator focusing on achieving the same size for each cell. The proposed accumulator is compared to previously known designs.

[1]  Guannan Gao,et al.  Probabilistic Hough Transform , 2011 .

[2]  Andreas Birk,et al.  Fast plane detection and polygonalization in noisy 3D range images , 2008, 2008 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[3]  Richard O. Duda,et al.  Use of the Hough transformation to detect lines and curves in pictures , 1972, CACM.

[4]  Ulrich Bauer,et al.  Detection of Planar Regions in Volume Data for Topology Optimization , 2008, GMP.

[5]  Titus B. Zaharia,et al.  Shape-based retrieval of 3D mesh models , 2002, Proceedings. IEEE International Conference on Multimedia and Expo.

[6]  Erkki Oja,et al.  A new curve detection method: Randomized Hough transform (RHT) , 1990, Pattern Recognit. Lett..

[7]  Robert C. Bolles,et al.  Random sample consensus: a paradigm for model fitting with applications to image analysis and automated cartography , 1981, CACM.

[8]  Stefano Carpin,et al.  HSM3D: Feature-less global 6DOF scan-matching in the Hough/Radon domain , 2009, 2009 IEEE International Conference on Robotics and Automation.

[9]  Reinhard Klein,et al.  Efficient RANSAC for Point‐Cloud Shape Detection , 2007, Comput. Graph. Forum.