Skip to main content

Rek-Means: A k-Means Based Clustering Algorithm

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5008))

Abstract

In this paper we present a new clustering method based on k-means that has been implemented on a video surveillance system. Rek-means does not require to specify in advance the number of clusters to search for and is more precise than k-means in clustering data coming from multiple Gaussian distributions with different co-variances, while maintaining real-time performance. Experiments on real and synthetic datasets are presented to measure the effectiveness and the performance of the proposed method.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Jain, A.K., Murty, M.N., Flynn, P.J.: Data Clustering: A Review. ACM Computing Surveys 31(3), 264–323 (1999)

    Article  Google Scholar 

  2. Orlowska, M.E., Sun, X., Li, X.: Can exclusive clustering on streaming data be achieved? SIGKDD Explorations 8(2), 102–108 (2006)

    Article  Google Scholar 

  3. Bloisi, D., Iocchi, L., Leone, G.R., Pigliacampo, R., Tombolini, L., Novelli, L.: A Distributed Vision System for Boat Traffic Monitoring in the Venice Grand Canal. In: VISAPP 2007, pp. 549–556 (2007)

    Google Scholar 

  4. MacQueen, J.B.: Some Methods for classification and Analysis of Multivariate Observations. In: Proceedings of 5-th Berkeley Symposium on Mathematical Statistics and Probability, vol. 1, pp. 281–297. University of California Press, Berkeley (1967)

    Google Scholar 

  5. Chakravarti, Laha, Roy,: Handbook of Methods of Applied Statistics, vol. I, pp. 392–394. John Wiley and Sons, Chichester (1967)

    MATH  Google Scholar 

  6. Kullback, S., Leibler, R.A.: On information and sufficiency. Royal Astronomical Society, Monthly Notices 202, 79–86 (1983)

    Google Scholar 

  7. Peacock, J.A.: Two-dimensional goodness-of-fit testing in astronomy. Annals of Mathematical Statistics 22, 615–627 (1951)

    Google Scholar 

  8. Fasano, G., Franceschini, A.: A Multidimensional Version Of The Kolmogorov-Smirnov Test. Monthly Notices of the Royal Astronomical Society 225, 155–170 (1987)

    Google Scholar 

  9. Lopes, R.H., Reid, I., Hobson, P.R.: The two-dimensional Kolmogorov-Smirnov test. In: XI International Workshop on Advanced Computing and Analysis Techniques in Physics Research (2007)

    Google Scholar 

  10. Anderson, T.W., Darling, D.A.: Asymptotic theory of certain ”goodness-of-fit” criteria based on stochastic processes. Annals of Mathematical Statistics 23, 193–212 (1952)

    Article  MathSciNet  Google Scholar 

  11. Stephens, M.A.: EDF Statistics for Goodness of Fit and Some Comparisons. Journal of the American Statistical Association 69, 730–737 (1974)

    Article  Google Scholar 

  12. Hamerly, G., Elkan, C.: Learning the k in k-means. In: Proceedings of the seventeenth annual conference on neural information processing systems (NIPS), pp. 281–288 (2003)

    Google Scholar 

  13. Open Computer Vision Library (OpenCV): http://opencvlibrary.sourceforge.net/

  14. Arthur, D., Vassilvitskii, S.: How slow is the k-means method? In: Symposium on Computational Geometry, pp. 144–153 (2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Antonios Gasteratos Markus Vincze John K. Tsotsos

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bloisi, D.D., Iocchi, L. (2008). Rek-Means: A k-Means Based Clustering Algorithm. In: Gasteratos, A., Vincze, M., Tsotsos, J.K. (eds) Computer Vision Systems. ICVS 2008. Lecture Notes in Computer Science, vol 5008. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-79547-6_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-79547-6_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-79546-9

  • Online ISBN: 978-3-540-79547-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics