2008
DOI: 10.1080/01431160701442146
|View full text |Cite
|
Sign up to set email alerts
|

An unsupervised method of classifying remotely sensed images using Kohonen self‐organizing maps and agglomerative hierarchical clustering methods

Abstract: Unlike conventional unsupervised classification methods, such as K-means and ISODATA, which are based on partitional clustering techniques, the methodology proposed in this work attempts to take advantage of the properties of Kohonen's self-organizing map (SOM) together with agglomerative hierarchical clustering methods to perform the automatic classification of remotely sensed images. The key point of the proposed method is to execute the cluster analysis process by means of a set of SOM prototypes, instead o… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
39
0
2

Year Published

2010
2010
2023
2023

Publication Types

Select...
5
3
1

Relationship

0
9

Authors

Journals

citations
Cited by 76 publications
(41 citation statements)
references
References 83 publications
0
39
0
2
Order By: Relevance
“…Of particular interest would be comparison/fusion with algorithms such as self-organizing maps (Kohonen, 1997) that address efficiently high dimensionality problems and have already found fruitful ground in remote sensing (e.g., Hong et al, 2006;Goncalves et al, 2008). In addition, integration with methodologies that deal more naturally with multi-class problems without the SVM complexity may further advance SVM understanding, for example a learning vector quantization system (Schneider et al, 2009).…”
Section: Discussion and Concluding Remarksmentioning
confidence: 98%
“…Of particular interest would be comparison/fusion with algorithms such as self-organizing maps (Kohonen, 1997) that address efficiently high dimensionality problems and have already found fruitful ground in remote sensing (e.g., Hong et al, 2006;Goncalves et al, 2008). In addition, integration with methodologies that deal more naturally with multi-class problems without the SVM complexity may further advance SVM understanding, for example a learning vector quantization system (Schneider et al, 2009).…”
Section: Discussion and Concluding Remarksmentioning
confidence: 98%
“…The data-driven algorithm belongs to the group of unsupervised artificial neural networks and can handle non-linear relationships and non-Gaussian data distributions [47]. SOMs get trained by competitive learning and are perfectly suited for hyperspectral data analysis, as they outperform most unsupervised algorithms ( [3,48,49]). …”
Section: Unsupervised Clustering By Kohonen Self-organizing Mapsmentioning
confidence: 99%
“…Each resulting neuron cluster is a sub-graph that defines complex and non-parametric geometries in the input space, which approximately describes the shape of the clusters. Regarding the last approach, Gonçalves et al (2008) present improvements of contiguity-constrained hierarchical clustering approaches using validation indexes. Some works apply clustering algorithms over the U-matrix to segment the map in well defined regions.…”
Section: Self-organizing Mapsmentioning
confidence: 99%
“…A host of strategies for cluster detection using the U-matrix were proposed in the literature (Costa & Andrade Netto, 2001a;Costa & Andrade Netto, 2003). Three main algorithms were presented: mathematical morphology derived map segmentation (Costa & Andrade Netto, 2001b); a graph partitioning approach (Costa & Andrade Netto, 2003) and contiguityconstrained hierarchical clustering approaches (Gonçalves et al, 2008;Murtagh, 1995). Both algorithms were developed for automatic partitioning and labeling of a trained SOM network.…”
Section: Self-organizing Mapsmentioning
confidence: 99%