A Multiple Object Tracking Method Based on Optimized FairMOT

H. Qi, Xiaoyan Fu, Xuejie He, Honghong Liu
{"title":"A Multiple Object Tracking Method Based on Optimized FairMOT","authors":"H. Qi, Xiaoyan Fu, Xuejie He, Honghong Liu","doi":"10.1109/ICCSMT54525.2021.00072","DOIUrl":null,"url":null,"abstract":"In order to solve the issue of missed detection that is easy to occur in the multi object tracking algorithm FairMOT when the target appearance is similar to the background, and to improve the accuracy of multi-object tracking algorithm in pedestrian tracking, we proposed a pedestrian tracking algorithm termed as DA_FairMOT, based on FairMOT algorithm. At different levels of its feature extraction network DLA34, we added two self-attention modules, the spatial module and channel module. DA_FairMOT combined the two attention feature maps to further improve the representational capability of the model. In the experiment, we use the CLEAR MOT evaluation metric. As a result, the proposed DA_FairMOT algorithm improves IDP (the ID precision) by 1.59% on the MOT17 dataset, compared with the benchmark FairMOT algorithm. DA_FairMOT achieves 66.44 for MOTA, and 70.03 for IDF1.","PeriodicalId":304337,"journal":{"name":"2021 2nd International Conference on Computer Science and Management Technology (ICCSMT)","volume":"400 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 2nd International Conference on Computer Science and Management Technology (ICCSMT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCSMT54525.2021.00072","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In order to solve the issue of missed detection that is easy to occur in the multi object tracking algorithm FairMOT when the target appearance is similar to the background, and to improve the accuracy of multi-object tracking algorithm in pedestrian tracking, we proposed a pedestrian tracking algorithm termed as DA_FairMOT, based on FairMOT algorithm. At different levels of its feature extraction network DLA34, we added two self-attention modules, the spatial module and channel module. DA_FairMOT combined the two attention feature maps to further improve the representational capability of the model. In the experiment, we use the CLEAR MOT evaluation metric. As a result, the proposed DA_FairMOT algorithm improves IDP (the ID precision) by 1.59% on the MOT17 dataset, compared with the benchmark FairMOT algorithm. DA_FairMOT achieves 66.44 for MOTA, and 70.03 for IDF1.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于优化FairMOT的多目标跟踪方法
为了解决FairMOT多目标跟踪算法在目标外观与背景相似时容易出现漏检的问题,同时为了提高多目标跟踪算法在行人跟踪中的精度,我们在FairMOT算法的基础上提出了DA_FairMOT行人跟踪算法。在其特征提取网络DLA34的不同层次上,我们增加了两个自关注模块:空间模块和通道模块。DA_FairMOT将两种注意力特征映射结合起来,进一步提高了模型的表示能力。在实验中,我们使用了clearmot评价指标。结果表明,与基准FairMOT算法相比,DA_FairMOT算法在MOT17数据集上的IDP (ID精度)提高了1.59%。DA_FairMOT对于MOTA达到66.44,对于IDF1达到70.03。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Research on the evaluation of innovation ability of high-tech industry from the perspective of integrated development of Yangtze River Delta Based on Entropy Weight-TOPSIS Method Foreign matter detection of coal conveying belt based on machine vision Research on Performance Evaluation of Fiscal Expenditure Efficiency in Old Industrial Cities Detection of Cassava Leaf Diseases Using Self-supervised Learning Research on the Innovation of Online Recruitment mode of small and medium-sized enterprises - Statistical analysis based on recruitment information
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1