The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
Robust visual tracking via multi-task sparse learning
Abstract
In this paper, we formulate object tracking in a particle filter framework as a multi-task sparse learning problem, which we denote as Multi-Task Tracking (MTT). Since we model particles as linear combinations of dictionary templates that are updated dynamically, learning the representation of each particle is considered a single task in MTT. By employing popular sparsity-inducing ℓp, qmixed norms (p ∈ {2, ∞} and q = 1), we regularize the representation problem to enforce joint sparsity and learn the particle representations together. As compared to previous methods that handle particles independently, our results demonstrate that mining the interdependencies between particles improves tracking performance and overall computational complexity. Interestingly, we show that the popular L1tracker [15] is a special case of our MTT formulation (denoted as the L11tracker) when p = q = 1. The learning problem can be efficiently solved using an Accelerated Proximal Gradient (APG) method that yields a sequence of closed form updates. As such, MTT is computationally attractive. We test our proposed approach on challenging sequences involving heavy occlusion, drastic illumination changes, and large pose variations. Experimental results show that MTT methods consistently outperform state-of-the-art trackers.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Sequential Monte Carlo Methods in Practice
(2001) · Springer eBooks · doi:10.1007/978-1-4757-3437-9 · Cited by 7,366
Stable signal recovery from incomplete and inaccurate measurements
Candès, E. J., Romberg, J. K., & Tao, T. (2006) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.20124 · Cited by 7,036
CONDENSATION—Conditional Density Propagation for Visual Tracking
Isard, M., & Blake, A. (1998) · International Journal of Computer Vision · doi:10.1023/a:1008078328650 · Cited by 4,886
Yilmaz, A., Javed, O., & Shah, M. (2006) · ACM Computing Surveys · doi:10.1145/1177352.1177355 · Cited by 4,792
Comaniciu, D., Ramesh, V., & Meer, P. (2003) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2003.1195991 · Cited by 4,560
Incremental Learning for Robust Visual Tracking
Ross, D. A., Lim, J., Lin, R.-S., & Yang, M.-H. (2008) · International Journal of Computer Vision · doi:10.1007/s11263-007-0075-7 · Cited by 3,061
Visual tracking with online Multiple Instance Learning
Babenko, B., Yang, M.-H., & Belongie, S. (2009) · 2009 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2009.5206737 · Cited by 1,770
Robust Fragments-based Tracking using the Integral Histogram
Adam, A., Rivlin, E., & Shimshoni, I. (2006) · 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1 (CVPR'06) · doi:10.1109/cvpr.2006.256 · Cited by 1,397
Real-Time Tracking via On-line Boosting
Grabner, H., Grabner, M., & Bischof, H. (2006) · Procedings of the British Machine Vision Conference 2006 · doi:10.5244/c.20.6 · Cited by 1,198
Kwon, J., & Lee, K. M. (2010) · 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2010.5539821 · Cited by 1,164
EigenTracking: Robust Matching and Tracking of Articulated Objects Using a View-Based Representation
Black, M. J., & Jepson, A. D. (1998) · International Journal of Computer Vision · doi:10.1023/a:1007939232436 · Cited by 1,029
Gradient methods for minimizing composite objective function
Nesterov, Y. E. (2007) · Cited by 867
Robust Visual Tracking and Vehicle Classification via Sparse Representation
Mei, X., & Ling, H. (2011) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2011.66 · Cited by 840
RASL: Robust Alignment by Sparse and Low-Rank Decomposition for Linearly Correlated Images
Peng, Y., Ganesh, A., Wright, J., Xu, W., & Ma, Y. (2012) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2011.282 · Cited by 817
Avidan, S. (2005) · 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) · doi:10.1109/cvpr.2005.144 · Cited by 320
Fast multiple object tracking via a hierarchical particle filter
Yang, C., Duraiswami, R., & Davis, L. (2005) · Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1 · doi:10.1109/iccv.2005.95 · Cited by 307
Visual classification with multi-task joint sparse representation
Yuan, X.-T., & Yan, S. (2010) · 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2010.5539967 · Cited by 303
RASL: Robust alignment by sparse and low-rank decomposition for linearly correlated images
Peng, Y., Ganesh, A., Wright, J., Xu, W., & Ma, Y. (2010) · 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2010.5540138 · Cited by 242
Robust and Fast Collaborative Tracking with Two Stage Sparse Optimization
Liu, B., Yang, L., Huang, J., Meer, P., Gong, L., & Kulikowski, C. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-15561-1_45 · Cited by 216
Accelerated Gradient Method for Multi-task Sparse Learning Problem
Chen, X., Pan, W., Kwok, J. T., & Carbonell, J. G. (2009) · 2009 Ninth IEEE International Conference on Data Mining · doi:10.1109/icdm.2009.128 · Cited by 176
An efficient projection for l 1 , ∞ regularization
Quattoni, A., Carreras, X., Collins, M., & Darrell, T. (2009) · International Conference on Machine Learning · doi:10.1145/1553374.1553484 · Cited by 113
Cited by
Online Object Tracking: A Benchmark
Wu, Y., Lim, J., & Yang, M.-H. (2013) · 2013 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2013.312 · Cited by 4,138
Wu, Y., Lim, J., & Yang, M.-H. (2015) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2014.2388226 · Cited by 3,371
A Survey on Multi-Task Learning
Zhang, Y., & Yang, Q. (2017) · arXiv · doi:10.48550/arxiv.1707.08114 · Cited by 2,910
Learning Multi-domain Convolutional Neural Networks for Visual Tracking
Nam, H., & Han, B. (2016) · 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2016.465 · Cited by 2,806
GOT-10k: A Large High-Diversity Benchmark for Generic Object Tracking in the Wild
Huang, L., Zhao, X., & Huang, K. (2021) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2019.2957464 · Cited by 1,809
Metadata
- Authors
- Zhang, T., Ghanem, B., Liu, S., & Ahuja, N.
- Venue
- 2012 IEEE Conference on Computer Vision and Pattern Recognition
- Publisher
- IEEE
- Published
- 2012-06
- Pages
- 2042-2049
- ISSN
- 1063-6919 (ISSN-L)
- OpenAlex
- W2158917775
- Cited by
- 647
- References
- 21
- FWCI
- 50.37
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.