Abstract: Nearest neighborhood consistency is an important concept in statistical pattern recognition, which underlies the well-known $k$-nearest neighbor method. In this paper, we combine this idea with kernel density estimation based clustering, and derive the fast mean shift algorithm (FMS). FMS greatly reduces the complexity of feature space analysis, resulting satisfactory precision of classification. More importantly, we show that with FMS algorithm, we are in fact relying on a conceptually novel approach of density estimation, the fast kernel density estimation (FKDE) for clustering. The FKDE combines smooth and non-smooth estimators and thus inherits advantages from both. Asymptotic analysis reveals the approximation of the FKDE to standard kernel density estimator. Data clustering and image segmentation experiments demonstrate the efficiency of FMS.
Proceedings of the International Conference on Computer Vision and Pattern Recognition (CVPR 2005), pp.1001-1007, San Diego, CA, USA, June 2005.
Pdf: http://www.cs.ust.hk/~jamesk/papers/cvpr05.pdf