High-accuracy Low-latency Non-Maximum Suppression Processor for Traffic Object Detection

Pub Date : 2023-01-01 DOI:10.1587/elex.20.20230445
Chenbo Yuan, Peng Xu, Gang Chen
{"title":"High-accuracy Low-latency Non-Maximum Suppression Processor for Traffic Object Detection","authors":"Chenbo Yuan, Peng Xu, Gang Chen","doi":"10.1587/elex.20.20230445","DOIUrl":null,"url":null,"abstract":"As autonomous driving technology advances, the requirements for object detection are becoming increasingly high. Non-maximum suppression (NMS) algorithm, as a key component in traffic object detection algorithms, is an independent post-processing process in the object detection framework. Due to the complexity of real-world road scenarios and high density of detected entities in urban traffic, the number of candidate bounding boxes generated by the neural network is large. Hence, low-precision processors may generate a significant number of redundant target bounding boxes. The excessive output of redundant target bounding boxes not only imposes a workload on subsequent processing but also has the potential to result in non-optimal decision-making. We propose a high-performance NMS processor that can quickly process a large number of candidate boxes without performing sorting of their scores. Also, it has low precision loss computing units and high parallel computing arrays. Combined with algorithm design, it effectively reduces the computational complexity and reduces the inference time of the end-to-end task of the NMS algorithm. Thus, our NMS processor’s speed is comparable to SOTA architecture, and the average accuracy loss is only 0.4% .","PeriodicalId":0,"journal":{"name":"","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1587/elex.20.20230445","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

As autonomous driving technology advances, the requirements for object detection are becoming increasingly high. Non-maximum suppression (NMS) algorithm, as a key component in traffic object detection algorithms, is an independent post-processing process in the object detection framework. Due to the complexity of real-world road scenarios and high density of detected entities in urban traffic, the number of candidate bounding boxes generated by the neural network is large. Hence, low-precision processors may generate a significant number of redundant target bounding boxes. The excessive output of redundant target bounding boxes not only imposes a workload on subsequent processing but also has the potential to result in non-optimal decision-making. We propose a high-performance NMS processor that can quickly process a large number of candidate boxes without performing sorting of their scores. Also, it has low precision loss computing units and high parallel computing arrays. Combined with algorithm design, it effectively reduces the computational complexity and reduces the inference time of the end-to-end task of the NMS algorithm. Thus, our NMS processor’s speed is comparable to SOTA architecture, and the average accuracy loss is only 0.4% .
分享
查看原文
用于流量目标检测的高精度低延迟非最大抑制处理器
随着自动驾驶技术的进步,对目标检测的要求越来越高。非最大抑制(NMS)算法是目标检测框架中一个独立的后处理过程,是流量目标检测算法的关键组成部分。由于现实世界道路场景的复杂性和城市交通中检测实体的高密度,神经网络生成的候选边界框数量很大。因此,低精度处理器可能会产生大量冗余目标边界框。冗余目标边界框的过量输出不仅给后续处理增加了工作量,而且有可能导致非最优决策。我们提出了一种高性能NMS处理器,它可以快速处理大量候选框,而无需对其分数进行排序。此外,它还具有低精度损耗计算单元和高并行计算阵列。结合算法设计,有效降低了NMS算法端到端任务的计算复杂度,缩短了推理时间。因此,我们的NMS处理器的速度与SOTA架构相当,平均精度损失仅为0.4%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
×
引用
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学术官方微信