Mean shift

Machine learning and data mining

Problems
Classification Clustering Regression Anomaly detection Association rules Reinforcement learning Structured prediction Feature engineering Feature learning Online learning Semi-supervised learning Unsupervised learning Learning to rank Grammar induction
Supervised learning (classification • regression)
Decision trees Ensembles (Bagging, Boosting, Random forest) k-NN Linear regression Naive Bayes Neural networks Logistic regression Perceptron Relevance vector machine (RVM) Support vector machine (SVM)
Clustering
BIRCH Hierarchical k-means Expectation-maximization (EM) DBSCAN OPTICS Mean-shift
Dimensionality reduction
Factor analysis CCA ICA LDA NMF PCA t-SNE
Structured prediction
Graphical models (Bayes net, CRF, HMM)
Anomaly detection
k-NN Local outlier factor
Neural nets
Autoencoder Deep learning Multilayer perceptron RNN Restricted Boltzmann machine SOM Convolutional neural network
Theory
Bias-variance dilemma Computational learning theory Empirical risk minimization Occam learning PAC learning Statistical learning VC theory
Machine learning venues
NIPS ICML JMLR ArXiv:cs.LG
Data mining venues
KDD ICDM SDM
Machine learning portal

Mean shift is a non-parametric feature-space analysis technique for locating the maxima of a density function, a so-called mode-seeking algorithm.^[1] Application domains include cluster analysis in computer vision and image processing.^[2]

History

The mean shift procedure was originally presented in 1975 by Fukunaga and Hostetler.^[3]

Overview

Mean shift is a procedure for locating the maxima of a density function given discrete data sampled from that function.^[1] It is useful for detecting the modes of this density.^[1] This is an iterative method, and we start with an initial estimate $x$ . Let a kernel function $K(x_i - x)$ be given. This function determines the weight of nearby points for re-estimation of the mean. Typically a Gaussian kernel on the distance to the current estimate is used, $K(x_i - x) = e^{-c||x_i - x||^2}$ . The weighted mean of the density in the window determined by $K$

$m(x) = \frac{ \sum_{x_i \in N(x)} K(x_i - x) x_i } {\sum_{x_i \in N(x)} K(x_i - x)}$

where $N(x)$ is the neighborhood of $x$ , a set of points for which $K(x) \neq 0$ .

The difference $m(x) - x$ is called mean shift in Fukunaga and Hostetler.^[3] The mean-shift algorithm now sets $x \leftarrow m(x)$ , and repeats the estimation until $m(x)$ converges.

Although the mean shift algorithm has been widely used in many applications, a rigid proof for the convergence of the algorithm using a general kernel in a high dimensional space is still missing.^[4] Aliyari Ghassabeh showed the convergence of the mean shift algorithm in one-dimension with a differentiable, convex, and strictly decreasing profile function.^[5] However, the one-dimensional case has limited real world applications. Also, the convergence of the algorithm in higher dimensions with a finite number of the (or isolated) stationary points has been proved.^[4]^[6] However, a sufficient condition for a general kernel function to have finite (or isolated) stationary points have not been provided.

Details

Let data be a finite set S embedded in the n-dimensional Euclidean space, X. Let K be a flat kernel that is the characteristic function of the $\lambda$ -ball in X,

$K(x) = \begin{cases} 1 & \text{if}\ \|x\| \le \lambda\\ 0 & \text{if}\ \|x\| > \lambda\\ \end{cases}$

In each iteration of the algorithm, $s \leftarrow m(s)$ is performed for all $s \in S$ simultaneously. The first question, then, is how to estimate the density function given a sparse set of samples. One of the simplest approaches is to just smooth the data, e.g., by convolving it with a fixed kernel of width $h$ ,

$f(x) = \sum_{i}K(x - x_i) = \sum_{i}k \left(\frac{\|x - x_i\|^2}{h^2}\right)$

where $x_i$ are the input samples and $k(r)$ is the kernel function (or Parzen window). h is the only parameter in the algorithm and is called the bandwidth. This approach is known as kernel density estimation or the Parzen window technique. Once we have computed $f(x)$ from equation above, we can find its local maxima using gradient ascent or some other optimization technique. The problem with this "brute force" approach is that, for higher dimensions, it becomes computationally prohibitive to evaluate $f(x)$ over the complete search space. Instead, mean shift uses a variant of what is known in the optimization literature as multiple restart gradient descent. Starting at some guess for a local maximum, $y_k$ , which can be a random input data point $x_1$ , mean shift computes the gradient of the density estimate $f(x)$ at $y_k$ and takes an uphill step in that direction.

Types of kernels

Kernel definition: Let X be the n-dimensional Euclidean space, $R^n$ . Denote the ith component of x by $x_i$ . The norm of x is a non-negative number. $\|x\|^2=x^Tx$ A function K: $X\leftarrow R$ is said to be a kernel if there exists a profile, $k: [0, \infty]\rightarrow R$ , such that

$K(x) = k(\|x\|^2)$ and

k is non-negative.
k is nonincreasing: $k(a)\ge k(b)$ if $a < b$ .
k is piecewise continuous and $\int_0^\infty k(r)\,dr < \infty\$

The two frequently used kernel profiles for mean shift are:

Flat kernel

$k(x) = \begin{cases} 1 & \text{if}\ x \le \lambda\\ 0 & \text{if}\ x > \lambda\\ \end{cases}$

Gaussian kernel

$k(x) = e^{-\frac{\|x\|^2}{2 \sigma^2}},$

where the standard deviation parameter $\sigma$ works as the bandwidth parameter, $h$ .

Applications

Clustering

Consider a set of points in two-dimensional space. Assume a circular window centered at C and having radius r as the kernel. Mean shift is a hill climbing algorithm which involves shifting this kernel iteratively to a higher density region until convergence. Every shift is defined by a mean shift vector. The mean shift vector always points toward the direction of the maximum increase in the density. At every iteration the kernel is shifted to the centroid or the mean of the points within it. The method of calculating this mean depends on the choice of the kernel. In this case if a Gaussian kernel is chosen instead of a flat kernel, then every point will first be assigned a weight which will decay exponentially as the distance from the kernel's center increases. At convergence, there will be no direction at which a shift can accommodate more points inside the kernel.

Tracking

The mean shift algorithm can be used for visual tracking. The simplest such algorithm would create a confidence map in the new image based on the color histogram of the object in the previous image, and use mean shift to find the peak of a confidence map near the object's old position. The confidence map is a probability density function on the new image, assigning each pixel of the new image a probability, which is the probability of the pixel color occurring in the object in the previous image. A few algorithms, such as ensemble tracking,^[7] CAMshift,^[8] expand on this idea.

Smoothing

Let $x_i$ and $z_i, i = 1,...,n,$ be the d-dimensional input and filtered image pixels in the joint spatial-range domain. For each pixel,

Initialize $j = 1$ and $y_{i,1} = x_i$
Compute $y_{i,j+1}$ according to $m(\cdot)$ until convergence, $y = y_{i,c}$ .
Assign $z_i =(x_i^s,y_{i,c}^r)$ . The superscripts s and r denote the spatial and range components of a vector, respectively. The assignment specifies that the filtered data at the spatial location axis will have the range component of the point of convergence $y_{i,c}^r$ .

Strengths

Mean shift is an application-independent tool suitable for real data analysis.
Does not assume any predefined shape on data clusters.
It is capable of handling arbitrary feature spaces.
The procedure relies on choice of a single parameter: bandwidth.
The bandwidth/window size 'h' has a physical meaning, unlike k-means.

Weaknesses

The selection of a window size is not trivial.
Inappropriate window size can cause modes to be merged, or generate additional “shallow” modes.
Often requires using adaptive window size.

References

1 2 3 Cheng, Yizong (August 1995). "Mean Shift, Mode Seeking, and Clustering". IEEE Transactions on Pattern Analysis and Machine Intelligence (IEEE) 17 (8): 790–799. doi:10.1109/34.400568.
↑ Comaniciu, Dorin; Peter Meer (May 2002). "Mean Shift: A Robust Approach Toward Feature Space Analysis". IEEE Transactions on Pattern Analysis and Machine Intelligence (IEEE) 24 (5): 603–619. doi:10.1109/34.1000236. |access-date= requires |url= (help)
1 2 Fukunaga, Keinosuke; Larry D. Hostetler (January 1975). "The Estimation of the Gradient of a Density Function, with Applications in Pattern Recognition". IEEE Transactions on Information Theory (IEEE) 21 (1): 32–40. doi:10.1109/TIT.1975.1055330. Retrieved 2008-02-29.
1 2 Aliyari Ghassabeh, Youness (2015-03-01). "A sufficient condition for the convergence of the mean shift algorithm with Gaussian kernel". Journal of Multivariate Analysis 135: 1–10. doi:10.1016/j.jmva.2014.11.009.
↑ Aliyari Ghassabeh, Youness (2013-09-01). "On the convergence of the mean shift algorithm in the one-dimensional space". Pattern Recognition Letters 34 (12): 1423–1427. doi:10.1016/j.patrec.2013.05.004.
↑ Li, Xiangru; Hu, Zhanyi; Wu, Fuchao (2007-06-01). "A note on the convergence of the mean shift". Pattern Recognition 40 (6): 1756–1762. doi:10.1016/j.patcog.2006.10.016.
↑ Avidan, Shai (2005). "Ensemble Tracking". 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) (San Diego, California: IEEE) 2. ISBN 0-7695-2372-2.
↑ Emami, Ebrahim (2013). "Online failure detection and correction for CAMShift tracking algorithm". 2013 Iranian Conference on Machine Vision and Image Processing (MVIP) (IEEE) 2: 180–183.

External links

Code implementations

Aiphial. Java-based mean-shift implementation for numeric data clustering and image segmentation.
ImageJ. Image filtering using the mean shift filter.
Mahout. An map-reduce based implementation of MeanShift clustering written on Apache Hadoop.
OpenCV contains mean-shift implementation via cvMeanShift Method
Orfeo toolbox. A C++ implementation.
Scikit-learn Numpy/Python implementation uses ball tree for efficient neighboring points lookup

Short lessons

Lesson from Prof. M. Shah on this topic on YouTube

This article is issued from Wikipedia - version of the Friday, October 23, 2015. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.