2016
DOI: 10.1016/j.isprsjprs.2016.01.001
|View full text |Cite
|
Sign up to set email alerts
|

Octree-based segmentation for terrestrial LiDAR point cloud data in industrial applications

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
41
0

Year Published

2017
2017
2022
2022

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 64 publications
(42 citation statements)
references
References 21 publications
0
41
0
Order By: Relevance
“…An octree is a data structure represented by a tree, in which each branch contains eight nodes, and therefore is commonly used to partition 3-D space into voxels (Truong-Hong and Laefer, 2014;Su et al, 2016). In this work, the whole 3-D points are equally and recursively partitioned into eight voxels until reaching a predefined sub-division depth or all voxels containing less than the predefined point number.…”
Section: Octree-based Voxelizationmentioning
confidence: 99%
See 1 more Smart Citation
“…An octree is a data structure represented by a tree, in which each branch contains eight nodes, and therefore is commonly used to partition 3-D space into voxels (Truong-Hong and Laefer, 2014;Su et al, 2016). In this work, the whole 3-D points are equally and recursively partitioned into eight voxels until reaching a predefined sub-division depth or all voxels containing less than the predefined point number.…”
Section: Octree-based Voxelizationmentioning
confidence: 99%
“…In this work, the whole 3-D points are equally and recursively partitioned into eight voxels until reaching a predefined sub-division depth or all voxels containing less than the predefined point number. Note that the octree has been used for the storage, segmentation, and compression of huge 3-D point clouds (Wang and Tseng, 2011;Elseberg et al, 2013;Su et al, 2016), as well as visualization (Wurm et al, 2010). The input 3-D points are recursively partitioned into voxels with a given voxel size, vp.…”
Section: Octree-based Voxelizationmentioning
confidence: 99%
“…Theoretically, region growing-based methods can keep the boundaries of surfaces well, but they are sensitive to noise and outliers. For example, over-segmentation can easily occur for large curvature objects (e.g., pipes with a long radius elbow joint) although the surfaces of which are smoothly connected (Su et al, 2016). On the other hand, their performances largely resort to the selection of seeds (e.g., the location and distribution of seeds).…”
Section: Related Workmentioning
confidence: 99%
“…In Vo et al, (2015), the octree structure and the region growing process are combined for the fast surface patch segmentation. Whereas, the octree-based voxel structure combined with graphbased sub -splitting is applied to segment cylindrical objects in industrial scenes (Su et al, 2016). Using voxel structure apparently reduces the computation cost and suppress negative effects of outliers and varying point densities.…”
Section: Related Workmentioning
confidence: 99%
“…Cylindrical features are one of the most encountered geometric primitives in point clouds when collected in industrial sites, urban areas, street corridors, but also forest. Cylinder fitting is a fundamental task in computer graphics, computer vision, image analysis, reverse engineering, pattern recognition, photogrammetry and remote sensing for various applications like feature extraction (De Guevara et al, 2011), surface reconstruction (Schnabel et al, 2007), archaeological documentation, street furniture management, building information modelling (Kwon et al, 2004), as-built modelling (Ahmed et al, 2014), machine tools quality control, industrial plant settings (Su et al, 2016), tunnel monitoring (Gosliga et al, 2006), and forest inventory (Lalonde et al, 2006), and therefore has been studied rigorously.…”
Section: Introductionmentioning
confidence: 99%