Evolving Mean Shift with Adaptive Bandwidth: A Fast and Noise Robust Approach
This paper presents a novel nonparametric clustering algorithm called evolving mean shift (EMS) algorithm. The algorithm iteratively shrinks a dataset and generates well formed clusters in just a couple of iterations. An energy function is defined to characterize the compactness of a dataset and we prove that the energy converges to zero at an exponential rate. The EMS is insensitive to noise as it automatically handles noisy data at an early stage. The single but critical user parameter, i.e., the kernel bandwidth, of the mean shift clustering family is adaptively updated to accommodate the evolving data density and alleviate the contradiction between global and local features. The algorithm has been applied and tested with image segmentation and neural spike sorting, where the improved accuracy can be obtained at a much faster performance, as demonstrated both qualitatively and quantitatively.
KeywordsShift Algorithm Bandwidth Estimation Epanechnikov Kernel Mean Shift Kernel Bandwidth
Unable to display preview. Download preview PDF.
- 3.Comaniciu, D., Ramesh, V., Meer, P.: The variable bandwidth mean shift and data-driven scale selection. In: IEEE International Conference on Computer Vision, vol. I, pp. 438–445 (2001)Google Scholar
- 6.Carreira-perpinan, M.: Fast nonparametric clustering with gaussian blurring mean-shift. In: International Conference on Machine Learning, pp. 153–160 (2006)Google Scholar
- 7.Yang, Z., Zhao, Q., Liu, W.: Spike feature extraction using informative samples. In: Advances in Neural Information Processing Systems, pp. 1865–1872 (2009)Google Scholar