2018
DOI: 10.1016/j.patrec.2017.12.016
|View full text |Cite
|
Sign up to set email alerts
|

Voxel-based segmentation of 3D point clouds from construction sites using a probabilistic connectivity model

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
30
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 63 publications
(30 citation statements)
references
References 8 publications
0
30
0
Order By: Relevance
“…Hence, these methods tend to perform well in relatively simplified scenarios and with synthetic data, but are not ready to tackle the real bridge components whose asconstructed and as-weathered shapes further increase the as-designed complexity. To reduce computational time, Xu et al (2018) suggest an octree-based probabilistic segmentation model for construction sites. The authors partitioned the scene into voxels.…”
Section: Bottom-up Detectionmentioning
confidence: 99%
See 1 more Smart Citation
“…Hence, these methods tend to perform well in relatively simplified scenarios and with synthetic data, but are not ready to tackle the real bridge components whose asconstructed and as-weathered shapes further increase the as-designed complexity. To reduce computational time, Xu et al (2018) suggest an octree-based probabilistic segmentation model for construction sites. The authors partitioned the scene into voxels.…”
Section: Bottom-up Detectionmentioning
confidence: 99%
“…To reduce computational time, Xu et al. () suggest an octree‐based probabilistic segmentation model for construction sites. The authors partitioned the scene into voxels.…”
Section: Introductionmentioning
confidence: 99%
“…Truong-Hong et al (2013) introduced an OB-based technique to automatically extract building façade features in point clouds. Xu et al (2018) suggested an OB probabilistic segmentation model for construction sites. However, the segmentation accuracy of this method is quite sensitive to the voxel size.…”
Section: Bottom-up Detectionmentioning
confidence: 99%
“…Graph-based clustering aims to divide a dataset into disjoint subsets with members similar to each other from the affinity matrix. In (Xu et al, 2018b), the use of the local graph structure for the description of the 3D geometry with the supervoxel structure has been tested. The use of the local graph model can make the clustering process quite efficient and available for parallel computing when combined with regiongrowing strategy.…”
Section: Global Graph-based Clusteringmentioning
confidence: 99%
“…Once the global graph of all the supervoxels is constructed, we can optimize the connection of each supervoxel by clustering nodes of the constructed global graph. To this end, similarly to work in (Xu et al, 2018b), we resolve the graph clustering problem via the adaption of the efficient graph-based segmentation method proposed in (Felzenszwalb, Huttenlocher, 2004). After the connections of all the voxels are identified, the connected voxels are clustered into one segment.…”
Section: Global Graph-based Clusteringmentioning
confidence: 99%