Published on Sun Dec 03 2017

Avalia\c{c}\~ao do m\'etodo dial\'etico na quantiza\c{c}\~ao de imagens multiespectrais

Wellington Pinheiro dos Santos, Francisco Marcos de Assis

Unsupervised classification has a very important role in the analysis of multispectral images. The methods based on Dialectics are robust to noise, and quantization can achieve results as good as those obtained with the Kohonen map.

0
0
0
Abstract

The unsupervised classification has a very important role in the analysis of multispectral images, given its ability to assist the extraction of a priori knowledge of images. Algorithms like k-means and fuzzy c-means has long been used in this task. Computational Intelligence has proven to be an important field to assist in building classifiers optimized according to the quality of the grouping of classes and the evaluation of the quality of vector quantization. Several studies have shown that Philosophy, especially the Dialectical Method, has served as an important inspiration for the construction of new computational methods. This paper presents an evaluation of four methods based on the Dialectics: the Objective Dialectical Classifier and the Dialectical Optimization Method adapted to build a version of k-means with optimal quality indices; each of them is presented in two versions: a canonical version and another version obtained by applying the Principle of Maximum Entropy. These methods were compared to k-means, fuzzy c-means and Kohonen's self-organizing maps. The results showed that the methods based on Dialectics are robust to noise, and quantization can achieve results as good as those obtained with the Kohonen map, considered an optimal quantizer.

Sat Dec 14 2013
Computer Vision
Clustering using Vector Membership: An Extension of the Fuzzy C-Means Algorithm
Clustering is an important facet of explorative data mining and finds extensive use in several fields. The proposed algorithm adopts a multi-dimensional membership vector for each data point instead of the traditional, scalar membership value defined in the original algorithm.
0
0
0
Mon Aug 02 2021
Machine Learning
Metodos de Agrupamentos em dois Estagios
This work investigates the use of two-stage clustering methods. Four techniques were proposed: SOMK, SOMAK, ASCAK and SOINAK. SOMK is composed of a SOM (Self-Organizing Maps) followed by the K-means algorithm.
1
0
0
Fri Sep 28 2012
Computer Vision
Dimensionality Reduction and Classification feature using Mutual Information applied to Hyperspectral Images : A Filter strategy based algorithm
Hyperspectral images (HIS) classification is a high technical remote sensing tool. The goal is to reproduce a thematic map that will be compared with areference ground truth map.
0
0
0
Wed Oct 31 2012
Computer Vision
Dimensionality Reduction and Classification Feature Using Mutual Information Applied to Hyperspectral Images: A Wrapper Strategy Algorithm Based on Minimizing the Error Probability Using the Inequality of Fano
In the feature classification domain, the choice of data affects widely the results. For the Hyperspectral image, the bands dont all contain the maximal information. Some bands are irrelevant like those affected by various Atmospheric effects, and decrease the classification accuracy.
0
0
0
Thu Jun 22 2017
Computer Vision
A Novel VHR Image Change Detection Algorithm Based on Image Fusion and Fuzzy C-Means Clustering
This thesis describes a study to perform change detection on Very High Resolution satellite images. Image fusion based on 2D Discrete Wavelet Transform and Fuzzy C-Means clustering algorithm. Multiple other methods are also quantitatively and qualitatively compared.
0
0
0
Sat Sep 22 2018
Machine Learning
Implementation of Fuzzy C-Means and Possibilistic C-Means Clustering Algorithms, Cluster Tendency Analysis and Cluster Validation
In this paper, several two-dimensional clustering scenarios are given. In those scenarios, soft partitioning clustering algorithms are applied. Afterward, VAT is used to investigate the clustering tendency visually. Three types of indices (e.g., PC, DI, and DBI)
0
0
0