期刊文献+

分区基于密度的聚类算法在激光雷达行人检测系统中的应用 被引量:7

The Application of Partitioning-density-based Spatial Clustering of Applications with Noise Algorithm in LIDAR Based Pedestrian Detection System
在线阅读 下载PDF
导出
摘要 行人检测过程中原始DBSCAN算法不能正确地对密度不均匀的激光点云聚类,产生错误的聚类结果导致行人检测系统出现误检和漏检。为解决这一问题,基于激光雷达的行人检测系统在原始密度聚类算法DBSCAN的基础上提出了分区DBSCAN算法。该算法将密度不均匀的点云数据划分为若干个密度相对均匀的分区,从而能实现对行人的快速准确检测。实验结果表明原始DBSCAN算法行人检测率为62.47%,使用分区DBSCAN算法的激光雷达行人检测系统行人检测率达到82.21%,相对于原始DBSCAN算法检测精度提高了19.74%;而且在时间消耗上也比原始DBSCAN算法降低了16.22%。 In the process of pedestrian detection, original DBSCA Nalgorithm can′t correctly cluster the uneven laser points cloud, and the wrong clustering result will lead to false detection and leak detection.To solve this problem, a partitioning-DBSCA Nalgorithm was proposed based on the original DBSCAN algorithm for pedestrian detection system.The algorithm will divide the uneven points cloud into several relatively homogeneous density partition, which can realize fast and exact detection.Experimental results show that the pedestrian detection rate of original DBSCAN algorithm was 62.47%, and the pedestrian detection rate of partitioning-DBSCAN was 82.21%, which increased by 19.74%;also, the time consumption of our method was reduced by 16.22% than the original DBSCAN algorithm.
出处 《科学技术与工程》 北大核心 2017年第18期282-287,共6页 Science Technology and Engineering
基金 长江学者和创新团队发展计划项目(IRT1286) 陕西省自然科学基金(2016JQ5096) 中央高校基本科研业务费专项资金(10822151028 310822172001)资助
关键词 分区基于密度的聚类(DBSCAN) 算法 行人检测 激光雷达 聚类 partitioning-DBSCAN algorithm pedestrian detection laser scanner clustering
  • 相关文献

参考文献9

二级参考文献111

  • 1姜华平,许洪国.基于数理统计原理的交通事故多发点识别[J].济南交通高等专科学校学报,2001,9(3):15-17. 被引量:6
  • 2顾柏园,王荣本,余天洪,郭烈.基于视觉的前方车辆探测技术研究方法综述[J].公路交通科技,2005,22(10):114-119. 被引量:14
  • 3任兴平,何忠龙,孟增辉.改进DBSCAN算法中参数Eps值的确定[J].现代电子技术,2007,30(11):120-121. 被引量:5
  • 4Ester,Martin, Kriegel H P,et al. A Density Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise [ C ]//Proceedings of the 2nd International Conference on Knowledge Discovery and Data Mining(KDD-96). Ortland, Oregon : [ s. n. ], 1996.
  • 5Daszykowski M, Walczak B,Massart D L. Looking for Natural Patterns In Data [ J ]. Chemometics and Intelligent Laboratory Systems, 2001,56 : 83 - 92.
  • 6Ankerst M, Breunig M, Kriegel H P, et al. Optics: Ordering points to Identify the Clustering Structure [ C ]//Proceedings of ACM SIGMOD International Conference on Management of Data. Philadephia : ACM Press, 1999:49-60.
  • 7高舁.基于密度聚类算法的改进方法研究[D].大连:大连理工大学,2007.
  • 8Jain A K, Dubes R C. Algorithms for clustering data[M]. USA: Prentice Hall, 1988.
  • 9Pelleg D, Moore A W. X-means: Extending K-means with efficient estimation of the number of clusters[C]//7th International Conference on Machine Learning (ICML). San Francisco, CA, USA: Morgan Kaufmann, 2000: 727-734.
  • 10Zhang T, Ramakrishnan R, Livny M. BIRCH: An efficient data clustering method for very large datahases[C]//ACM SIGMOD International Conference on Management of Data. New York, USA: ACM, 1996: 103-114.

共引文献246

同被引文献60

引证文献7

二级引证文献51

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部