The DOI matches its Crossref record; 29 of the 29 references it cites were found in a registry or an index.
Robust tracking using local sparse appearance model and K-selection
Abstract
Online learned tracking is widely used for it's adaptive ability to handle appearance changes. However, it introduces potential drifting problems due to the accumulation of errors during the self-updating, especially for occluded scenarios. The recent literature demonstrates that appropriate combinations of trackers can help balance stability and flexibility requirements. We have developed a robust tracking algorithm using a local sparse appearance model (SPT). A static sparse dictionary and a dynamically online updated basis distribution model the target appearance. A novel sparse representation-based voting map and sparse constraint regularized mean-shift support the robust object tracking. Besides these contributions, we also introduce a new dictionary learning algorithm with a locally constrained sparse representation, called K-Selection. Based on a set of comprehensive experiments, our algorithm has demonstrated better performance than alternatives reported in the recent literature.
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
Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
Tropp, J. A., & Gilbert, A. C. (2007) · IEEE Transactions on Information Theory · doi:10.1109/tit.2007.909108 · Cited by 9,653
$rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
Aharon, M., Elad, M., & Bruckstein, A. (2006) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2006.881199 · Cited by 9,451
Robust Face Recognition via Sparse Representation
Wright, J., Yang, A. Y., Ganesh, A., Sastry, S. S., & Ma, Y. (2009) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2008.79 · Cited by 9,388
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
Locality-constrained Linear Coding for image classification
Wang, J., Yang, J., Yu, K., Lv, F., Huang, T., & Gong, Y. (2010) · 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2010.5540018 · Cited by 3,100 · cited 1×
“Thus, a faster approximate LLC can be derived by solving a smaller linear system B containing the k nearest neighbors of x [23]. minˆα ||x − B ˆ α|| 2 , s.t.1 T ˆ α = 1 (4) The sparse solution of Eqn.”
BackgroundIncremental 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
Online dictionary learning for sparse coding
Mairal, J., Bach, F., Ponce, J., & Sapiro, G. (2009) · Proceedings of the 26th Annual International Conference on Machine Learning · doi:10.1145/1553374.1553463 · Cited by 2,114
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
Active Appearance Models Revisited
Matthews, I., & Baker, S. (2004) · International Journal of Computer Vision · doi:10.1023/b:visi.0000029666.37597.d3 · Cited by 1,535
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
Avidan, S. (2007) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2007.35 · Cited by 1,112
Semi-supervised On-Line Boosting for Robust Tracking
Grabner, H., Leistner, C., & Bischof, H. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-88682-2_19 · Cited by 1,089
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
Grabner, H., & Bischof, H. (2006) · 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1 (CVPR'06) · doi:10.1109/cvpr.2006.215 · Cited by 979
Dictionary Learning Algorithms for Sparse Representation
Kreutz-Delgado, K., Murray, J. F., Rao, B. D., Engan, K., Lee, T.-W., & Sejnowski, T. J. (2003) · Neural Computation · doi:10.1162/089976603762552951 · Cited by 838
(2009) · doi:10.1109/iccv.2009.5459292 · Cited by 779
Matthews, L., Ishikawa, T., & Baker, S. (2004) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2004.16 · Cited by 754
Visual tracking and recognition using appearance-adaptive models in particle filters
Zhou, S. K., Chellappa, R., & Moghaddam, B. (2004) · IEEE Transactions on Image Processing · doi:10.1109/tip.2004.836152 · Cited by 668 · cited 1×
“The generative models formulate the tracking problem as searching for the regions with the highest likelihood [5] [7] [16] [18] [19] [25] [28] [15], either using a single appearance model or multiple appearance models [27].”
MethodVisual 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/cvprw.2009.5206737 · Cited by 637
Covariance Tracking using Model Update Based on Lie Algebra
Porikli, F., Tuzel, O., & Meer, P. (2006) · 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1 (CVPR'06) · doi:10.1109/cvpr.2006.94 · Cited by 562
Robust tracking-by-detection using a detector confidence particle filter
Breitenstein, M. D., Reichlin, F., Leibe, B., Koller-Meier, E., & Van Gool, L. (2009) · 2009 IEEE 12th International Conference on Computer Vision · doi:10.1109/iccv.2009.5459278 · Cited by 545
PROST: Parallel robust online simple tracking
Santner, J., Leistner, C., Saffari, A., Pock, T., & Bischof, H. (2010) · 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2010.5540145 · Cited by 377
Online Tracking and Reacquisition Using Co-trained Generative and Discriminative Trackers
Yu, Q., Dinh, T. B., & Medioni, G. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-88688-4_50 · Cited by 219
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
Self-citationDiscriminatively trained particle filters for complex multi-object tracking
Hess, R., & Fern, A. (2009) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.2009.5206801 · Cited by 117
Learning to track with multiple observers
Stenger, B., Woodley, T., & Cipolla, R. (2009) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.2009.5206634 · Cited by 67
Yang, L., Georgescu, B., Zheng, Y., Meer, P., & Comaniciu, D. (2008) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.2008.4587518 · Cited by 65
Self-citationA probabilistic framework for combining tracking algorithms
Leichter, I., Lindenbaum, M., & Rivlin, E. (2004) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.2004.1315198 · Cited by 42
Probabilistic Visual Tracking via Robust Template Matching and Incremental Subspace Update
Mei, X., Zhou, S. K., & Porikli, F. (2007) · IEEE International Conference on Multimedia and Expo (ICME) · doi:10.1109/icme.2007.4285026 · Cited by 19
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
Adaptive Color Attributes for Real-Time Visual Tracking
Danelljan, M., Khan, F. S., Felsberg, M., & Van De Weijer, J. (2014) · 2014 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2014.143 · Cited by 1,500
A Scale Adaptive Kernel Correlation Filter Tracker with Feature Integration
Li, Y., & Zhu, J. (2015) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-16181-5_18 · Cited by 1,396
Discriminative Scale Space Tracking
Danelljan, M., Hager, G., Khan, F. S., & Felsberg, M. (2017) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2016.2609928 · Cited by 1,315
Metadata
- Authors
- Liu, B., Huang, J., Yang, L., & Kulikowsk, C.
- Venue
- CVPR 2011
- Publisher
- IEEE
- Published
- 2011-06
- Pages
- 1313-1320
- OpenAlex
- W2066513304
- Cited by
- 485
- References
- 29
- FWCI
- 30.13
- 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.