2018
DOI: 10.1109/jstars.2018.2817227
|View full text |Cite
|
Sign up to set email alerts
|

Unsupervised Segmentation of Point Clouds From Buildings Using Hierarchical Clustering Based on Gestalt Principles

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
31
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
8
1

Relationship

1
8

Authors

Journals

citations
Cited by 42 publications
(31 citation statements)
references
References 59 publications
0
31
0
Order By: Relevance
“…Similar to RG, feature clustering is also a process of grouping points with similar features into a cluster under common constraints. K-means (Shi et al, 2011), fuzzy C-means (Biosca and Lerma, 2008), hierarchical clustering (Xu et al, 2018) are frequently adopted for segmentation task of the point clouds. Compared with RG, one advantage of such approaches is that no seeds are needed for initialization.…”
Section: Point Cloud Segmentationmentioning
confidence: 99%
“…Similar to RG, feature clustering is also a process of grouping points with similar features into a cluster under common constraints. K-means (Shi et al, 2011), fuzzy C-means (Biosca and Lerma, 2008), hierarchical clustering (Xu et al, 2018) are frequently adopted for segmentation task of the point clouds. Compared with RG, one advantage of such approaches is that no seeds are needed for initialization.…”
Section: Point Cloud Segmentationmentioning
confidence: 99%
“…The MLS dataset is also used for a brief evaluation of segmentation performance. Manual segmentation from (Xu et al, 2018c) is used as references (see Figs. 5d-5g) in a way similar to the work in (Vo et al, 2015).…”
Section: Testing Datasetsmentioning
confidence: 99%
“…We first test our proposed global graph-based clustering method on the reference datasets, which has been mentioned and used in (Xu et al, 2018c). The voxel sizes used in our is set to 0.1m, and seed resolutions of supervoxels in our proposed method, Locally Convex Connected Patches (LCCP), and Supervoxel and graph-based segmentation (SVGS) are both set to 0.25 m.…”
Section: Point Cloud Segmentationmentioning
confidence: 99%
“…Clustering method: This method is an unsupervised learning method, which heuristically clusters points with similar attributes into the same class to meet the requirements of cost functions. Representative methods include the classic K-means algorithm [23], Euclidean distance clustering algorithm [24], mean shift clustering [25][26][27], hierarchical clustering [28][29][30], sample density-based clustering [31,32], and mixed kernel density function clustering [33]. For example, Wu et al [24] introduced a smooth threshold constraint to the traditional Euclidean clustering algorithm to prevent over-and/or under-segmentation problems.…”
Section: Introductionmentioning
confidence: 99%