使用嵌入式软核处理器的高级驾驶员辅助系统的数据关联技术

Jehangir Khan, C. Tatkeu, P. Deloof, S. Niar
{"title":"使用嵌入式软核处理器的高级驾驶员辅助系统的数据关联技术","authors":"Jehangir Khan, C. Tatkeu, P. Deloof, S. Niar","doi":"10.1109/ITST.2011.6060112","DOIUrl":null,"url":null,"abstract":"Advanced Driver Assistance Systems (ADAS) for automotive applications are used to reduce the number of road accidents. Multiple Target Tracking (MTT) is one of the most efficient techniques used in modern ADAS's. Data Association is a vital part of MTT which can be modeled as the classic Assignment Problem. We implement two algorithms namely, the Munkres (or Hungarian) algorithm and the Auction algorithm in Altera's StratixII FPGA using the NiosII soft-core processor. We analyze the resource requirements and the execution speed of the two algorithms. We describe the circumstances where the use of one or the other of these two algorithms is most suitable in the context of the data association problem.","PeriodicalId":220290,"journal":{"name":"2011 11th International Conference on ITS Telecommunications","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Data association techniques for advanced driver assistance systems using embedded soft-core processors\",\"authors\":\"Jehangir Khan, C. Tatkeu, P. Deloof, S. Niar\",\"doi\":\"10.1109/ITST.2011.6060112\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Advanced Driver Assistance Systems (ADAS) for automotive applications are used to reduce the number of road accidents. Multiple Target Tracking (MTT) is one of the most efficient techniques used in modern ADAS's. Data Association is a vital part of MTT which can be modeled as the classic Assignment Problem. We implement two algorithms namely, the Munkres (or Hungarian) algorithm and the Auction algorithm in Altera's StratixII FPGA using the NiosII soft-core processor. We analyze the resource requirements and the execution speed of the two algorithms. We describe the circumstances where the use of one or the other of these two algorithms is most suitable in the context of the data association problem.\",\"PeriodicalId\":220290,\"journal\":{\"name\":\"2011 11th International Conference on ITS Telecommunications\",\"volume\":\"6 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-10-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 11th International Conference on ITS Telecommunications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITST.2011.6060112\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 11th International Conference on ITS Telecommunications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITST.2011.6060112","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

用于汽车应用的高级驾驶辅助系统(ADAS)用于减少道路交通事故的数量。多目标跟踪(MTT)是现代ADAS中最有效的技术之一。数据关联是MTT的一个重要组成部分,它可以被建模为经典的分配问题。我们使用NiosII软核处理器在Altera的StratixII FPGA中实现了两种算法,即Munkres(或Hungarian)算法和Auction算法。分析了两种算法的资源需求和执行速度。我们描述了在数据关联问题的上下文中使用这两种算法中的一种或另一种最合适的情况。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Data association techniques for advanced driver assistance systems using embedded soft-core processors
Advanced Driver Assistance Systems (ADAS) for automotive applications are used to reduce the number of road accidents. Multiple Target Tracking (MTT) is one of the most efficient techniques used in modern ADAS's. Data Association is a vital part of MTT which can be modeled as the classic Assignment Problem. We implement two algorithms namely, the Munkres (or Hungarian) algorithm and the Auction algorithm in Altera's StratixII FPGA using the NiosII soft-core processor. We analyze the resource requirements and the execution speed of the two algorithms. We describe the circumstances where the use of one or the other of these two algorithms is most suitable in the context of the data association problem.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
From user wishes to system architecture safety for children going to and from school by bus An efficient destination-based data management policy for vehicular networks Joint IP networking and radio architecture for vehicular networks Navigation without GPS: Fake location for mobile phone tracking Analysis of robust collision resolution algorithm with successive interference cancellation and bursty arrivals
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1