Abstract

In the process of obstacle detection based on LiDAR, the traditional DBSCAN clustering algorithm can't achieve good clustering for both short-range and long-distance targets because of the uneven distribution of data density, resulting in missed detection or false detection. To solve the problem, this paper proposed an optimized DBSCAN algorithm which improves the adaptability under different distance by optimize the selection method of neighborhood radius. According to the distribution of the lines scanned by LiDAR, the distance between two adjacent scan lines is determined and an improved neighborhood radius list is established. Then the neighborhood radius will be searched in the list based on the coordinated values of each scan point. Finally, linear interpolation method is used to obtain the corresponding neighborhood radius. The experimental results based on Ford dataset prove that compared with the traditional DBSCAN algorithm, the proposed algorithm can effectively improve the accuracy of obstacle detection and adapt to the target clustering operation under different distances. The positive detection rate of obstacle detection is increased by 17.52%.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.