Paper
21 June 2011 A parallel point cloud clustering algorithm for subset segmentation and outlier detection
Christian Teutsch, Erik Trostmann, Dirk Berndt
Author Affiliations +
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.
© (2011) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Christian Teutsch, Erik Trostmann, and Dirk Berndt "A parallel point cloud clustering algorithm for subset segmentation and outlier detection", Proc. SPIE 8085, Videometrics, Range Imaging, and Applications XI, 808509 (21 June 2011); https://doi.org/10.1117/12.888654
Lens.org Logo
CITATIONS
Cited by 13 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Clouds

Image segmentation

3D scanning

Scanners

Visualization

Detection and tracking algorithms

Laser scanners

Back to Top