Cluster-Linkage Analysis in Traffic Data Clustering for Development of Advanced Driver Assistance Systems

Hiroki Watanabe, T. Malý, Johannes Wallner, G. Prokop
{"title":"Cluster-Linkage Analysis in Traffic Data Clustering for Development of Advanced Driver Assistance Systems","authors":"Hiroki Watanabe, T. Malý, Johannes Wallner, G. Prokop","doi":"10.1109/ICICT50521.2020.00017","DOIUrl":null,"url":null,"abstract":"In terms of vehicle safety, the number of advanced driver assistance systems (ADAS) mounted in an automobile has been increasing recently. For an efficient conceptional design and system validation of ADAS, the representative test scenarios are indispensable. In order to identify the representative scenarios,the real-world traffic scenarios are to be clustered according to their similarity. The hierarchical agglomerative clustering is a well-known method to quantify the similarity of traffic scenarios existing in a database. However, the cluster structure is affected by the linkage criterion used in the agglomerative procedure.This study inquires into the similarity measurement of vehicle-pedestrian near-crashes in the USA. Various linkage criteria are selected to get better understanding of their influence on the clustering results and conduct a comparative study. Furthermore,a hybrid clustering algorithm is presented, which is based on k-covers and k-means clustering. Using the average silhouette width, the optimal number of clusters is calculated and the cluster structures are investigated. In the end, the representative scenarios are selected with the use of centrality measure and form the basis of the scenario catalog making for the reduction of test effort in ADAS development.","PeriodicalId":445000,"journal":{"name":"2020 3rd International Conference on Information and Computer Technologies (ICICT)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 3rd International Conference on Information and Computer Technologies (ICICT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICICT50521.2020.00017","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

In terms of vehicle safety, the number of advanced driver assistance systems (ADAS) mounted in an automobile has been increasing recently. For an efficient conceptional design and system validation of ADAS, the representative test scenarios are indispensable. In order to identify the representative scenarios,the real-world traffic scenarios are to be clustered according to their similarity. The hierarchical agglomerative clustering is a well-known method to quantify the similarity of traffic scenarios existing in a database. However, the cluster structure is affected by the linkage criterion used in the agglomerative procedure.This study inquires into the similarity measurement of vehicle-pedestrian near-crashes in the USA. Various linkage criteria are selected to get better understanding of their influence on the clustering results and conduct a comparative study. Furthermore,a hybrid clustering algorithm is presented, which is based on k-covers and k-means clustering. Using the average silhouette width, the optimal number of clusters is calculated and the cluster structures are investigated. In the end, the representative scenarios are selected with the use of centrality measure and form the basis of the scenario catalog making for the reduction of test effort in ADAS development.
面向高级驾驶辅助系统开发的交通数据聚类中的聚类-关联分析
在车辆安全方面,最近汽车上安装的先进驾驶辅助系统(ADAS)越来越多。为了有效地进行ADAS的概念设计和系统验证,具有代表性的测试场景是必不可少的。为了识别具有代表性的场景,将现实世界的交通场景根据相似度进行聚类。层次聚合聚类是一种众所周知的量化数据库中存在的交通场景相似性的方法。然而,聚类结构受到聚类过程中使用的链接准则的影响。本研究探讨美国车辆与行人近距离碰撞的相似度测量。选择不同的联动准则,更好地了解其对聚类结果的影响,并进行比较研究。在此基础上,提出了基于k-覆盖和k-均值聚类的混合聚类算法。利用平均轮廓宽度计算了簇的最优数量,并对簇的结构进行了研究。最后,使用中心性度量选择具有代表性的场景,并形成场景目录的基础,以减少ADAS开发中的测试工作量。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信