Abstract
Mean shift is an iterative mode-seeking algorithm widely used in pattern recognition and computer vision. However, its convergence is sometimes too slow to be practical. In this paper, we improve the convergence speed of mean shift by dynamically updating the sample set during the iterations, and the resultant procedure is called dynamic mean shift (DMS). When the data is locally Gaussian, it can be shown that both the standard and dynamic mean shift algorithms converge to the same optimal solution. However, while standard mean shift only has linear convergence, the dynamic mean shift algorithm has superlinear convergence. Experiments on color image segmentation show that dynamic mean shift produces comparable results as the standard mean shift algorithm, but can significantly reduce the number of iterations for convergence and takes much less time.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Fukunaga, K., Hostetler, L.: The estimation of the gradient of a density function, with applications in pattern recognition. IEEE Transactions on Information Theory 21, 32–40 (1975)
Cheng, Y.: Mean shift, mode seeking, and clustering. IEEE Transactions on Pattern Analysis and Machine Intelligence 17, 790–799 (1995)
Comaniciu, D.: An algorithm for data-driven bandwidth selection. IEEE Transactions on Pattern Analysis and Machine Intelligence 25, 281–288 (2003)
Georgescu, B., Shimshoni, I., Meer, P.: Mean shift based clustering in high dimensions: A texture classification example. In: Proceedings of the International Conference on Computer Vision, pp. 456–463 (2003)
Comaniciu, D., Meer, P.: The variable bandwidth mean shift and data driven scale selection. In: Proc. ICCV, pp. 438–445 (2001)
Comaniciu, D., Meer, P.: Mean shift: A robust approach towards feature space analysis. IEEE Transactions on Pattern Analysis and Machine Intelligence 24, 603–619 (2002)
Zivkovic, Z., Kröse, B.: An EM-like algorithm for color-histogram-based object tracking. In: Proceedings of the International Conference on Computer Vision and Pattern Recognition, vol. 1, pp. 798–803 (2004)
DeMenthon, D., Doermann, D.: Video retrieval using spatio-temporal descriptors pages. In: Proceedings of the Eleventh ACM International Conference on Multimedia, pp. 508–517 (2003)
Yang, C., Duraiswami, R., DeMenthon, D., Davis, L.: Mean-shift analysis using quasi-Newton methods. In: Proceedings of the International Conference on Image Processing, vol. 3, pp. 447–450 (2003)
Fashing, M., Tomasi, C.: Mean shift is a bound optimization. IEEE Transactions on Pattern Analysis and Machine Intelligence 27, 471–474 (2005)
Stoker, T.: Smoothing bias in density derivative estimation. Journal of the American Statistical Association 88, 855–863 (1993)
Comaniciu, D., Meer, P.: Distribution free decomposition of multivariate data. Pattern Analysis and Applications 2, 22–30 (1999)
Zhang, K., Tang, M., Kwok, J.T.: Applying neighborhood consistency for fast clustering and kernel density estimation. In: Proceedings of the International Conference on Computer Vision and Pattern Recognition, pp. 1001–1007 (2005)
Fletcher, R.: Practical Methods of Optimization. Wiley, New York (1987)
Noble, B., Daniel, J.: Applied Linear Algebra, 3rd edn. Prentice-Hall, Englewood Cliffs (1988)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhang, K., Kwok, J.T., Tang, M. (2006). Accelerated Convergence Using Dynamic Mean Shift. In: Leonardis, A., Bischof, H., Pinz, A. (eds) Computer Vision – ECCV 2006. ECCV 2006. Lecture Notes in Computer Science, vol 3952. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11744047_20
Download citation
DOI: https://doi.org/10.1007/11744047_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-33834-5
Online ISBN: 978-3-540-33835-2
eBook Packages: Computer ScienceComputer Science (R0)