Simple-NMS: Improved Pedestrian Detection with New Constraints

Li Tian, Zhaogong Zhang
{"title":"Simple-NMS: Improved Pedestrian Detection with New Constraints","authors":"Li Tian, Zhaogong Zhang","doi":"10.1109/CCAI50917.2021.9447459","DOIUrl":null,"url":null,"abstract":"Non-maximum suppression (NMS) is an indispensable post-processing step in object detection. After a picture is detected by the target, a large number of redundant anchors will be obtained, so we need to go through NMS to process these repeated anchors. Its essence is to extract the target detection frame with high confidence and suppress the false detection frame with low confidence. The biggest problem in the NMS algorithm is that it completely removes adjacent low-confidence detection frames. In some images with dense targets, this is very likely to cause missed detection and false detection. Therefore, we proposed the Simple-NMS algorithm, which adds two new thresholds to the original NMS, and sets a constraint condition different from the original based on the new threshold, and does not change the complexity of the traditional NMS algorithm, which can be very good Improve the effectiveness of NMS missed targets. The new NMS algorithm is improved on the standard data sets PASAL VOC2007 and MS COCO. In addition, the algorithm is simple and efficient, and can be easily integrated into any other object detection process.","PeriodicalId":121785,"journal":{"name":"2021 International Conference on Computer Communication and Artificial Intelligence (CCAI)","volume":"182 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 International Conference on Computer Communication and Artificial Intelligence (CCAI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCAI50917.2021.9447459","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Non-maximum suppression (NMS) is an indispensable post-processing step in object detection. After a picture is detected by the target, a large number of redundant anchors will be obtained, so we need to go through NMS to process these repeated anchors. Its essence is to extract the target detection frame with high confidence and suppress the false detection frame with low confidence. The biggest problem in the NMS algorithm is that it completely removes adjacent low-confidence detection frames. In some images with dense targets, this is very likely to cause missed detection and false detection. Therefore, we proposed the Simple-NMS algorithm, which adds two new thresholds to the original NMS, and sets a constraint condition different from the original based on the new threshold, and does not change the complexity of the traditional NMS algorithm, which can be very good Improve the effectiveness of NMS missed targets. The new NMS algorithm is improved on the standard data sets PASAL VOC2007 and MS COCO. In addition, the algorithm is simple and efficient, and can be easily integrated into any other object detection process.
Simple-NMS:基于新约束的改进行人检测
非最大抑制(NMS)是目标检测中不可缺少的后处理步骤。当目标检测到一张图片后,会得到大量冗余的锚点,所以我们需要通过NMS对这些重复的锚点进行处理。其实质是提取高置信度的目标检测帧,抑制低置信度的假检测帧。NMS算法最大的问题是完全去除了相邻的低置信度检测帧。在一些目标密集的图像中,这很容易造成漏检和误检。因此,我们提出了Simple-NMS算法,该算法在原有NMS的基础上增加了两个新的阈值,并在新阈值的基础上设置了与原有不同的约束条件,同时不改变传统NMS算法的复杂度,可以很好地提高NMS漏掉目标的有效性。该算法在PASAL VOC2007和MS COCO标准数据集上进行了改进。此外,该算法简单高效,可以很容易地集成到任何其他目标检测过程中。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信