The DOI matches its Crossref record; 37 of the 37 references it cites were found in a registry or an index.
Efficient Mean-Shift Tracking via a New Similarity Measure
Abstract
The mean shift algorithm has achieved considerable success in object tracking due to its simplicity and robustness. It finds local minima of a similarity measure between the color histograms or kernel density estimates of the model and target image. The most typically used similarity measures are the Bhattacharyya coefficient or the Kullback-Leibler divergence. In practice, these approaches face three difficulties. First, the spatial information of the target is lost when the color histogram is employed, which precludes the application of more elaborate motion models. Second, the classical similarity measures are not very discriminative. Third, the sample-based classical similarity measures require a calculation that is quadratic in the number of samples, making real-time performance difficult. To deal with these difficulties we propose a new, simple-to-compute and more discriminative similarity measure in spatial-feature spaces. The new similarity measure allows the mean shift algorithm to track more general motion models in an integrated way. To reduce the complexity of the computation to linear order we employ the recently proposed improved fast Gauss transform. This leads to a very efficient and robust nonparametric spatial-feature tracking algorithm. The algorithm is tested on several image sequences and shown to achieve robust and reliable frame-rate tracking.
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
(2012) · Encyclopedia of the Sciences of Learning · doi:10.1007/978-1-4419-1428-6_5195 · Cited by 19,370
(1981) · Cited by 11,963
Mean shift: a robust approach toward feature space analysis
Comaniciu, D., & Meer, P. (2002) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.1000236 · Cited by 11,305
On Estimation of a Probability Density Function and Mode
Parzen, E. (1962) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177704472 · Cited by 10,585
Russell, E. L., Chiang, L. H., & Braatz, R. D. (2000) · Advances in Industrial Control · doi:10.1007/978-1-4471-0409-4_3 · Cited by 7,862
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
Pfinder: real-time tracking of the human body
Wren, C. R., Azarbayejani, A., Darrell, T., & Pentland, A. P. (1997) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.598236 · Cited by 4,169
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
(1986) · Cited by 3,616
Lucas-Kanade 20 Years On: A Unifying Framework
Baker, S., & Matthews, I. (2004) · International Journal of Computer Vision · doi:10.1023/b:visi.0000011205.11775.fd · Cited by 3,155
The estimation of the gradient of a density function, with applications in pattern recognition
Fukunaga, K., & Hostetler, L. (1975) · IEEE Transactions on Information Theory · doi:10.1109/tit.1975.1055330 · Cited by 3,043
Devijver, P. A., & Kittler, J. (1982) · Prentice-Hall International eBooks · Cited by 2,910
Alignment by Maximization of Mutual Information
Viola, P., & Wells III, W. M. (1997) · International Journal of Computer Vision · doi:10.1023/a:1007958904918 · Cited by 2,610
Statistical Pattern Recognition
(2001) · Computational Statistics Handbook with MATLAB · doi:10.1201/9781420035636-10 · Cited by 1,740
Statistical Pattern Recognition
Webb, A. R. (2002) · Wiley eBooks · doi:10.1002/0470854774 · Cited by 1,459
Computer Vision Face Tracking For Use in a Perceptual User Interface
Gary, R. B. (1998) · Cited by 1,400
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
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
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
Mean-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
Yang, J., & Waibel, A. (2002) · Proceedings Third IEEE Workshop on Applications of Computer Vision. WACV'96 · doi:10.1109/acv.1996.572043 · Cited by 517
Greengard, L., & Strain, J. (1991) · SIAM Journal on Scientific and Statistical Computing · doi:10.1137/0912004 · Cited by 491
Improved fast gauss transform and efficient kernel density estimation
Yang, Duraiswami, Gumerov, & Davis (2003) · Proceedings Ninth IEEE International Conference on Computer Vision · doi:10.1109/iccv.2003.1238383 · Cited by 399
Cheung, K. M. G., Baker, S., & Kanade, T. (2003) · 2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2003. Proceedings. · doi:10.1109/cvpr.2003.1211340 · Cited by 326
The softassign Procrustes matching algorithm
Rangarajan, A., Chui, H., & Bookstein, F. L. (1997) · Lecture Notes in Computer Science · doi:10.1007/3-540-63046-5_3 · Cited by 282
Kinematic jump processes for monocular 3D human tracking
Sminchisescu, C., & Triggs, B. (2003) · 2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2003. Proceedings. · doi:10.1109/cvpr.2003.1211339 · Cited by 270
Applications of entropic spanning graphs
Hero, A. O., Ma, B., Michel, O. J. J., & Gorman, J. (2002) · IEEE Signal Processing Magazine · doi:10.1109/msp.2002.1028355 · Cited by 266
Multiple kernel tracking with SSD
Hager, G. D., Dewan, M., & Stewart, C. V. (2004) · Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2004. CVPR 2004. · doi:10.1109/cvpr.2004.1315112 · Cited by 260
Color-based tracking of heads and other mobile objects at video frame rates
Fieguth, P., & Terzopoulos, D. (2002) · Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.1997.609292 · Cited by 242
Classification with nonmetric distances: image retrieval and class representation
Jacobs, D. W., Weinshall, D., & Gdalyahu, Y. (2000) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.862197 · Cited by 210
Nearest Neighbors in High-Dimensional Spaces
Indyk, P. (2004) · Discrete Mathematics and Its Applications · doi:10.1201/9781420035315.ch39 · Cited by 207
Probabilistic tracking in joint feature-spatial spaces
Elgammal, A., Duraiswami, R., & Davis, L. S. (2003) · 2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2003. Proceedings. · doi:10.1109/cvpr.2003.1211432 · Cited by 170
Self-citationAvidan, 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
The quality of training sample estimates of the Bhattacharyya coefficient
Djouadi, A., Snorrason, O., & Garber, F. D. (1990) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.41388 · Cited by 105
A sparse probabilistic learning algorithm for real-time tracking
Williams, Blake, & Cipolla, R. (2003) · IEEE International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2003.1238366 · Cited by 99
Incremental density approximation and kernel-based Bayesian filtering for object tracking
Han, B., Comaniciu, D., Zhu, Y., & Davis, L. S. (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.1315092 · Cited by 72
Self-citationClustering appearances of 3D objects
Basri, R., Roth, D., & Jacobs, D. W. (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.698639 · Cited by 34
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
A survey of appearance models in visual object tracking
Li, X., Hu, W., Shen, C., Zhang, Z., Dick, A., & Hengel, A. V. D. (2013) · ACM Transactions on Intelligent Systems and Technology · doi:10.1145/2508037.2508039 · Cited by 705
Object tracking using SIFT features and mean shift
Zhou, H., Yuan, Y., & Shi, C. (2009) · Computer Vision and Image Understanding · doi:10.1016/j.cviu.2008.08.006 · Cited by 599
Liu, T., & Liu, Y. (2021) · IEEE Access · doi:10.1109/access.2021.3091871 · Cited by 7
Metadata
- Authors
- Yang, C., Duraiswami, R., & Davis, L.
- Venue
- 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05)
- Publisher
- IEEE
- Published
- 2005-07-27
- Volume
- 1
- Pages
- 176-183
- ISSN
- 1063-6919 (ISSN-L)
- OpenAlex
- W2165096258
- Cited by
- 313
- References
- 37
- FWCI
- 14.07
- 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.