.png){kind=icon}
.png){kind=icon}
Return
RGBT tracking based on cooperative low-rank graph model
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neucom.2022.04.032.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The existing graph-based RGBT tracking methods mainly focus on assigning a weight to each local image patch to suppress background influence in target bounding box, but the influences of background clutter might limit the improvement of tracking performance. To solve this problem, we propose a new algorithm, called cooperative low-rank graph model, to suppress background clutter. Specifically, the proposed feature decomposition module decomposes input dual-modal features into low-rank components and sparse noisy components, which could be used collaboratively by regularizing graph learning by combining modal weights. Besides, to avoid SVD (Singular Value Decomposition) operations we have designed an efficient solver based on ADMM (Alternating Direction Methods of Multipliers), which could factorize the low-rank matrix into two low-dimensional submatrices. Extensive experiments on four RGBT tracking benchmark data sets show that our method performs favorably against other stateof-the-art tracking algorithms, and achieves more robust tracking performance. (c) 2022 Elsevier B.V. All rights reserved.
Keywords:
Object tracking
Computer vision
Graph structure
Coefficient matrix
RGBT tracking
Journal
IF:
6.5
Papers:
2.5W
Citations:
6.5W