The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
Multiple kernel tracking with SSD
Abstract
Kernel-based objective functions optimized using the mean shift algorithm have been demonstrated as an effective means of tracking in video sequences. The resulting algorithms combine the robustness and invariance properties afforded by traditional density-based measures of image similarity, while connecting these techniques to continuous optimization algorithms. This paper demonstrates a connection between kernel-based algorithms and more traditional template tracking methods. here is a well known equivalence between the kernel-based objective function and an SSD-like measure on kernel-modulated histograms. It is shown that under suitable conditions, the SSD-like measure can be optimized using Newton-style iterations. This method of optimization is more efficient (requires fewer steps to converge) than mean shift and makes fewer assumptions on the form of the underlying kernel structure. In addition, the methods naturally extend to objective functions optimizing more elaborate parametric motion models based on multiple spatially distributed kernels. We demonstrate multi-kernel methods on a variety of examples ranging from tracking of unstructured objects in image sequences to stereo tracking of structured objects to compute full 3D spatial location.
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
A Computational Approach to Edge Detection
Canny, J. (1986) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1986.4767851 · Cited by 30,004
Shi, J., & Tomasi (1994) · Proceedings of IEEE Conference on Computer Vision and Pattern Recognition CVPR-94 · doi:10.1109/cvpr.1994.323794 · Cited by 7,724
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
Mean shift, mode seeking, and clustering
Cheng, Y. (1995) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.400568 · Cited by 3,856
Wand, M. P., & Jones, M. C. (1995) · Springer eBooks · doi:10.1007/978-1-4899-4493-1 · Cited by 2,663
A Computational Approach to Edge Detection
CANNY, J. (1987) · Readings in Computer Vision · doi:10.1016/b978-0-08-051581-6.50024-6 · Cited by 2,275
The Divergence and Bhattacharyya Distance Measures in Signal Selection
Kailath, T. (1967) · IEEE Transactions on Communications · doi:10.1109/tcom.1967.1089532 · Cited by 1,856
Efficient region tracking with parametric models of geometry and illumination
Hager, G. D., & Belhumeur, P. N. (1998) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.722606 · Cited by 1,066
Self-citationMean-shift blob tracking through scale space
Collins, R. T. (2003) · 2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2003. Proceedings. · doi:10.1109/cvpr.2003.1211475 · Cited by 793
Linear Algebra and its Applications
(1980) · Elsevier eBooks · doi:10.1016/c2013-0-11558-9 · Cited by 753
Equivalence and efficiency of image alignment algorithms
Baker, S., & Matthews, I. (2005) · Proceedings of the 2001 IEEE Computer Society Conference on Computer Vision and Pattern Recognition. CVPR 2001 · doi:10.1109/cvpr.2001.990652 · Cited by 406
Decision Rules, Based on the Distance, for Problems of Fit, Two Samples, and Estimation
Matusita, K. (1955) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177728422 · Cited by 309
Cited by
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
Objective comparison of particle tracking methods
Chenouard, N., Smal, I., de Chaumont, F., Maška, M., Sbalzarini, I. F., Gong, Y., Cardinale, J., Carthel, C., Coraluppi, S., Winter, M., et al. (2014) · Nature Methods · doi:10.1038/nmeth.2808 · Cited by 894
Distribution fields for tracking
Sevilla-Lara, L., & Learned-Miller, E. (2012) · 2012 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2012.6247891 · Cited by 513
Face tracking and recognition with visual constraints in real-world videos
Kim, M., Kumar, S., Pavlovic, V., & Rowley, H. (2008) · 2008 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2008.4587572 · Cited by 439
Spatiograms versus Histograms for Region-Based Tracking
Birchfield, S. T., & Rangarajan, S. (2005) · 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) · doi:10.1109/cvpr.2005.330 · Cited by 397
Metadata
- Authors
- Hager, G. D., Dewan, M., & Stewart, C. V.
- Venue
- Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2004. CVPR 2004.
- Publisher
- IEEE
- Published
- 2004-11-12
- Volume
- 1
- Pages
- 790-797
- ISSN
- 1063-6919 (ISSN-L)
- OpenAlex
- W2159686856
- Cited by
- 260
- References
- 12
- FWCI
- 10.02
- 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.