Difference between revisions of "User:NikosA/About Clustering"
From GRASS-Wiki
m (→What is i.cluster?: from the manual) |
m (Various notes) |
||
Line 1: | Line 1: | ||
''Drafting a page about clustering, i.cluster's similarities and differences with other well known clustering algorithms.'' | ''Drafting a page about clustering, i.cluster's similarities and differences with other well known clustering algorithms.'' | ||
+ | |||
+ | === Overview === | ||
+ | |||
+ | * i.cluster is... | ||
=== Basic Definitions === | === Basic Definitions === | ||
− | + | * '''What is clustering?''' Clustering is essentialy groupping objects based on (their) observed similar properties. In the field of digital image classification, the objects are the pixels (or observations) of an image. As per a geospatial compatible terminology, the objects are the cells of a raster map. | |
− | |||
=== What is i.cluster? === | === What is i.cluster? === | ||
Line 21: | Line 24: | ||
* These cluster means and covariance matrices are used in the second pass program i.maxlik to classify the image. | * These cluster means and covariance matrices are used in the second pass program i.maxlik to classify the image. | ||
+ | === What is not... === | ||
+ | |||
+ | * i.cluster is not an implementation of the ISODATA clustering algorithm | ||
+ | |||
+ | === Other Clustering Algorithms === | ||
+ | |||
+ | === Similarities with... === | ||
+ | |||
+ | * i.cluster is a modification of the K-means clustering algorithm | ||
+ | |||
+ | === Differences with... === | ||
+ | |||
+ | i.cluster vs ISODATA | ||
+ | |||
+ | * i.cluster expects at least two input variables (maps), ISODATA operates also on a single variable (map) | ||
+ | * ... | ||
+ | * ... | ||
=== Discussions about i.cluster === | === Discussions about i.cluster === | ||
* http://lists.osgeo.org/pipermail/grass-user/2012-October/066046.html | * http://lists.osgeo.org/pipermail/grass-user/2012-October/066046.html | ||
* http://lists.osgeo.org/pipermail/grass-user/2008-June/045108.html | * http://lists.osgeo.org/pipermail/grass-user/2008-June/045108.html |
Revision as of 18:09, 25 March 2013
Drafting a page about clustering, i.cluster's similarities and differences with other well known clustering algorithms.
Contents
Overview
- i.cluster is...
Basic Definitions
- What is clustering? Clustering is essentialy groupping objects based on (their) observed similar properties. In the field of digital image classification, the objects are the pixels (or observations) of an image. As per a geospatial compatible terminology, the objects are the cells of a raster map.
What is i.cluster?
From the manual
- i.cluster is the program that generates the spectral signatures for the land cover types in the image using a clustering algorithm.
- It results in a signature file that is used as input for the second pass program i.maxlik.
- The clustering algorithm operates by reading through the imagery data and then building pixel clusters based on the spectral reflectances of the pixels.
- The spectral distributions of the clusters (which will be the land cover spectral signatures) are influenced by six parameters set by the user.
- The first parameter set by the user is the initial number of clusters to be discriminated.
- i.cluster starts by generating spectral signatures for this number of clusters and "trys" to end up with this number of clusters during the clustering process.
- The resulting number of clusters and their spectral distributions, however, are also influenced by the range of the spectral values in the image and the other parameters set by the user.
- These parameters are: the minimum cluster size, minimum cluster separation, the percent convergence, the number of iterations, and the row and column sampling interval.
- The cluster spectral signatures that result are composed of cluster means and covariance matrices.
- These cluster means and covariance matrices are used in the second pass program i.maxlik to classify the image.
What is not...
- i.cluster is not an implementation of the ISODATA clustering algorithm
Other Clustering Algorithms
Similarities with...
- i.cluster is a modification of the K-means clustering algorithm
Differences with...
i.cluster vs ISODATA
- i.cluster expects at least two input variables (maps), ISODATA operates also on a single variable (map)
- ...
- ...