ATPTrack: Visual tracking with alternating token pruning of dynamic templates and search region

IF 5.5 2区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Neurocomputing Pub Date : 2025-01-27 DOI:10.1016/j.neucom.2025.129534
Shuo Zhang , Dan Zhang , Qi Zou
{"title":"ATPTrack: Visual tracking with alternating token pruning of dynamic templates and search region","authors":"Shuo Zhang ,&nbsp;Dan Zhang ,&nbsp;Qi Zou","doi":"10.1016/j.neucom.2025.129534","DOIUrl":null,"url":null,"abstract":"<div><div>Constantly varying appearance of targets brings tremendous challenges for visual object tracking, especially in long-term tracking and background interference scenarios. Current leading trackers attempt to introduce multi-level fixed and dynamic templates to encode changing target information and abundant spatiotemporal contexts. These methods achieve astonishing performance improvements. However, dynamic templates are obtained from intermediate frames with high tracking confidence scores. These frames are not manually annotated. Therefore, the accuracy of dynamic templates relies entirely on tracking results. Dynamic templates may contain a large amount of uninformative and irrelevant background noise due to imprecise tracking. Additionally, multiple templates result in increased computational complexity as well. In order to tackle the above problems, a novel tracker dubbed ATPTrack is proposed for efficient end-to-end tracking. ATPTrack combines the initial target information of fixed templates and updated target representations of dynamic templates. Particularly, ATPTrack develops an alternating token trimming method that prunes dynamic templates and search region progressively. After token simplification, target-related information is highlighted in both dynamic templates and search region, which makes it more computationally efficient. Furthermore, a novel similarity ranking module is incorporated into the dynamic template pruning (DTP) block and the search region pruning (SRP) block for selecting the most discriminative target tokens. The DTP and SRP blocks are responsible for efficient trimming of dynamic templates and the search region, separately. The proposed ATPTrack achieves competitive performance on multiple tracking benchmarks. Compared to merely trimming the search region, ATPTrack further reduces the multiply-accumulate operations (MACs) by 11.5 % with negligible performance drop of 0.3 % by alternately pruning dynamic templates and search region.</div></div>","PeriodicalId":19268,"journal":{"name":"Neurocomputing","volume":"625 ","pages":"Article 129534"},"PeriodicalIF":5.5000,"publicationDate":"2025-01-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Neurocomputing","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0925231225002061","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

Constantly varying appearance of targets brings tremendous challenges for visual object tracking, especially in long-term tracking and background interference scenarios. Current leading trackers attempt to introduce multi-level fixed and dynamic templates to encode changing target information and abundant spatiotemporal contexts. These methods achieve astonishing performance improvements. However, dynamic templates are obtained from intermediate frames with high tracking confidence scores. These frames are not manually annotated. Therefore, the accuracy of dynamic templates relies entirely on tracking results. Dynamic templates may contain a large amount of uninformative and irrelevant background noise due to imprecise tracking. Additionally, multiple templates result in increased computational complexity as well. In order to tackle the above problems, a novel tracker dubbed ATPTrack is proposed for efficient end-to-end tracking. ATPTrack combines the initial target information of fixed templates and updated target representations of dynamic templates. Particularly, ATPTrack develops an alternating token trimming method that prunes dynamic templates and search region progressively. After token simplification, target-related information is highlighted in both dynamic templates and search region, which makes it more computationally efficient. Furthermore, a novel similarity ranking module is incorporated into the dynamic template pruning (DTP) block and the search region pruning (SRP) block for selecting the most discriminative target tokens. The DTP and SRP blocks are responsible for efficient trimming of dynamic templates and the search region, separately. The proposed ATPTrack achieves competitive performance on multiple tracking benchmarks. Compared to merely trimming the search region, ATPTrack further reduces the multiply-accumulate operations (MACs) by 11.5 % with negligible performance drop of 0.3 % by alternately pruning dynamic templates and search region.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
求助全文
约1分钟内获得全文 去求助
来源期刊
Neurocomputing
Neurocomputing 工程技术-计算机:人工智能
CiteScore
13.10
自引率
10.00%
发文量
1382
审稿时长
70 days
期刊介绍: Neurocomputing publishes articles describing recent fundamental contributions in the field of neurocomputing. Neurocomputing theory, practice and applications are the essential topics being covered.
期刊最新文献
Editorial Board Trusted Cross-view Completion for incomplete multi-view classification A spatio-frequency cross fusion model for deepfake detection and segmentation Lightweight oriented object detection with Dynamic Smooth Feature Fusion Network Dynamic event-triggering adaptive dynamic programming for robust stabilization of partially unknown nonlinear systems
×
引用
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