CoChat

Structural Sparse Tracking

Zhang, Tianzhu, Liu, Si, Xu, Changsheng, Shuicheng Yan, Ghanem, Bernard, Ahuja, Narendra, Yang, Ming-Hsuan · 2015 · 2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)
Cited by 171

The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.

Abstract

Sparse representation has been applied to visual tracking by finding the best target candidate with minimal reconstruction error by use of target templates. However, most sparse representation based trackers only consider holistic or local representations and do not make full use of the intrinsic structure among and inside target candidates, thereby making the representation less effective when similar objects appear or under occlusion. In this paper, we propose a novel Structural Sparse Tracking (SST) algorithm, which not only exploits the intrinsic relationship among target candidates and their local patches to learn their sparse representations jointly, but also preserves the spatial layout structure among the local patches inside each target candidate. We show that our SST algorithm accommodates most existing sparse trackers with the respective merits. Both qualitative and quantitative evaluations on challenging benchmark image sequences demonstrate that the proposed SST algorithm performs favorably against several state-of-the-art methods.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/cvpr.2015.7298610

Cites

6 of 6 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

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

  • Kernel-based object tracking

    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 · cited 2×

    “In contrast, generative tracking methods typically learn a model to represent the target object and then use it to search for the image region with minimal reconstruction error [5, 7, 14, 1, 25, 31, 18].”
    BackgroundMethod
  • 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

    Self-citation
  • 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 · cited 10×

    “These algorithms are the online multiple instance learning (MIL) [3], online Adabost boosting (OAB) [9], tracking by detection (TLD) [16], Struck [11], circulant structure tracking (CST) [12], part-based visual tracking (PT) [32], real time compressive tracking (RTCT) [34] , 1 tracking ( 1 T) [22] , local sparse track…”
    BackgroundMethodInfluentialSelf-citation
  • Exploiting the Circulant Structure of Tracking-by-Detection with Kernels

    Henriques, J. F., Caseiro, R., Martins, P., & Batista, J. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-33765-9_50 · Cited by 2,310 · cited 10×

    “Other trackers experience drift at different time instances (Frag at frame 40, 1 T at frame 132, DFT at frame 135, MIL and CST at frame 144, other trackers at frame 177 due to the occlusion).”
    BackgroundInfluential
  • 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 · cited 10×

    “The OAB, 1 T and LGT algorithms drift at frame 100, 246 and 276, respectively.”
    BackgroundMethodInfluential
  • Partial Occlusion Handling for Visual Tracking via Robust Part Matching

    Zhang, T., Jia, K., Xu, C., Ma, Y., & Ahuja, N. (2014) · 2014 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2014.164 · Cited by 117 · cited 1×

    “Recently, sparse representation based generative tracking methods have been developed for object tracking [21, 20, 19, 23, 22, 34, 37, 36, 4, 15, 13, 39, 42, 41, 29].”
    BackgroundSelf-citation

Show all 6 references

Cited by

Metadata

Authors
Zhang, T., Liu, S., Xu, C., Yan, S., Ghanem, B., Ahuja, N., & Yang, M.-H.
Venue
2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)
Publisher
IEEE
Published
2015-06
Pages
150-158
ISSN
1063-6919 (ISSN-L)
OpenAlex
W1960880753
Cited by
171
References
6
FWCI
17.18
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.