Share Email Print

Proceedings Paper

K-means clustering algorithm using entropy
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

The problem of unsupervised clustering of data is formulated using a Bayesian inference. The entropy is considered to define a prior. In clustering problem we have to reduce the complexity of the gray level description. Therefore we minimize the entropy associated with the clustering histogram. This enables us to overcome the problem of defining a priori the number of clusters and an initialization of their centers. Under the assumption of a normal distribution of data the proposed clustering method reduces to a deterministic algorithm (very fast) which appears to be an extension of the standard k-means clustering algorithm. Our model depends on a parameter weighting the prior term and the goodness of fit term. This hyper-parameter allows us to define the coarseness of the clustering and is data independent. Heuristic argument is proposed to estimate this parameter. The new clustering approach was successfully tested on a database of 65 magnetic resonance images and remote sensing images.

Paper Details

Date Published: 4 December 1998
PDF: 9 pages
Proc. SPIE 3500, Image and Signal Processing for Remote Sensing IV, (4 December 1998); doi: 10.1117/12.331894
Show Author Affiliations
Gintautas Palubinskas, DLR (Germany)

Published in SPIE Proceedings Vol. 3500:
Image and Signal Processing for Remote Sensing IV
Sebastiano Bruno Serpico, Editor(s)

© SPIE. Terms of Use
Back to Top