Home ![]() ![]() ![]() |
||||||||
See also: Hierarchical Cluster Analysis, Vertex Component Analysis (VCA), Fuzzy c-Means Clustering
![]() |
||||||||
k-Means Clustering |
||||||||
The k-means clustering algorithm is an unsupervised algorithm which requires a user-defined number of clusters. The cluster analysis is performed using the loaded spectral descriptors, which may be (de)selected on an individual basis by ticking off the corresponding check box in the list of spectral descriptors. The results of the k-means clustering is displayed as a colored map, which can be processed in the usual way (copy to the 2D Imager, copy to the image stack, export to DataLab). Further, a particular class of pixels can be copied into the mask editor, thus enabling the user to exclude these pixels from further calculations. The k-means algorithm is prone to unfavorable initial positions of the cluster prototypes. This can be circumvented by repeating the algorithm with different starting positions several times and finally using the set of starting conditions which result in the smallest intra-cluster distance. If you tick off the check box "Optimize", the k-means model is calculated 20 times, showing the best of these trials.
|