Name
Abstract | ||
|---|---|---|
Clustering is central to many image processing and remote sensing applications. ISODATA is one of the most popular and widely used clustering methods in geoscience applications, but it can run slowly, particularly with large data sets. We present a more efficient approach to ISODATA clustering, which achieves better running times by storing the points in a kd-tree and through a modification of the way in which the algorithm estimates the dispersion of each cluster. We also present an approximate version of the algorithm which allows the user to further improve the running time, at the expense of lower fidelity in computing the nearest cluster center to each point. We provide both theoretical and empirical justification that our modified approach produces clusterings that are very similar to those produced by the standard ISODATA approach. We also provide empirical studies on both synthetic data and remotely sensed Landsat and MODIS images that show that our approach has significantly lower running times. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1142/S0218195907002252 | INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS |
Keywords | DocType | Volume |
clustering, ISODATA, k-means, filtering algorithm, kd-trees, approximation | Journal | 17 |
Issue | ISSN | Citations |
1 | 0218-1959 | 19 |
PageRank | References | Authors |
1.63 | 23 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nargess Memarsadeghi | 1 | 33 | 7.70 |
| David M. Mount | 2 | 4222 | 479.94 |
| Nathan S. Netanyahu | 3 | 2786 | 287.17 |
| Jacqueline Le Moigne | 4 | 253 | 32.19 |