SIA OpenIR  > 机器人学研究室
Dynamic and reliable subtask tracker with general schatten p-norm regularization
Fan BJ(范保杰)1; Cong Y(丛杨)2; Tian JD(田建东)2; Tang YD(唐延东)2
Indexed BySCI
WOS IDWOS:000691542900002
Contribution Rank2
Funding OrganizationNational Natural Science Foundation of ChinaNational Natural Science Foundation of China (NSFC) [U2013210, 61876092] ; State key Laboratory of Robotics [2019-O07] ; State key Laboratory of Integrated Service Network [ISN20-08]
KeywordReliable multi-subtask tracking Weighted schatten p-norm Hyper-graph regularization Decision-evaluation strategy

Some multi-task trackers adopt an inaccurate shrink strategy to treat different rank components equally. Thus, their flexibility is vulnerable to some tracking challenges. To resolve this problem, we propose a spatial-aware reliable multi-subtask tracker via weighted Schatten p-norm regularization (SLRT-W), which dynamically chooses the suitable and reliable subset of the whole subtasks for tracking. Its major merits not only assign the flexible weights to different subtask rank components depending on their tracking contribution, but also preserve consistent spatial layout structure and correspondence of layered multisubtask. Specifically, multiple layered subtasks correspond to different tar get subregions, they are cooperative and complement. A weighted Schatten p-norm is introduced to adaptively shrink different multisubtask rank components, and emphasize important components as reliable ones. Then, a structured hyper-graph regularized term simultaneously exploits the intrinsic geometry correspondence among multiple layers of subtasks, and spatial layout structure inside each layer. We devise an alternatively generalized iterated shrinkage method to optimize the multi-subtask Schatten p-norm minimization. Finally, a robust decision-evaluation strategy is developed to choose the reliable multi-subtask tracking combination. Encouraging results on some challenging benchmarks demonstrate the proposed tracker performs favorably in robustness and accuracy, against some state-of-the-art trackers. (c) 2021 Elsevier Ltd. All rights reserved.

WOS SubjectComputer Science, Artificial Intelligence ; Engineering, Electrical & Electronic
WOS Research AreaComputer Science ; Engineering
Funding ProjectNational Natural Science Foundation of China[U2013210] ; National Natural Science Foundation of China[61876092] ; State key Laboratory of Robotics[2019-O07] ; State key Laboratory of Integrated Service Network[ISN20-08]
Citation statistics
Document Type期刊论文
Corresponding AuthorTian JD(田建东)
Affiliation1.Automation College, Nanjing University of Posts and Telecommunications, China
2.State Key Laboratory of Robotics, Shenyang Institute of Automation, Chinese Academy of Sciences, China
Recommended Citation
GB/T 7714
Fan BJ,Cong Y,Tian JD,et al. Dynamic and reliable subtask tracker with general schatten p-norm regularization[J]. PATTERN RECOGNITION,2021,120:1-14.
APA Fan BJ,Cong Y,Tian JD,&Tang YD.(2021).Dynamic and reliable subtask tracker with general schatten p-norm regularization.PATTERN RECOGNITION,120,1-14.
MLA Fan BJ,et al."Dynamic and reliable subtask tracker with general schatten p-norm regularization".PATTERN RECOGNITION 120(2021):1-14.
Files in This Item:
File Name/Size DocType Version Access License
Dynamic and reliable(6418KB)期刊论文出版稿开放获取CC BY-NC-SAView Application Full Text
Related Services
Recommend this item
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Fan BJ(范保杰)]'s Articles
[Cong Y(丛杨)]'s Articles
[Tian JD(田建东)]'s Articles
Baidu academic
Similar articles in Baidu academic
[Fan BJ(范保杰)]'s Articles
[Cong Y(丛杨)]'s Articles
[Tian JD(田建东)]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Fan BJ(范保杰)]'s Articles
[Cong Y(丛杨)]'s Articles
[Tian JD(田建东)]'s Articles
Terms of Use
No data!
Social Bookmark/Share
File name: Dynamic and reliable subtask tracker with general schatten p-norm regularization.pdf
Format: Adobe PDF
All comments (0)
No comment.

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.