2018
DOI: 10.3390/rs10040510
|View full text |Cite
|
Sign up to set email alerts
|

Total Variation Regularization Term-Based Low-Rank and Sparse Matrix Representation Model for Infrared Moving Target Tracking

Abstract: Infrared moving target tracking plays a fundamental role in many burgeoning research areas of Smart City. Challenges in developing a suitable tracker for infrared images are particularly caused by pose variation, occlusion, and noise. In order to overcome these adverse interferences, a total variation regularization term-based low-rank and sparse matrix representation (TV-LRSMR) model is designed in order to exploit a robust infrared moving target tracker in this paper. First of all, the observation matrix tha… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
18
0

Year Published

2018
2018
2022
2022

Publication Types

Select...
8
1

Relationship

2
7

Authors

Journals

citations
Cited by 31 publications
(18 citation statements)
references
References 42 publications
(49 reference statements)
0
18
0
Order By: Relevance
“…e proposed model contains an optimization problem: the objective function includes the nuclear norm, ℓ 1 norm, and total variation norm and is solved by ADMM. For the proposed method, the computational complexities of updating the variables Z 1 , Z 2 , Z 3x , Z 3y , B, and T in (12), (15), (19), (20), (22), and (24) for each iteration are O(mn 2 ), O(mn), O(mn), O(mn), O(mn), and O(mn), respectively. erefore, the total cost of each iteration for the proposed method is O(mn 2 ) operations.…”
Section: Computational Complexity and Computation Time Of Thementioning
confidence: 99%
See 1 more Smart Citation
“…e proposed model contains an optimization problem: the objective function includes the nuclear norm, ℓ 1 norm, and total variation norm and is solved by ADMM. For the proposed method, the computational complexities of updating the variables Z 1 , Z 2 , Z 3x , Z 3y , B, and T in (12), (15), (19), (20), (22), and (24) for each iteration are O(mn 2 ), O(mn), O(mn), O(mn), O(mn), and O(mn), respectively. erefore, the total cost of each iteration for the proposed method is O(mn 2 ) operations.…”
Section: Computational Complexity and Computation Time Of Thementioning
confidence: 99%
“…A large number of methods have been developed to address the issues of small target detection. ese methods can be roughly classified into two categories: single-frame detection [5][6][7][8][9][10][11][12][13][14][15][16] and sequential multiframe detection [17][18][19]. Recently, Gao et al [17] employed the mixture of the Gaussians model [20] with the Markov random field to model the complex noise of which the target is assumed as a component.…”
Section: Introductionmentioning
confidence: 99%
“…Low-rank decomposition (LRD) techniques 30 can divide an image matrix into two parts: low-rank matrix and sparse matrix, where the low-rank matrix indicates a smooth background and the sparse matrix indicates the salient regions. It has been successfully used in a variety of applications, such as subspace segmentation, 31 visual tracking, 32,33 image clustering, 34 and video backgroundforeground separation. 35,36 Shen and Wu 37 provided a unified framework for integrating high-level knowledge and low-level features, which is based on the assumption that an image could be represented as the sum of the background being low rank and the salient regions being sparse.…”
Section: Introductionmentioning
confidence: 99%
“…The goal of Multi-Object Tracking (MOT) in airborne videos is to estimate the state of multiple objects and conserving their identities given variations in appearance and motion over time [1][2][3][4]. MOT is challenging due to the uncertain motion of airborne vehicles, the vibration of non-stationary cameras and the partial occlusions of objects [5].…”
Section: Introductionmentioning
confidence: 99%