Abstract
Classification of point clouds by different types of geometric primitives is an essential part in the reconstruction process of CAD geometry. We use support vector machines (SVM) to label patches in point clouds with the class labels tori, ellipsoids, spheres, cones, cylinders or planes. For the classification features based on different geometric properties like point normals, angles, and principal curvatures are used. These geometric features are estimated in the local neighborhood of a point of the point cloud. Computing these geometric features for a random subset of the point cloud yields a feature distribution. Different features are combined for achieving best classification results. To minimize the time consuming training phase of SVMs, the geometric features are first evaluated using linear discriminant analysis (LDA).
LDA and SVM are machine learning approaches that require an initial training phase to allow for a subsequent automatic classification of a new data set. For the training phase point clouds are generated using a simulation of a laser scanning device. Additional noise based on an laser scanner error model is added to the point clouds. The resulting LDA and SVM classifiers are then used to classify geometric primitives in simulated and real laser scanned point clouds.
Compared to other approaches, where all known features are used for classification, we explicitly compare novel against known geometric features to prove their effectiveness.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Arbeiter, G., Fuchs, S., Bormann, R., Fischer, J., Verl, A.: Evaluation of 3D feature descriptors for classification of surface geometries in point clouds. In: International Conference on Intelligent Robots and Systems, pp. 1644–1650 (2012)
CGAL, Computational Geometry Algorithms Library. www.cgal.org
Cazals, F., Pouget, M.: Estimating differential quantities using polynomial fitting of osculating jets. Comput. Aided Geom. Des. 22(2), 121–146 (2005)
Cristianini, N., Shawe-Taylor, J.: An Introduction to Support Vector Machines and other kernel-Based Learning Methods. Cambridge University Press, Cambridge (2000)
Denker, K., Hagel, D., Raible, J., Umlauf, G., Hamann, B.: On-line reconstruction of CAD geometry. In: International Conference on 3D Vision, pp. 151–158 (2013)
Duda, R.O., Hart, P.E., Stork, D.G.: Pattern Classification. Wiley, New York (2001)
Endoh, M., Yanagimachi, T., Ohbuchi, R.: Efficient manifold learning for 3D model retrieval by using clustering-based training sample reduction. In: International Conference on Acoustics, Speech and Signal Processing pp. 2345–2348 (2012)
Fischler, M.A., Bolles, R.C.: Random sample consensus: a paradigm for model fitting with applications to image analysis and automated cartography. Commun. ACM 24(6), 381–395 (1981)
Golovinskiy, A., Kim, V.G., Funkhouser, T.: Shape-based recognition of 3D point clouds in urban environments. In:International Conference on Computer Vision (2009)
Hwang, H., Hyung, S., Yoon, S., Roh, K.: Robust descriptors for 3D point clouds using geometric and photometric local feature. In: International Conference on Intelligent Robots and Systems (IROS), pp. 4027–4033 (2012)
Hetzel, G., Leibe, B., Levi, P., Schiele, B.: 3D object recognition from range images using local feature histograms. In: CVPR, pp. 394–399 (2001)
Igel, C., Heidrich-Meisner, V., Glasmachers, T.: Shark. J. Mach. Learn. Res. 9, 993–996 (2008)
Koenderink, J.J., van Doorn, A.J.: Surface shape and curvature scales. Image Vis. Comput. 10(8), 557–565 (1992)
Lorensen, W.E., Cline, H.E.: Marching cubes: a high resolution 3D surface construction algorithm. In: SIGGRAPH 1987, pp. 163–169 (1987)
Mahmoudi, M., Sapiro, G.: Three-dimensional point cloud recognition via distributions of geometric distances. Graph. Models 71(1), 22–31 (2009)
Osada, R., Funkhouser, T., Chazelle, B., Dobkin, D.: Shape distributions. ACM Trans. Graph. 21(4), 807–832 (2002)
Rusu, R.B., Marton, Z.C., Blodow, N., Beetz, M.: Persistent point feature histograms for 3D point clouds. In: 10th International Conference on Intelligent Autonomous Systems (2008)
Schoelkopf, B., Smola, A.J.: Learning with Kernels. MIT Press, Cambridge (2001)
Wahl, E., Hillenbrand, U., Hirzinger, G.: Surflet-pair-relation histograms: a statistical 3D-shape representation for rapid classification. In: 3DIM, pp. 474–482. IEEE (2003)
Yamamoto, A., Tezuka, M., Shimizu, T., Ohbuchi, R.: SHREC 2008 entry: semi-supervised learning for semantic 3D model retrieval. In: International Conference on Shape Modeling and Applications (2008)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
A Additional Geometric Features and Model Selection
A Additional Geometric Features and Model Selection
For comparison additional geometrical features were tested, see Table 4. For optimization results of the SVM model selection refer to Table 5.
-
A.1
Centroid distances are computed as distance of random points to the bounding box centroid, [OFCD02].
-
A.2
Cube cell count is computed by subdividing the point cloud’s bounding box into equally sized cells and counting the points in each cell. This feature is not invariant to rotation.
-
A.3
K-Median points are computed by clustering the points into k clusters, such that the sum of distances of points in the cluster to their median is minimized. The coordinates of the resulting medians are concatenated to one feature vector of size 3k.
-
A.4
The moduli of principal curvatures \(\kappa _1\), \(\kappa _2\) as in Sect. 2.1 yield two concatenated histograms.
-
A.5
, A.6, and A.7 mean curvatures \(H ={(\kappa _1 + \kappa _2)}/{2}\), Gauss curvatures \(K = \kappa _1 \kappa _2\), and curvature ratios \(|{\kappa _1}/{\kappa _2}|\).
-
A.8
Curvature changes are computed as the absolute difference between a random point’s principal curvatures and those of its nearest neighbor and yield two concatenated histograms.
-
A.9
Shape indices as in [KvD92].
The histograms of the geometric features A.5, A.6, A.7, and A.8 are cropped to range between the 0.05 and 0.95 percentiles. All these features are less effective in the experiments with a true-positive-rate below 0.5.
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Caputo, M., Denker, K., Franz, M.O., Laube, P., Umlauf, G. (2015). Support Vector Machines for Classification of Geometric Primitives in Point Clouds. In: Boissonnat, JD., et al. Curves and Surfaces. Curves and Surfaces 2014. Lecture Notes in Computer Science(), vol 9213. Springer, Cham. https://doi.org/10.1007/978-3-319-22804-4_7
Download citation
DOI: https://doi.org/10.1007/978-3-319-22804-4_7
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-22803-7
Online ISBN: 978-3-319-22804-4
eBook Packages: Computer ScienceComputer Science (R0)