基于Arc-Softmax损失的快速R-CNN选择性特征融合小交通标志检测

Site Li, Yang Gu, Zhichao Song, Tengfei Xing, Yiping Meng, Pengfei Xu, Runbo Hu, Tiancheng Zhang, Ge Yu, Hua Chai
{"title":"基于Arc-Softmax损失的快速R-CNN选择性特征融合小交通标志检测","authors":"Site Li, Yang Gu, Zhichao Song, Tengfei Xing, Yiping Meng, Pengfei Xu, Runbo Hu, Tiancheng Zhang, Ge Yu, Hua Chai","doi":"10.1145/3357000.3366142","DOIUrl":null,"url":null,"abstract":"Traffic signs are basic and important elements in maps. They are related to traffic regulations, profoundly affecting/managing the travel mode of human beings and efficiency of vehicle running. Traffic sign mining technology is applied in many research fields such as traditional map update, high-precision map establishment and automatic driving. Image based traffic sign identification technology has the advantages of low cost and high efficiency over manual processing mode, and traffic sign detection has thus become a significant task with the pacing advancement of autonomous driving. However, many common object detection methods cannot be directly applied to this task, as the size of traffic signs are very small yet they vary considerably. Due to such characteristics, features of traffic signs are difficult to capture, and are harder to discriminate between classes. To address this problem, we proposed a selective feature fusion based Faster R-CNN with Arc-Softmax loss, which optimizes the detection performance from the two following ways: network structure and loss function. We discover that each Faster R-CNN layer is only capable of detecting targets within a certain size range. By carefully selecting and combining different layers' feature maps, we can extract features that effectively represent traffic signs of various sizes. Then, Arc-Softmax loss penalizes the angular distances between the feature vectors of different signs, and their corresponding weight vectors of the last fully connected layers, thereby encouraging intra-class compactness and inter-class separability between learned features. Extensive analysis and experiments on the challenging Tsinghua-Tencent 100K benchmark demonstrate the superiority and implementation simplicity of our proposed method. Code will be made publicly available.","PeriodicalId":153340,"journal":{"name":"Proceedings of the 12th ACM SIGSPATIAL International Workshop on Computational Transportation Science","volume":"279 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Small Traffic Sign Detection Through Selective Feature Fusion Based Faster R-CNN With Arc-Softmax Loss\",\"authors\":\"Site Li, Yang Gu, Zhichao Song, Tengfei Xing, Yiping Meng, Pengfei Xu, Runbo Hu, Tiancheng Zhang, Ge Yu, Hua Chai\",\"doi\":\"10.1145/3357000.3366142\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Traffic signs are basic and important elements in maps. They are related to traffic regulations, profoundly affecting/managing the travel mode of human beings and efficiency of vehicle running. Traffic sign mining technology is applied in many research fields such as traditional map update, high-precision map establishment and automatic driving. Image based traffic sign identification technology has the advantages of low cost and high efficiency over manual processing mode, and traffic sign detection has thus become a significant task with the pacing advancement of autonomous driving. However, many common object detection methods cannot be directly applied to this task, as the size of traffic signs are very small yet they vary considerably. Due to such characteristics, features of traffic signs are difficult to capture, and are harder to discriminate between classes. To address this problem, we proposed a selective feature fusion based Faster R-CNN with Arc-Softmax loss, which optimizes the detection performance from the two following ways: network structure and loss function. We discover that each Faster R-CNN layer is only capable of detecting targets within a certain size range. By carefully selecting and combining different layers' feature maps, we can extract features that effectively represent traffic signs of various sizes. Then, Arc-Softmax loss penalizes the angular distances between the feature vectors of different signs, and their corresponding weight vectors of the last fully connected layers, thereby encouraging intra-class compactness and inter-class separability between learned features. Extensive analysis and experiments on the challenging Tsinghua-Tencent 100K benchmark demonstrate the superiority and implementation simplicity of our proposed method. Code will be made publicly available.\",\"PeriodicalId\":153340,\"journal\":{\"name\":\"Proceedings of the 12th ACM SIGSPATIAL International Workshop on Computational Transportation Science\",\"volume\":\"279 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-11-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 12th ACM SIGSPATIAL International Workshop on Computational Transportation Science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3357000.3366142\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 12th ACM SIGSPATIAL International Workshop on Computational Transportation Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3357000.3366142","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

交通标志是地图的基本和重要组成部分。它们与交通规则有关,深刻地影响着人类的出行方式和车辆的运行效率。交通标志挖掘技术在传统地图更新、高精度地图制作、自动驾驶等诸多研究领域都有应用。基于图像的交通标志识别技术相对于人工处理模式具有成本低、效率高的优点,随着自动驾驶的快速发展,交通标志检测已成为一项重要的任务。然而,许多常见的目标检测方法不能直接应用于该任务,因为交通标志的尺寸很小,但它们的变化很大。由于这些特点,交通标志的特征很难被捕捉,并且很难在类别之间进行区分。为了解决这一问题,我们提出了一种基于Arc-Softmax损失的选择性特征融合的Faster R-CNN,该算法从网络结构和损失函数两方面优化了检测性能。我们发现每个Faster R-CNN层只能检测一定尺寸范围内的目标。通过仔细选择和组合不同层的特征图,我们可以提取出有效表示不同大小交通标志的特征。然后,Arc-Softmax损失会惩罚不同符号的特征向量之间的角距离,以及它们对应的最后一个完全连接层的权向量,从而促进学习到的特征之间的类内紧性和类间可分性。在具有挑战性的清华-腾讯100K基准测试上进行了大量的分析和实验,证明了我们提出的方法的优越性和实现的简单性。代码将公开提供。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Small Traffic Sign Detection Through Selective Feature Fusion Based Faster R-CNN With Arc-Softmax Loss
Traffic signs are basic and important elements in maps. They are related to traffic regulations, profoundly affecting/managing the travel mode of human beings and efficiency of vehicle running. Traffic sign mining technology is applied in many research fields such as traditional map update, high-precision map establishment and automatic driving. Image based traffic sign identification technology has the advantages of low cost and high efficiency over manual processing mode, and traffic sign detection has thus become a significant task with the pacing advancement of autonomous driving. However, many common object detection methods cannot be directly applied to this task, as the size of traffic signs are very small yet they vary considerably. Due to such characteristics, features of traffic signs are difficult to capture, and are harder to discriminate between classes. To address this problem, we proposed a selective feature fusion based Faster R-CNN with Arc-Softmax loss, which optimizes the detection performance from the two following ways: network structure and loss function. We discover that each Faster R-CNN layer is only capable of detecting targets within a certain size range. By carefully selecting and combining different layers' feature maps, we can extract features that effectively represent traffic signs of various sizes. Then, Arc-Softmax loss penalizes the angular distances between the feature vectors of different signs, and their corresponding weight vectors of the last fully connected layers, thereby encouraging intra-class compactness and inter-class separability between learned features. Extensive analysis and experiments on the challenging Tsinghua-Tencent 100K benchmark demonstrate the superiority and implementation simplicity of our proposed method. Code will be made publicly available.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信