Evolving Mean Shift with Adaptive Bandwidth: A Fast and Noise Robust Approach

  • Qi Zhao
  • Zhi Yang
  • Hai Tao
  • Wentai Liu
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5994)

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Cheng, Y.: Mean shift, mode seeking, and clustering. IEEE Transactions on Pattern Analysis and Machine Intelligence 17(8), 790–799 (1995)CrossRefGoogle Scholar
  2. 2.
    Comaniciu, D., Meer, P.: Mean shift: a robust approach toward feature space analysis. IEEE Transactions on Pattern Analysis and Machine Intelligence 24(5), 603–619 (2002)CrossRefGoogle Scholar
  3. 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
  4. 4.
    Hall, P., Hui, T., Marron, J.: Improved variable window kernel estimate of probability densities. The Annals of Statistics 23(1), 1–10 (1995)MATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Comaniciu, D.: An algorithm for data-driven bandwidth selection. IEEE Transactions on Pattern Analysis and Machine Intelligence 25(2), 281–288 (2003)CrossRefGoogle Scholar
  6. 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. 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
  8. 8.
    Quian Quiroga, R., Nadasdy, Z., Ben-Shaul, Y.: Unsupervised spike detection and sorting with wavelets and superparamagnetic clustering. Neural Computation 16(8), 1661–1687 (2004)MATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Qi Zhao
    • 1
  • Zhi Yang
    • 1
  • Hai Tao
    • 1
  • Wentai Liu
    • 1
  1. 1.School of EngineeringUniversity of California at Santa CruzSanta Cruz

Personalised recommendations