一个仅140 KB的交通标志识别模型

Luo Dawei, Fang Jianjun, Yao Dengfeng
{"title":"一个仅140 KB的交通标志识别模型","authors":"Luo Dawei, Fang Jianjun, Yao Dengfeng","doi":"10.1145/3366715.3366723","DOIUrl":null,"url":null,"abstract":"To design a sign recognition model with low computational complexity and Low parameter quantity, we uses Group Convolution to compress the parameters, and designs extreme block to solve the problem that the number of input channels of Group Convolution must be equal to the number of output channels and that the feature can not be extracted across channels. In this paper, the number of convolution kernels is set according to the number of classifications. Finally, the original 30 MB CifarNet is compressed into a 140 KB classification model. And we tested it on the BelgiumTS Dataset. The experimental test results show that after the model size is compressed to the original 1/220, top1 is not reduced, but it is increased by 87.31%, and top5 is increased by 0.5%. Experiments prove that the compression strategy is effective. And the experiment also explored the relationship between the number of convolution kernels and the number of classifications.","PeriodicalId":425980,"journal":{"name":"Proceedings of the 2019 International Conference on Robotics Systems and Vehicle Technology - RSVT '19","volume":"3436 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Traffic Sign Recognition Model with Only 140 KB\",\"authors\":\"Luo Dawei, Fang Jianjun, Yao Dengfeng\",\"doi\":\"10.1145/3366715.3366723\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"To design a sign recognition model with low computational complexity and Low parameter quantity, we uses Group Convolution to compress the parameters, and designs extreme block to solve the problem that the number of input channels of Group Convolution must be equal to the number of output channels and that the feature can not be extracted across channels. In this paper, the number of convolution kernels is set according to the number of classifications. Finally, the original 30 MB CifarNet is compressed into a 140 KB classification model. And we tested it on the BelgiumTS Dataset. The experimental test results show that after the model size is compressed to the original 1/220, top1 is not reduced, but it is increased by 87.31%, and top5 is increased by 0.5%. Experiments prove that the compression strategy is effective. And the experiment also explored the relationship between the number of convolution kernels and the number of classifications.\",\"PeriodicalId\":425980,\"journal\":{\"name\":\"Proceedings of the 2019 International Conference on Robotics Systems and Vehicle Technology - RSVT '19\",\"volume\":\"3436 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-10-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 2019 International Conference on Robotics Systems and Vehicle Technology - RSVT '19\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3366715.3366723\",\"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 2019 International Conference on Robotics Systems and Vehicle Technology - RSVT '19","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3366715.3366723","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

为了设计一个低计算复杂度和低参数量的符号识别模型,我们使用群卷积对参数进行压缩,并设计极值块来解决群卷积输入通道数必须等于输出通道数以及不能跨通道提取特征的问题。在本文中,根据分类的数量来设置卷积核的数量。最后,将原来的30mb CifarNet压缩成140kb的分类模型。我们在比利时数据集上进行了测试。实验测试结果表明,将模型尺寸压缩到原来的1/220后,top1不但没有降低,反而提高了87.31%,top5提高了0.5%。实验证明该压缩策略是有效的。实验还探讨了卷积核数与分类数之间的关系。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Traffic Sign Recognition Model with Only 140 KB
To design a sign recognition model with low computational complexity and Low parameter quantity, we uses Group Convolution to compress the parameters, and designs extreme block to solve the problem that the number of input channels of Group Convolution must be equal to the number of output channels and that the feature can not be extracted across channels. In this paper, the number of convolution kernels is set according to the number of classifications. Finally, the original 30 MB CifarNet is compressed into a 140 KB classification model. And we tested it on the BelgiumTS Dataset. The experimental test results show that after the model size is compressed to the original 1/220, top1 is not reduced, but it is increased by 87.31%, and top5 is increased by 0.5%. Experiments prove that the compression strategy is effective. And the experiment also explored the relationship between the number of convolution kernels and the number of classifications.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信