Mean-Shift Algorithm

AKA: Mean Shift.
See: Non-Parametric, Feature Space, Density Function, Mode (Statistics), Cluster Analysis, Computer Vision, Image Processing.

References

(Wikipedia, 2015) ⇒ http://en.wikipedia.org/wiki/Mean_shift Retrieved:2015-1-16.
- Mean shift is a non-parametric feature-space analysis technique for locating the maxima of a density function, a so-called mode-seeking algorithm. Application domains include cluster analysis in computer vision and image processing.

(Comaniciu & Meer, 2002) ⇒ Dorin Comaniciu, and Peter Meer. (2002). “Mean Shift: A robust approach toward feature space analysis.” In: IEEE Transactions on Pattern Analysis and Machine Intelligence, 24(5).
- ABSTRACT: A general non-parametric technique is proposed for the analysis of a complex multimodal feature space and to delineate arbitrarily shaped clusters in it. The basic computational module of the technique is an old pattern recognition procedure: the mean shift. For discrete data, we prove the convergence of a recursive mean shift procedure to the nearest stationary point of the underlying density function and, thus, its utility in detecting the modes of the density. The relation of the mean shift procedure to the Nadaraya-Watson estimator from kernel regression and the robust M-estimators; of location is also established. Algorithms for two low-level vision tasks discontinuity-preserving smoothing and image segmentation - are described as applications. In these algorithms, the only user-set parameter is the resolution of the analysis, and either gray-level or color images are accepted as input. Extensive experimental results illustrate their excellent performance