Skip to main content

Automatic Histogram-Based Initialization of K-Means Clustering in CT

  • Conference paper
  • First Online:
Bildverarbeitung für die Medizin 2013

Part of the book series: Informatik aktuell ((INFORMAT))

Zusammenfassung

K-means clustering [1] has been widely used in various applications. One intrinsic limitation in K-means clustering is that the choice of initial clustering centroids may highly influence the performance of the algorithm. Some existing K-means initialization algorithms could generally achieve good results. However, in certain cases, such as CT images that contain several materials with similar gray-levels, such existing initialization algorithms will lead to poor performance in distinguishing those materials. We propose an automatic K-means initialization algorithm based on histogram analysis, which manages to overcome the aforementioned deficiency. Results demonstrate that our method achieves high efficiency in terms of finding starting points close to ground truth so that offers reliable segmentation results for CT images in aforementioned situation.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 79.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 89.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • MacQueen J. Some methods for classification and analysis of multivariate observations. Proc BSMSP. 1967;1:281–97.

    Google Scholar 

  • Robinson F, Apon A, Brewer D, et al. Initial starting point analysis for K-means clustering: a case study. Proc ALAR Conference on Applied Research in Information Technology. 2006.

    Google Scholar 

  • Pena JM, Lozano JA, Larranaga P. An empirical comparison of four initialization methods for the K-Means algorithm. Pattern Recognit Lett. 1999;20:1027–40.

    Google Scholar 

  • Otsu N. A threshold Selection method from gray-level histograms. IEEE Trans Syst Man Cybern. 1979;SMC-9:62–6.

    Google Scholar 

  • Liao PS, Chen TS, Chung PC. A fast algorithm for multilevel thresholding. J Inf Sci Eng. 2001;17:713–27.

    Google Scholar 

  • Huang X, Acero A, Hon HW. Spoken language processing: a guide to theory, algorithm, and system development. 1st ed. Upper Saddle River, NJ, USA: Prentice Hall PTR; 2001.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Mengqiu Tian .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tian, M., Yang, Q., Maier, A., Schasiepen, I., Maass, N., Elter, M. (2013). Automatic Histogram-Based Initialization of K-Means Clustering in CT. In: Meinzer, HP., Deserno, T., Handels, H., Tolxdorff, T. (eds) Bildverarbeitung für die Medizin 2013. Informatik aktuell. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-36480-8_49

Download citation

Publish with us

Policies and ethics