Abstract
A new mean-shift technique, blurring mean-shift with a restricted dataset modification, is presented. It is mainly intended for applications in image processing since, in this case, the coordinates of the points entering into the mean-shift procedure may be obviously split into two parts that are treated in different ways: The spatial part (geometrical position in image) and the range part (colour/brightness). The basic principle is similar as in the blurring mean-shift algorithm. In contrast to it, the changes of the dataset are restricted only to the range values (colour/brightness); the spatial parts do not change. The points that are processed during computation may be viewed as points of a certain image that evolves during the iterations. We show that the process converges. As a result, an image is obtained with the areas of constant colour/brightness, which can be exploited for image filtering and segmentation. The geodesic as well as Euclidean distance can be used. The results of testing are presented showing that the algorithm is useful.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
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., Meer, P.: Mean shift: A robust approach toward feature space analysis. IEEE Transactions on Pattern Analysis and Machine Intelligence 24, 603–619 (2002)
Comaniciu, D., Ramesh, V., Meer, P.: Kernel-based object tracking. IEEE Transactions on Pattern Analysis and Machine Intelligence 25, 564–577 (2003)
Barash, D., Comaniciu, D.: A common framework for nonlinear diffusion, adaptive smoothing, bilateral filtering and mean shift. Image and Video Computing 22, 73–81 (2004)
Carreira-Perpiňán, M.A.: Fast nonparametric clustering with Gaussian blurring mean-shift. In: Airoldi, E.M., Blei, D.M., Fienberg, S.E., Goldenberg, A., Xing, E.P., Zheng, A.X. (eds.) ICML 2006. LNCS, vol. 4503, pp. 153–160. Springer, Heidelberg (2006)
Sheikh, Y.A., Khan, E.A., Kanade, T.: Mode-seeking by medoidshifts. In: IEEE International Conference on Computer Vision, pp. 1–8 (2007)
Vedaldi, A., Soatto, S.: Quick shift and kernel methods for mode seeking. In: Forsyth, D., Torr, P., Zisserman, A. (eds.) ECCV 2008, Part IV. LNCS, vol. 5305, pp. 705–718. Springer, Heidelberg (2008)
Christoudias, C.M., Georgescu, B., Meer, P.: Synergism in low level vision. In: International Conference on Pattern Recognition, pp. 150–155 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sojka, E., Gaura, J., Šrubař, Š., Fabián, T., Krumnikl, M. (2010). Blurring Mean-Shift with a Restricted Data-Set Modification for Applications in Image Processing. In: Bebis, G., et al. Advances in Visual Computing. ISVC 2010. Lecture Notes in Computer Science, vol 6455. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17277-9_32
Download citation
DOI: https://doi.org/10.1007/978-3-642-17277-9_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-17276-2
Online ISBN: 978-3-642-17277-9
eBook Packages: Computer ScienceComputer Science (R0)