Supervoxel-Based Region Growing Segmentation for Point Cloud Data

2020 ◽  
pp. 2154007
Author(s):  
Nan Luo ◽  
Yuanyuan Jiang ◽  
Quan Wang
Keyword(s):  
Point Cloud ◽  
High Efficiency ◽  
Region Growing ◽  
Experimental Tests ◽  
Point Clouds ◽  
Spatial Distance ◽  
Local Geometry ◽  
Cloud Data ◽  
Point Cloud Segmentation ◽  
Region Growing Segmentation

Point cloud segmentation is a crucial fundamental step in 3D reconstruction, object recognition and scene understanding. This paper proposes a supervoxel-based point cloud segmentation algorithm in region growing principle to solve the issues of inaccurate boundaries and nonsmooth segments in the existing methods. To begin with, the input point cloud is voxelized and then pre-segmented into sparse supervoxels by flow constrained clustering, considering the spatial distance and local geometry between voxels. Afterwards, plane fitting is applied to the over-segmented supervoxels and seeds for region growing are selected with respect to the fitting residuals. Starting from pruned seed patches, adjacent supervoxels are merged in region growing style to form the final segments, according to the normalized similarity measure that integrates the smoothness and shape constraints of supervoxels. We determine the values of parameters via experimental tests, and the final results show that, by voxelizing and pre-segmenting the point clouds, the proposed algorithm is robust to noises and can obtain smooth segmentation regions with accurate boundaries in high efficiency.

scholarly journals SEGMENTATION OF LARGE UNSTRUCTURED POINT CLOUDS USING OCTREE-BASED REGION GROWING AND CONDITIONAL RANDOM FIELDS

2017 ◽  
Vol XLII-2/W8 ◽  
pp. 25-30 ◽  
Author(s):  
M. Bassier ◽  
M. Bonduel ◽  
B. Van Genechten ◽  
M. Vergauwen
Keyword(s):  
Random Fields ◽  
Point Cloud ◽  
Conditional Random Fields ◽  
Conditional Random Field ◽  
Region Growing ◽  
Point Clouds ◽  
Single Type ◽  
Point Cloud Data ◽  
Cloud Data ◽  
Point Cloud Segmentation

Point cloud segmentation is a crucial step in scene understanding and interpretation. The goal is to decompose the initial data into sets of workable clusters with similar properties. Additionally, it is a key aspect in the automated procedure from point cloud data to BIM. Current approaches typically only segment a single type of primitive such as planes or cylinders. Also, current algorithms suffer from oversegmenting the data and are often sensor or scene dependent.<br><br> In this work, a method is presented to automatically segment large unstructured point clouds of buildings. More specifically, the segmentation is formulated as a graph optimisation problem. First, the data is oversegmented with a greedy octree-based region growing method. The growing is conditioned on the segmentation of planes as well as smooth surfaces. Next, the candidate clusters are represented by a Conditional Random Field after which the most likely configuration of candidate clusters is computed given a set of local and contextual features. The experiments prove that the used method is a fast and reliable framework for unstructured point cloud segmentation. Processing speeds up to 40,000 points per second are recorded for the region growing. Additionally, the recall and precision of the graph clustering is approximately 80%. Overall, nearly 22% of oversegmentation is reduced by clustering the data. These clusters will be classified and used as a basis for the reconstruction of BIM models.

scholarly journals UNSUPERVISED SEGMENTATION OF INDOOR 3D POINT CLOUD: APPLICATION TO OBJECT-BASED CLASSIFICATION

2020 ◽  
Vol XLIV-4/W1-2020 ◽  
pp. 111-118 ◽  
Author(s):  
F. Poux ◽  
C. Mattes ◽  
L. Kobbelt
Keyword(s):  
Point Cloud ◽  
Computing Time ◽  
Region Growing ◽  
Point Clouds ◽  
Unsupervised Segmentation ◽  
Cloud Data ◽  
3D Point Clouds ◽  
Object Based ◽  
Indoor Scenes ◽  
Region Growing Segmentation

Abstract. Point cloud data of indoor scenes is primarily composed of planar-dominant elements. Automatic shape segmentation is thus valuable to avoid labour intensive labelling. This paper provides a fully unsupervised region growing segmentation approach for efficient clustering of massive 3D point clouds. Our contribution targets a low-level grouping beneficial to object-based classification. We argue that the use of relevant segments for object-based classification has the potential to perform better in terms of recognition accuracy, computing time and lowers the manual labelling time needed. However, fully unsupervised approaches are rare due to a lack of proper generalisation of user-defined parameters. We propose a self-learning heuristic process to define optimal parameters, and we validate our method on a large and richly annotated dataset (S3DIS) yielding 88.1% average F1-score for object-based classification. It permits to automatically segment indoor point clouds with no prior knowledge at commercially viable performance and is the foundation for efficient indoor 3D modelling in cluttered point clouds.

scholarly journals An Efficient Encoding Voxel-Based Segmentation (EVBS) Algorithm Based on Fast Adjacent Voxel Search for Point Cloud Plane Segmentation

2019 ◽  
Vol 11 (23) ◽  
pp. 2727 ◽  
Author(s):  
Ming Huang ◽  
Pengcheng Wei ◽  
Xianglei Liu
Keyword(s):  
Point Cloud ◽  
Initial Point ◽  
Computation Time ◽  
Region Growing ◽  
Point Clouds ◽  
Recall Rate ◽  
Seed Selection ◽  
Cloud Processing ◽  
Point Cloud Segmentation ◽  
Noise Data

Plane segmentation is a basic yet important process in light detection and ranging (LiDAR) point cloud processing. The traditional point cloud plane segmentation algorithm is typically affected by the number of point clouds and the noise data, which results in slow segmentation efficiency and poor segmentation effect. Hence, an efficient encoding voxel-based segmentation (EVBS) algorithm based on a fast adjacent voxel search is proposed in this study. First, a binary octree algorithm is proposed to construct the voxel as the segmentation object and code the voxel, which can compute voxel features quickly and accurately. Second, a voxel-based region growing algorithm is proposed to cluster the corresponding voxel to perform the initial point cloud segmentation, which can improve the rationality of seed selection. Finally, a refining point method is proposed to solve the problem of under-segmentation in unlabeled voxels by judging the relationship between the points and the segmented plane. Experimental results demonstrate that the proposed algorithm is better than the traditional algorithm in terms of computation time, extraction accuracy, and recall rate.

scholarly journals Panicle-3D: Efficient Phenotyping Tool for Precise Semantic Segmentation of Rice Panicle Point Cloud

2021 ◽  
Vol 2021 ◽  
pp. 1-9
Author(s):  
Liang Gong ◽  
Xiaofeng Du ◽  
Kai Zhu ◽  
Ke Lin ◽  
Qiaojun Lou ◽  
...  
Keyword(s):  
Point Cloud ◽  
Network Models ◽  
Semantic Segmentation ◽  
Spatial Location ◽  
Point Clouds ◽  
Utilization Efficiency ◽  
Data Set ◽  
Cloud Data ◽  
Point Cloud Segmentation ◽  
Segmentation Accuracy

The automated measurement of crop phenotypic parameters is of great significance to the quantitative study of crop growth. The segmentation and classification of crop point cloud help to realize the automation of crop phenotypic parameter measurement. At present, crop spike-shaped point cloud segmentation has problems such as fewer samples, uneven distribution of point clouds, occlusion of stem and spike, disorderly arrangement of point clouds, and lack of targeted network models. The traditional clustering method can realize the segmentation of the plant organ point cloud with relatively independent spatial location, but the accuracy is not acceptable. This paper first builds a desktop-level point cloud scanning apparatus based on a structured-light projection module to facilitate the point cloud acquisition process. Then, the rice ear point cloud was collected, and the rice ear point cloud data set was made. In addition, data argumentation is used to improve sample utilization efficiency and training accuracy. Finally, a 3D point cloud convolutional neural network model called Panicle-3D was designed to achieve better segmentation accuracy. Specifically, the design of Panicle-3D is aimed at the multiscale characteristics of plant organs, combined with the structure of PointConv and long and short jumps, which accelerates the convergence speed of the network and reduces the loss of features in the process of point cloud downsampling. After comparison experiments, the segmentation accuracy of Panicle-3D reaches 93.4%, which is higher than PointNet. Panicle-3D is suitable for other similar crop point cloud segmentation tasks.

scholarly journals Building Plane Segmentation Based on Point Clouds

2021 ◽  
Vol 14 (1) ◽  
pp. 95
Author(s):  
Zhonghua Su ◽  
Zhenji Gao ◽  
Guiyun Zhou ◽  
Shihua Li ◽  
Lihui Song ◽  
...  
Keyword(s):  
Point Cloud ◽  
Region Growing ◽  
Point Clouds ◽  
Plane Boundary ◽  
Point Cloud Data ◽  
Distance Threshold ◽  
Cloud Data ◽  
Optimal Distance ◽  
Building Plane ◽  
Ransac Algorithm

Planes are essential features to describe the shapes of buildings. The segmentation of a plane is significant when reconstructing a building in three dimensions. However, there is a concern about the accuracy in segmenting plane from point cloud data. The objective of this paper was to develop an effective segmentation algorithm for building planes that combines the region growing algorithm with the distance algorithm based on boundary points. The method was tested on point cloud data from a cottage and pantry as scanned using a Faro Focus 3D laser range scanner and Matterport Camera, respectively. A coarse extraction of the building plane was obtained from the region growing algorithm. The coplanar points where two planes intersect were obtained from the distance algorithm. The building plane’s optimal segmentation was then obtained by combining the coarse extraction plane points and the corresponding coplanar points. The results show that the proposed method successfully segmented the plane points of the cottage and pantry. The optimal distance thresholds using the proposed method from the uncoarse extraction plane points to each plane boundary point of cottage and pantry were 0.025 m and 0.030 m, respectively. The highest correct rate and the highest error rate of the cottage’s (pantry’s) plane segmentations using the proposed method under the optimal distance threshold were 99.93% and 2.30% (98.55% and 2.44%), respectively. The F1 score value of the cottage’s and pantry’s plane segmentations using the proposed method under the optimal distance threshold reached 97.56% and 95.75%, respectively. This method can segment different objects on the same plane, while the random sample consensus (RANSAC) algorithm causes the plane to become over-segmented. The proposed method can also extract the coplanar points at the intersection of two planes, which cannot be separated using the region growing algorithm. Although the RANSAC-RG method combining the RANSAC algorithm and the region growing algorithm can optimize the segmentation results of the RANSAC (region growing) algorithm and has little difference in segmentation effect (especially for cottage data) with the proposed method, the method still loses coplanar points at some intersection of the two planes.

scholarly journals MLS POINT CLOUD SEGMENTATION BASED ON FEATURE POINTS OF SCANLINES

2019 ◽  
Vol XLII-2/W13 ◽  
pp. 1007-1013
Author(s):  
R. Honma ◽  
H. Date ◽  
S. Kanai
Keyword(s):  
Point Cloud ◽  
Laser Scanning ◽  
Point Clouds ◽  
Spatial Distance ◽  
Feature Points ◽  
Segmentation Method ◽  
Point Reduction ◽  
Point Cloud Segmentation ◽  
Edge Points ◽  
The Difference

<p><strong>Abstract.</strong> Point clouds acquired using Mobile Laser Scanning (MLS) are applied to extract road information such as curb stones, road markings, and road side objects. In this paper, we present a scanline-based MLS point cloud segmentation method for various road and road side objects. First, end points of the scanline, jump edge points, and corner points are extracted as feature points. The feature points are then interpolated to accurately extract irregular parts consisting of irregularly distributed points such as vegetation. Next, using a point reduction method, additional feature points on a smooth surface are extracted for segmentation at the edges of the curb cut. Finally, points between the feature points are extracted as flat segments on the scanline, and continuing feature points are extracted as irregular segments on the scanline. Furthermore, these segments on the scanline are integrated as flat or irregular regions. In the extraction of the feature points, neighboring points based on the spatial distance are used to avoid being influenced by the difference in the point density. Based on experiments, the effectiveness of the proposed method was indicated based on an application to an MLS point cloud.</p>

scholarly journals Building Extraction from Airborne Multi-Spectral LiDAR Point Clouds Based on Graph Geometric Moments Convolutional Neural Networks

2020 ◽  
Vol 12 (19) ◽  
pp. 3186 ◽  
Author(s):  
Dilong Li ◽  
Xin Shen ◽  
Yongtao Yu ◽  
Haiyan Guan ◽  
Jonathan Li ◽  
...  
Keyword(s):  
Neural Networks ◽  
Convolutional Neural Networks ◽  
Point Cloud ◽  
Point Clouds ◽  
Hierarchical Architecture ◽  
Building Extraction ◽  
Cloud Data ◽  
Geometric Moments ◽  
Point Cloud Segmentation ◽  
Previous State

Building extraction has attracted much attentions for decades as a prerequisite for many applications and is still a challenging topic in the field of photogrammetry and remote sensing. Due to the lack of spectral information, massive data processing, and approach universality, building extraction from point clouds is still a thorny and challenging problem. In this paper, a novel deep-learning-based framework is proposed for building extraction from point cloud data. Specifically, first, a sample generation method is proposed to split the raw preprocessed multi-spectral light detection and ranging (LiDAR) data into numerous samples, which are directly fed into convolutional neural networks and completely cover the original inputs. Then, a graph geometric moments (GGM) convolution is proposed to encode the local geometric structure of point sets. In addition, a hierarchical architecture equipped with GGM convolution, called GGM convolutional neural networks, is proposed to train and recognize building points. Finally, the test scenes with varying sizes can be fed into the framework and obtain a point-wise extraction result. We evaluate the proposed framework and methods on the airborne multi-spectral LiDAR point clouds collected by an Optech Titan system. Compared with previous state-of-the-art networks, which are designed for point cloud segmentation, our method achieves the best performance with a correctness of 95.1%, a completeness of 93.7%, an F-measure of 94.4%, and an intersection over union (IoU) of 89.5% on two test areas. The experimental results confirm the effectiveness and efficiency of the proposed framework and methods.

scholarly journals LatticeNet: fast spatio-temporal point cloud segmentation using permutohedral lattices

2021 ◽  
Author(s):  
Radu Alexandru Rosu ◽  
Peer Schütt ◽  
Jan Quenzel ◽  
Sven Behnke
Keyword(s):  
Point Cloud ◽  
Semantic Segmentation ◽  
Point Clouds ◽  
Local Geometry ◽  
Deep Convolutional Neural Networks ◽  
3D Data ◽  
Novel Approach ◽  
Point Cloud Segmentation ◽  
Spatio Temporal ◽  
Fast Convolutions

AbstractDeep convolutional neural networks have shown outstanding performance in the task of semantically segmenting images. Applying the same methods on 3D data still poses challenges due to the heavy memory requirements and the lack of structured data. Here, we propose LatticeNet, a novel approach for 3D semantic segmentation, which takes raw point clouds as input. A PointNet describes the local geometry which we embed into a sparse permutohedral lattice. The lattice allows for fast convolutions while keeping a low memory footprint. Further, we introduce DeformSlice, a novel learned data-dependent interpolation for projecting lattice features back onto the point cloud. We present results of 3D segmentation on multiple datasets where our method achieves state-of-the-art performance. We also extend and evaluate our network for instance and dynamic object segmentation.

scholarly journals Benchmarking Deep Learning Models on Point Cloud Segmentation

2021 ◽  
Author(s):  
Thanasis Zoumpekas ◽  
Guillem Molina ◽  
Maria Salamó ◽  
Anna Puig
Keyword(s):  
Deep Learning ◽  
Point Cloud ◽  
Performance Metrics ◽  
Point Clouds ◽  
Learning Models ◽  
Cloud Data ◽  
Point Cloud Segmentation ◽  
Segmentation Analysis ◽  
Intelligent Analysis ◽  
Segmentation Task

Point clouds are currently used for a variety of applications, such as detection tasks in medical and geological domains. Intelligent analysis of point clouds is considered a highly computationally demanding and challenging task, especially the segmentation task among the points. Although numerous deep learning models have recently been proposed to segment point cloud data, there is no clear instruction of which exactly neural network to utilize and then incorporate into a system dealing with point cloud segmentation analysis. Besides, the majority of the developed models emphasize more on the accuracy rather than the efficiency, in order to achieve great results. Consequently, the training, validation and testing phases of the models require a great number of processing hours and a huge amount of memory. These high computational requirements are commonly difficult to deal with for many users. In this article, we analyse five state-of-the-art deep learning models for part segmentation task and give meaningful insights into the utilization of each one. We advance guidelines based on different properties, considering both learning-related metrics, such as accuracy, and system-related metrics, such as run time and memory footprint. We further propose and analyse generalized performance metrics, which facilitate the model evaluation phase in segmentation tasks allowing users to select the most appropriate approach for their context in terms of accuracy and efficiency.

scholarly journals UNSUPERVISED WINDOW EXTRACTION FROM PHOTOGRAMMETRIC POINT CLOUDS WITH THERMAL ATTRIBUTES

2019 ◽  
Vol IV-2/W5 ◽  
pp. 45-51 ◽  
Author(s):  
D. Lin ◽  
Z. Dong ◽  
X. Zhang ◽  
H.-G. Maas
Keyword(s):  
Point Cloud ◽  
Energy Optimization ◽  
Region Growing ◽  
Point Clouds ◽  
Automatic Extraction ◽  
3D Point Cloud ◽  
Art Nouveau ◽  
Point Cloud Segmentation ◽  
Object Based ◽  
Practical Validation

<p><strong>Abstract.</strong> The automatic extraction of windows from photogrammetric data has achieved increasing attention in recent times. An unsupervised windows extraction approach from photogrammetric point clouds with thermal attributes is proposed in this study. First, point cloud segmentation is conducted by a popular workflow: Multiscale supervoxel generation is applied to the image-based 3D point cloud, followed by region growing and energy optimization using spatial positions and thermal attributes of the raw points. Afterwards, an object-based feature (window index) is extracted using the average thermal attribute and the size of the object. Next, thresholding is applied to extract initial window regions. Finally, several criterions are applied to further refine the extraction results. For practical validation, the approach is evaluated on an art nouveau building row façade located at Dresden, Germany.</p>

Sign in / Sign up

Export Citation Format

Share Document