An Improved Lidar Data Segmentation Algorithm Based on Euclidean Clustering

16Citations
Citations of this article
14Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Segmentation of Lidar Data is an essential part of automatic tasks, such as object detection, classification, recognition and localization. The segmentation results pose a direct impact on the further processing. In this paper, we present an improved Euclidean clustering algorithm for points cloud data segmentation. The k-d tree and voxel grid are used to improve data processing speed. The point cloud of ground is removed from the original dataset by using RANSAC algorithm. Then we use clustering method to get the objects by setting different thresholds at different distance. The experiment states that the proposed algorithm can improve the accuracy of point cloud segmentation.

Author supplied keywords

Cite

CITATION STYLE

APA

Sun, Z., Li, Z., & Liu, Y. (2020). An Improved Lidar Data Segmentation Algorithm Based on Euclidean Clustering. In Lecture Notes in Electrical Engineering (Vol. 582, pp. 1119–1130). Springer. https://doi.org/10.1007/978-981-15-0474-7_105

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free