Automatic histogram-based initialization of K-means clustering in CT

Informatik aktuell

Volumn , Issue , 2013, Pages 277-282

  Tian, Mengqiu ^a,b   Yang, Qiao ^a,b   Maier, Andreas ^b   Schasiepen, Ingo ^a   Maass, Nicole ^a   Elter, Matthias ^a  

^a SIEMENS AG   (Germany)

^b UNIVERSITY OF ERLANGEN NUREMBERG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTERIZED TOMOGRAPHY; GRAPHIC METHODS; IMAGE PROCESSING; IMAGE SEGMENTATION;

CLUSTERING CENTROID; GROUND TRUTH; HIGH-EFFICIENCY; HISTOGRAM ANALYSIS; K-MEANS CLUSTERING; K-MEANS INITIALIZATIONS; POOR PERFORMANCE; SEGMENTATION RESULTS;

CLUSTERING ALGORITHMS;

EID: 84923770420     PISSN: 1431472X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-642-36480-8_49     Document Type: Conference Paper

References (6)

1. MacQueen J. Some methods for classification and analysis of multivariate observations. Proc BSMSP. 1967;1:281–97.
2. 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.
3. 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.
4. Otsu N. A threshold Selection method from gray-level histograms. IEEE Trans Syst Man Cybern. 1979;SMC-9:62–6.
5. Liao PS, Chen TS, Chung PC. A fast algorithm for multilevel thresholding. J Inf Sci Eng. 2001;17:713–27.
6. 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.