基于at - unet的复杂条件下批量目标识别计数

PengPeng Jiang, Kun Zhang, Peijian Zhang, Ping Lu
{"title":"基于at - unet的复杂条件下批量目标识别计数","authors":"PengPeng Jiang, Kun Zhang, Peijian Zhang, Ping Lu","doi":"10.1109/ICCCS49078.2020.9118519","DOIUrl":null,"url":null,"abstract":"As we all know, the large number of counts is a challenging and time consuming task subject because of oversized number and complex conditions. However, the development of deep learning makes deep learning models very competitive in image segmentation. In this paper, we take cigarette filter rods as the research object. we first evaluate the standard Unet for the filter rod target recognition to separate target and background. Secondly, we use the focal loss function instead of the traditional cross-entropy function to solve the problem of imbalance between target and background area. Thirdly, we add a self-attention module in the traditional Unet convolutional layer to enhance the convolution effect. Fourth, we propose structural element detection criteria and round tangency matching strategy based on HMM (Hidden Markov Model) for the geometric relationship of filter rod position, which further improves the accuracy of the algorithm. We used Qu's [1], Mask-R-CNN [2], FCN [3], Deep-lab-V1 [4] and this paper’s algorithm to test the performance of 30000 images from the industrial site. The performance of this paper’s algorithm is completely better than the performance of the above algorithm.","PeriodicalId":105556,"journal":{"name":"2020 5th International Conference on Computer and Communication Systems (ICCCS)","volume":"122 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Batch Target Recognition Count under Complex Conditions Based on Att-Unet\",\"authors\":\"PengPeng Jiang, Kun Zhang, Peijian Zhang, Ping Lu\",\"doi\":\"10.1109/ICCCS49078.2020.9118519\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"As we all know, the large number of counts is a challenging and time consuming task subject because of oversized number and complex conditions. However, the development of deep learning makes deep learning models very competitive in image segmentation. In this paper, we take cigarette filter rods as the research object. we first evaluate the standard Unet for the filter rod target recognition to separate target and background. Secondly, we use the focal loss function instead of the traditional cross-entropy function to solve the problem of imbalance between target and background area. Thirdly, we add a self-attention module in the traditional Unet convolutional layer to enhance the convolution effect. Fourth, we propose structural element detection criteria and round tangency matching strategy based on HMM (Hidden Markov Model) for the geometric relationship of filter rod position, which further improves the accuracy of the algorithm. We used Qu's [1], Mask-R-CNN [2], FCN [3], Deep-lab-V1 [4] and this paper’s algorithm to test the performance of 30000 images from the industrial site. The performance of this paper’s algorithm is completely better than the performance of the above algorithm.\",\"PeriodicalId\":105556,\"journal\":{\"name\":\"2020 5th International Conference on Computer and Communication Systems (ICCCS)\",\"volume\":\"122 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-05-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 5th International Conference on Computer and Communication Systems (ICCCS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCCS49078.2020.9118519\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 5th International Conference on Computer and Communication Systems (ICCCS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCCS49078.2020.9118519","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

众所周知,由于数量庞大,条件复杂,大量计数是一项具有挑战性和耗时的任务。然而,深度学习的发展使得深度学习模型在图像分割方面具有很强的竞争力。本文以卷烟滤嘴棒为研究对象。我们首先评估了标准Unet用于滤波棒目标识别以分离目标和背景。其次,我们用焦点损失函数代替传统的交叉熵函数来解决目标和背景区域不平衡的问题。第三,在传统的Unet卷积层中加入自关注模块,增强卷积效果。第四,针对滤波棒位置的几何关系,提出了基于隐马尔可夫模型(HMM)的结构元素检测准则和圆切线匹配策略,进一步提高了算法的精度。我们使用Qu的[1]、Mask-R-CNN[2]、FCN[3]、Deep-lab-V1[4]和本文的算法对来自工业现场的30000张图像进行了性能测试。本文算法的性能完全优于上述算法的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Batch Target Recognition Count under Complex Conditions Based on Att-Unet
As we all know, the large number of counts is a challenging and time consuming task subject because of oversized number and complex conditions. However, the development of deep learning makes deep learning models very competitive in image segmentation. In this paper, we take cigarette filter rods as the research object. we first evaluate the standard Unet for the filter rod target recognition to separate target and background. Secondly, we use the focal loss function instead of the traditional cross-entropy function to solve the problem of imbalance between target and background area. Thirdly, we add a self-attention module in the traditional Unet convolutional layer to enhance the convolution effect. Fourth, we propose structural element detection criteria and round tangency matching strategy based on HMM (Hidden Markov Model) for the geometric relationship of filter rod position, which further improves the accuracy of the algorithm. We used Qu's [1], Mask-R-CNN [2], FCN [3], Deep-lab-V1 [4] and this paper’s algorithm to test the performance of 30000 images from the industrial site. The performance of this paper’s algorithm is completely better than the performance of the above algorithm.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信