International Journal of Circuits, Systems and Signal Processing

   
E-ISSN: 1998-4464
Volume 15, 2021

Notice: As of 2014 and for the forthcoming years, the publication frequency/periodicity of NAUN Journals is adapted to the 'continuously updated' model. What this means is that instead of being separated into issues, new papers will be added on a continuous basis, allowing a more regular flow and shorter publication times. The papers will appear in reverse order, therefore the most recent one will be on top.

Main Page

Submit a paper | Submission terms | Paper format

 


Volume 15, 2021


Title of the Paper: Ground Segmentation Algorithm of Lidar Point Cloud Based on Ray-Ransac

 

Authors: Yawei Zhao, Yanju Liu, Yang Yu, Jiawei Zhou

Pages: 970-977 

DOI: 10.46300/9106.2021.15.104     XML

Certificate

Abstract: Aiming at the problems of poor segmentation effect, low efficiency and poor robustness of the Ransac ground segmentation algorithm, this paper proposes a radar segmentation algorithm based on Ray-Ransac. This algorithm combines the structural characteristics of three-dimensional lidar and uses ray segmentation to generate the original seed point set. The random sampling of Ransac algorithm is limited to the original seed point set, which reduces the probability that Ransac algorithm extracts outliers and reduces the calculation. The Ransac algorithm is used to modify the ground model parameters so that the algorithm can adapt to the undulating roads. The standard deviation of the distance from the point to the plane model is used as the distance threshold, and the allowable error range of the actual point cloud data is considered to effectively eliminate the abnormal points and error points. The algorithm was tested on the simulation platform and the test vehicle. The experimental results show that the lidar point cloud ground segmentation algorithm proposed in this paper takes an average of 5.784 milliseconds per frame, which has fast speed and good precision. It can adapt to uneven road surface and has high robustness.