2016
DOI: 10.1016/j.neucom.2016.03.100
|View full text |Cite
|
Sign up to set email alerts
|

Generalized ℓP-regularized representation for visual tracking

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2017
2017
2022
2022

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 8 publications
(1 citation statement)
references
References 26 publications
0
1
0
Order By: Relevance
“…The target localization problem was assumed to be an L1 norm-related minimization problem and was resolved using convex optimization. The method was further improved [ 33 ] by proposing an lp regularization model. The lp regularization model was minimized using the accelerated proximal gradient approach, which ensured rapid convergence and less average tracking errors as compared to its predecessors [ 34 ].…”
Section: Introductionmentioning
confidence: 99%
“…The target localization problem was assumed to be an L1 norm-related minimization problem and was resolved using convex optimization. The method was further improved [ 33 ] by proposing an lp regularization model. The lp regularization model was minimized using the accelerated proximal gradient approach, which ensured rapid convergence and less average tracking errors as compared to its predecessors [ 34 ].…”
Section: Introductionmentioning
confidence: 99%