Share Email Print

Proceedings Paper

A parallel point cloud clustering algorithm for subset segmentation and outlier detection
Author(s): Christian Teutsch; Erik Trostmann; Dirk Berndt
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

We present a fast point cloud clustering technique which is suitable for outlier detection, object segmentation and region labeling for large multi-dimensional data sets. The basis is a minimal data structure similar to a kd-tree which enables us to detect connected subsets very fast. The proposed algorithms utilizing this tree structure are parallelizable which further increases the computation speed for very large data sets. The procedures given are a vital part of the data preprocessing. They improve the input data properties for a more reliable computation of surface measures, polygonal meshes and other visualization techniques. In order to show the effectiveness of our techniques we evaluate sets of point clouds from different 3D scanning devices.

Paper Details

Date Published: 21 June 2011
PDF: 6 pages
Proc. SPIE 8085, Videometrics, Range Imaging, and Applications XI, 808509 (21 June 2011); doi: 10.1117/12.888654
Show Author Affiliations
Christian Teutsch, Fraunhofer-Institut für Fabrikbetrieb und -automatisierung (Germany)
Erik Trostmann, Fraunhofer-Institut für Fabrikbetrieb und -automatisierung (Germany)
Dirk Berndt, Fraunhofer-Institut für Fabrikbetrieb und -automatisierung (Germany)

Published in SPIE Proceedings Vol. 8085:
Videometrics, Range Imaging, and Applications XI
Fabio Remondino; Mark R. Shortis, Editor(s)

© SPIE. Terms of Use
Back to Top