Incremental Learning for Robust Visual Tracking
The DOI matches its Crossref record; 41 of the 43 references it cites were found in a registry or an index.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“However, if the target is occluded, the peak in the response map will be smoother, and the relative value of APCE becomes larger [7].”
From Multiple Cues-Based Robust Visual Object Tracking Method (2022) · cites this paper as [7]
In the citing paper
“It has been shown practically that if the target apparently appears in the detection scope, there will be a sharper peak in the response map, and the value of APCE will be smaller.”
From Multiple Cues-Based Robust Visual Object Tracking Method (2022) · cites this paper as [7]
In the citing paper
“This problem is solved by squaring the response map and then finding the confidence of the squared response map [7].”
From Multiple Cues-Based Robust Visual Object Tracking Method (2022) · cites this paper as [7]
In the citing paper
“Although object tracking has been studied for several decades, and much progress has been made in recent years [28, 16, 47, 5, 40, 26, 19], it remains a very challenging problem.”
From Object Tracking Benchmark (2015) · cites this paper as [47]
In the citing paper
“Recently, more tracking source codes have been made publicly available, e.g., the OAB [22], IVT [47], MIL [5], L1 [40], and TLD [31] algorithms, which have been commonly used for evaluation.”
From Object Tracking Benchmark (2015) · cites this paper as [47]
Citations
Cites
Golub, G. (2012) · doi:10.56021/9781421407944 · Cited by 34,505
Advances in neural information processing systems 7
(1996) · Computers & Mathematics with Applications · doi:10.1016/s0898-1221(96)90463-0 · Cited by 14,281
(1981) · Cited by 11,963
Goodall, C. (1988) · Technometrics · doi:10.1080/00401706.1988.10488412 · Cited by 8,675
Jolliffe, I. T. (1986) · Springer Series in Statistics · doi:10.1007/978-1-4757-1904-8 · Cited by 8,273
Cootes, T. F., Edwards, G. J., & Taylor, C. J. (2001) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.927467 · Cited by 5,409
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 6×
“2003) (shown in highlighted ellipse) and the Mean Shift (Comaniciu et al. 2003) (depicted by a green dashed box) on four video sequences”
BackgroundMethodInfluentialProbabilistic Principal Component Analysis
Tipping, M. E., & Bishop, C. M. (1999) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/1467-9868.00196 · Cited by 3,679 · cited 2×
“Since our goal is to use a representation to describe the “thing” that we are tracking, we model image observations using a probabilistic interpretation of principal component analysis (Tipping and Bishop 1999).”
MethodReal-time tracking of non-rigid objects using mean shift
Comaniciu, D., Ramesh, V., & Meer, P. (2002) · Proceedings IEEE Conference on Computer Vision and Pattern Recognition. CVPR 2000 (Cat. No.PR00662) · doi:10.1109/cvpr.2000.854761 · Cited by 2,906 · cited 1×
“Examples abound, ranging from representation methods based on view-based appearance models, [6], contours [17], parametric templates of geometry and illumination [13], integration of shape and color [4], mixture models [5], 3D models [21], exemplars [34], foreground/background models [16] templates with updating [26];…”
Advances in Neural Information Processing Systems 18
Murray, I., Mackay, D., Zoubin Ghahramani, A., & Skilling, J. (2006) · Cited by 1,927
Visual learning and recognition of 3-d objects from appearance
Murase, H., & Nayar, S. K. (1995) · International Journal of Computer Vision · doi:10.1007/bf01421486 · Cited by 1,881 · cited 4×
“Note also that the view-based eigenbasis representation has demonstrated its ability to model the appearance of objects in different poses (Murase and Nayar 1995), and under different lighting conditions (Belhumeur and Kreigman 1997).”
BackgroundMethodInfluentialThe Plenoptic Function and the Elements of Early Vision
Adelson, E. H., & Bergen, J. R. (1991) · Computational Models of Visual Processing · doi:10.7551/mitpress/2002.003.0004 · Cited by 1,515 · cited 2×
“, “stuff” (Adelson and Bergen 1991), and facilitates object recognition.”
BackgroundComputational Models of Visual Processing
(1991) · The MIT Press eBooks · doi:10.7551/mitpress/2002.001.0001 · Cited by 1,073
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 · cited 9×
“To minimize the effect of noisy pixels, we utilize a robust error norm (Black and Jepson 1996), ρ(x, σ ) = x 2 σ 2 +x 2 instead of the Euclidean norm x 2 , to ignore the outliers (i.e., the pixels that are not likely to appear inside the target region given the current eigenbasis).”
MethodInfluentialEM Algorithms for PCA and SPCA
Roweis, S. T. (1997) · neural information processing systems · Cited by 1,018
Robust online appearance models for visual tracking
Jepson, A. D., Fleet, D. J., & El-Maraghi, T. F. (2003) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2003.1233903 · Cited by 922
Contour tracking by stochastic propagation of conditional density
Isard, M., & Blake, A. (1996) · Lecture Notes in Computer Science · doi:10.1007/bfb0015549 · Cited by 869 · cited 10×
“…location at each timestep— as produced by the Kalman filter and its relatives—Isard and Blake introduced particle filters to visual tracking and presented the Condensation algorithm for contour tracking in which multiple plausible interpretations are propagated over time (Isard and Blake 1996).”
BackgroundMethodInfluentialMatthews, L., Ishikawa, T., & Baker, S. (2004) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2004.16 · Cited by 754
Elliptical head tracking using intensity gradients and color histograms
Birchfield, S. (2002) · Proceedings. 1998 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (Cat. No.98CB36231) · doi:10.1109/cvpr.1998.698614 · Cited by 743 · cited 2×
“…contours (Isard and Blake 1996), parametric templates of geometry and illumination (Hager and Belhumeur 1996), integration of shape and color (Birchfield 1998), mixture models (Black et al. 1998), 3D models (La Cascia and Sclaroff 1999), exemplars (Toyama and Blake 2001),…”
MethodIncremental Singular Value Decomposition of Uncertain Data with Missing Values
Brand, M. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-47969-4_47 · Cited by 493 · cited 1×
“Numerous, more-sophisticated algorithms have been developed to efficiently update an eigenbasis as more data arrive (Golub and Van Loan 1996; Hall et al. 1998; Levy and Lindenbaum 2000; Brand 2002).”
MethodEigenTracking: Robust matching and tracking of articulated objects using a view-based representation
Black, M. J., & Jepson, A. D. (1996) · Lecture Notes in Computer Science · doi:10.1007/bfb0015548 · Cited by 410
What is the set of images of an object under all possible lighting conditions?
Belhumeur, P. N., & Kriegman, D. J. (1996) · Proceedings CVPR IEEE Computer Society Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.1996.517085 · Cited by 379
Sequential Karhunen-Loeve basis extraction and its application to images
Levey, A., & Lindenbaum, M. (2000) · IEEE Transactions on Image Processing · doi:10.1109/83.855432 · Cited by 377
Probabilistic visual learning for object detection
Moghaddam, B., & Pentland, A. (2002) · Proceedings of IEEE International Conference on Computer Vision · doi:10.1109/iccv.1995.466858 · Cited by 359 · cited 1×
“This distance formulation, based on a orthonormal subspace and its complement space, is similar to (Moghaddam and Pentland 1995) in spirit.”
BackgroundIncremental Learning for Visual Tracking
Lim, J., Ross, D. A., Lin, R.-S., & Yang, M. (2004) · neural information processing systems · Cited by 313
Self-citationIncremental Eigenanalysis for Classification
Hall, P. M., Marshall, D., & Martin, R. R. (1998) · Procedings of the British Machine Vision Conference 1998 · doi:10.5244/c.12.29 · Cited by 223 · cited 1×
“Numerous, more-sophisticated algorithms have been developed to efficiently update an eigenbasis as more data arrive (Golub and Van Loan 1996; Hall et al. 1998; Levy and Lindenbaum 2000; Brand 2002).”
MethodReal-time tracking of image regions with changes in geometry and illumination
Hager, G. D., & Belhumeur, P. N. (1996) · Proceedings CVPR IEEE Computer Society Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.1996.517104 · Cited by 222 · cited 4×
“…linear subspaces are able to effectively model image variation due to illumination (Belhumeur and Kreigman 1997), Hager and Belhumeur developed a tracking algorithm to handle the appearance variation caused by illumination and pose change using parametric models (Hager and Belhumeur 1996).”
BackgroundMethodInfluentialA Framework for High-Level Feedback to Adaptive, Per-Pixel, Mixture-of-Gaussian Background Models
Harville, M. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-47977-5_36 · Cited by 214
Probabilistic tracking in a metric space
Toyama, K., & Blake, A. (2002) · Proceedings Eighth IEEE International Conference on Computer Vision. ICCV 2001 · doi:10.1109/iccv.2001.937599 · Cited by 197 · cited 2×
“1998), 3D models (La Cascia and Sclaroff 1999), exemplars (Toyama and Blake 2001), foreground/background models (Harville 2002) templates with updating (Matthews et al.”
MethodAvidan, S. (2005) · Proceedings of the 2001 IEEE Computer Society Conference on Computer Vision and Pattern Recognition. CVPR 2001 · doi:10.1109/cvpr.2001.990474 · Cited by 170
Adaptive Probabilistic Visual Tracking with Incremental Subspace Update
Ross, D. A., Lim, J., & Yang, M. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-24671-8_37 · Cited by 129 · cited 1×
“Preliminary results of this paper were presented in Ross et al. (2004) and Lim et al. (2005).”
ResultSelf-citationA sparse probabilistic learning algorithm for real-time tracking
Williams, Blake, & Cipolla (2003) · Proceedings Ninth IEEE International Conference on Computer Vision · doi:10.1109/iccv.2003.1238366 · Cited by 99 · cited 4×
“Along similar lines, Williams et al. developed a method in which an SVM-based regressor was used for tracking (Williams et al. 2003).”
BackgroundMethodInfluentialJoint probabilistic techniques for tracking multi-part objects
Rasmussen, C. E., & Hager, G. D. (2002) · 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.1998.698582 · Cited by 88 · cited 2×
“…updating (Matthews et al. 2004); prediction schemes using particle filters (Isard and Blake 1996), joint probabilistic data association filters (Rasmussen and Hager 1998), kernel-based filters (Comaniciu et al. 2003; Georgescu et al. 2004), support vector machines (Avidan 2001; Williams et al.…”
MethodAdaptive Discriminative Generative Model and Its Applications
Lin, R.-S., Ross, D. A., Lim, J., & Yang, M. (2004) · neural information processing systems · Cited by 87
Self-citationVariational inference for visual tracking
Vermaak, J., Lawrence, N. D., & Pérez, P. (2003) · 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.2003.1211431 · Cited by 87 · cited 1×
“…using particle filters (Isard and Blake 1996), joint probabilistic data association filters (Rasmussen and Hager 1998), kernel-based filters (Comaniciu et al. 2003; Georgescu et al. 2004), support vector machines (Avidan 2001; Williams et al. 2003) and variational inference (Vermaak et al. 2003).”
MethodAdding and subtracting eigenspaces with eigenvalue decomposition and singular value decomposition
Hall, P. M., Marshall, D., & Martin, R. R. (2002) · Image and Vision Computing · doi:10.1016/s0262-8856(02)00114-2 · Cited by 70 · cited 3×
“Substituting our incremental algorithm with that of Hall et al. (2002), which lacks the forgetting factor, also produced an error of 7.70.”
MethodInfluentialA framework for modeling appearance change in image sequences
Black, M. J., Fleet, D. J., & Yacoob, Y. (2002) · IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.1998.710788 · Cited by 67 · cited 3×
“Examples abound, ranging from representation methods based on view-based appearance models (Black and Jepson 1996), contours (Isard and Blake 1996), parametric templates of geometry and illumination (Hager and Belhumeur 1996), integration of shape and color (Birchfield 1998), mixture models (Black et al. 1998), 3D mod…”
MethodInfluentialFast, reliable head tracking under varying illumination
Cascia, M. L., & Sclaroff, S. (2003) · 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.1999.787001 · Cited by 58 · cited 1×
“…and illumination (Hager and Belhumeur 1996), integration of shape and color (Birchfield 1998), mixture models (Black et al. 1998), 3D models (La Cascia and Sclaroff 1999), exemplars (Toyama and Blake 2001), foreground/background models (Harville 2002) templates with updating (Matthews et al.…”
MethodLearning dynamical models using expectation-maximisation
North, B., & Blake, A. (2002) · IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.1998.710747 · Cited by 31 · cited 1×
“More the complex dynamics can be modeled, such as first or second order dynamic systems, as well as other adaptive techniques for specific applications (North and Blake 1998).”
BackgroundFast, Reliable Head Tracking Under Varying Illumination
Cascia, M. L., & Sclaroff, S. (1999) · doi:10.21236/ada366995 · Cited by 24
Multi-Model Component-Based Tracking Using Robust Information Fusion
Georgescu, B., Comaniciu, D., Han, T. X., & Zhou, X. S. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-30212-4_6 · Cited by 10 · cited 4×
“…using particle filters (Isard and Blake 1996), joint probabilistic data association filters (Rasmussen and Hager 1998), kernel-based filters (Comaniciu et al. 2003; Georgescu et al. 2004), support vector machines (Avidan 2001; Williams et al. 2003) and variational inference (Vermaak et al. 2003).”
MethodInfluential
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
“Recently, more tracking source codes have been made publicly available, e.g., the OAB [22], IVT [47], MIL [5], L1 [40], and TLD [31] algorithms, which have been commonly used for evaluation.”
BackgroundMethodSelf-citationVisual object tracking using adaptive correlation filters
Bolme, D., Beveridge, J. R., Draper, B. A., & Lui, Y. M. (2010) · 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2010.5539960 · Cited by 3,406
“Recent examples include: Incremental Visual Tracking (IVT) [17], Robust Fragmentsbased Tracking (FragTrack) [1], Graph Based Discriminative Learning (GBDL) [19], and Multiple Instance Learning (MILTrack) [2].”
BackgroundMethodInfluentialWu, 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
“Effective update algorithms have also been proposed via online mixture model [29], online boosting [22], and incremental subspace update [47].”
BackgroundMethodInfluentialSelf-citationKalal, Z., Mikolajczyk, K., & Matas, J. (2012) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2011.239 · Cited by 3,285
“6.1 Comparison 1: CoGD TLD was compared with results reported in [33] which reports on performance of five trackers (Iterative Visual Tracking (IVT) [22], Online Discriminative Features (ODV) [27], Ensemble Tracking (ET) [28], Multiple Instance Learning (MIL) [30], and Cotrained Generative-Discriminative tracking (CoG…”
BackgroundResultInfluentialLearning 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
“Various generative target appearance modeling algorithms have been proposed including sparse representation [31, 43], density estimation [16, 22], and incremental subspace learning [32].”
Method
Metadata
- Authors
- Ross, D. A., Lim, J., Lin, R.-S., & Yang, M.-H.
- Affiliations
- University of Toronto (CA)
- Honda Research Institute, USA (US)
- Motorola (United States) (US)
- Corresponding author
- Ross, David A.
- Venue
- International Journal of Computer Vision
- Published
- 2007-08-17
- Volume
- 77
- Issue
- 1-3
- Pages
- 125-141
- ISSN
- 0920-5691 (ISSN-L)
- 1573-1405
- OpenAlex
- W2139047213
- Cited by
- 3,061
- References
- 43
- Citations by year
- 2026: 25 · 2025: 47 · 2024: 53 · 2023: 51 · 2022: 83 · 2021: 126 · 2020: 148 · 2019: 244 · 2018: 279 · 2017: 324 · 2016: 340 · 2015: 359 · 2014: 331 · 2013: 214 · 2012: 161
- FWCI
- 66.90
- Type
- journal article
- Language
- en
- Open access
- closed
- Licence
- www.springer.com/tdm (tdm)
- Locations
- International Journal of Computer Vision (publishedVersion)
- Funders
- Honda Research Institute, USA
- Topics
- Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Video Surveillance and Tracking Methods
- Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Advanced Image and Video Retrieval Techniques
- Physical Sciences › Engineering › Automotive Engineering › Autonomous Vehicle Technology and Safety
- Keywords
- visual object tracking, incremental learning, principal component analysis, appearance modeling, forgetting factor, illumination variation, robust tracking
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.