2015
DOI: 10.4028/www.scientific.net/amm.741.382
|View full text |Cite
|
Sign up to set email alerts
|

Segmentation Algorithm of Three-Dimensional Point Cloud Data Based on Region Growing

Abstract: Segmentation algorithm of 3D point cloud data based on region growing is proposed, the main idea is as follows: First, seed points in each region of object surface are searched, and then, starts from the seed point, the process of regional growing is done, which all the point cloud data belong to same surface are included until some discontinuous set of points appear. The algorithm is implemented under C, and the 3D point cloud data are showed by OPENGL software.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
2
2
1

Relationship

0
5

Authors

Journals

citations
Cited by 6 publications
(2 citation statements)
references
References 8 publications
0
2
0
Order By: Relevance
“…The development of 3D data capturing devices, for instance, LiDAR and Microsoft Kinect, makes the acquisition of point cloud data become ever more convenient. Traditionally, point cloud segmentation algorithms mainly include: methods based on attribute clustering [9], [10], methods based on model fitting [11], [12], methods based on region growth [13]- [15], methods based on graph-cut [16]- [18] and methods based on edge [19]- [21]. However, those approaches adopt handcrafted features from geometric constraints and several are limited by the assumed prior knowledge.…”
Section: B Related Previous Workmentioning
confidence: 99%
“…The development of 3D data capturing devices, for instance, LiDAR and Microsoft Kinect, makes the acquisition of point cloud data become ever more convenient. Traditionally, point cloud segmentation algorithms mainly include: methods based on attribute clustering [9], [10], methods based on model fitting [11], [12], methods based on region growth [13]- [15], methods based on graph-cut [16]- [18] and methods based on edge [19]- [21]. However, those approaches adopt handcrafted features from geometric constraints and several are limited by the assumed prior knowledge.…”
Section: B Related Previous Workmentioning
confidence: 99%
“…It is necessary to segment the rail from the massive point cloud data at first. At present, the common point cloud segmentation methods include clustering segmentation, segmentation based on random sampling consistency and segmentation based on region growth [9][10][11]. This thesis proposed region growing segmentation based on the reflection intensity of point cloud, segmenting the rail according to the reflection characteristics, geometric dimensions and continuous characteristics of rail.…”
Section: Rail Segmentationmentioning
confidence: 99%