2020
DOI: 10.3788/lop57.201105
|View full text |Cite
|
Sign up to set email alerts
|

Improved Lidar Obstacle Detection Method Based on Euclidean Clustering

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(1 citation statement)
references
References 0 publications
0
1
0
Order By: Relevance
“…Depth map and DBSCAN clustering algorithm represent point cloud data as depth map to cluster and segment point cloud [4][5] . The target segmentation algorithm based on the combination of Mean-shift and Euclidean clustering first carries out the rough segmentation of density clustering on the target point cloud, and then carries out the fine segmentation of the roughly segmented point cloud in combination with Euclidean clustering [6] . This method improves the detection integrity and accuracy, but Mean-Shift depends on the selection of clustering center and is easy to fall into local extreme points.…”
Section: Introductionmentioning
confidence: 99%
“…Depth map and DBSCAN clustering algorithm represent point cloud data as depth map to cluster and segment point cloud [4][5] . The target segmentation algorithm based on the combination of Mean-shift and Euclidean clustering first carries out the rough segmentation of density clustering on the target point cloud, and then carries out the fine segmentation of the roughly segmented point cloud in combination with Euclidean clustering [6] . This method improves the detection integrity and accuracy, but Mean-Shift depends on the selection of clustering center and is easy to fall into local extreme points.…”
Section: Introductionmentioning
confidence: 99%