2018
DOI: 10.1109/jstars.2018.2858008
|View full text |Cite
|
Sign up to set email alerts
|

Unsupervised Bayesian Classification of a Hyperspectral Image Based on the Spectral Mixture Model and Markov Random Field

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
9
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 20 publications
(9 citation statements)
references
References 35 publications
0
9
0
Order By: Relevance
“…For k-means it is O(cdnt) because the distance from each pixel to each (original) mean is calculated as well as the new means. For the gaussian mixture model discussed in [42], it is O(cn 2 t) because of the energy minimization sub-algorithm which is used. For the SOM, we showed above the training can be performed on the ground, so the execution time complexity is more important.…”
Section: Discussionmentioning
confidence: 99%
See 2 more Smart Citations
“…For k-means it is O(cdnt) because the distance from each pixel to each (original) mean is calculated as well as the new means. For the gaussian mixture model discussed in [42], it is O(cn 2 t) because of the energy minimization sub-algorithm which is used. For the SOM, we showed above the training can be performed on the ground, so the execution time complexity is more important.…”
Section: Discussionmentioning
confidence: 99%
“…Because it depends on the determination of the BMU which involves evaluation the distance between each pixel and all the nodes, the time complexity of evaluation it O(nz 2 d). Note when algorithms require spatial information, as [42] does, the operational procedures for moving training to the ground no longer work. The most computationally expensive step of the spectral clustering methods is the computation of the affinity matrix, which considers the similarity between the anchors and every pixel in the dataset, giving a complexity of O(dnm).…”
Section: Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…In Remote Sensing, the first applications of MRF occurred in late 1980's (Geman, Geman, 1984, Kittler, Föglein, 1984, Mohn et al, 1987. Recently it is still used for classification (Zhang et al, 2018a, Zhang et al, 2018b, Fang et al, 2018, Borhani, Ghassemian, 2014 and image segmentation. The main disadvantage of MRF is the need to explicitly model the distribution of the likelihood and assume that the observed image data are conditionally independent, given the labels.…”
Section: Introductionmentioning
confidence: 99%
“…The latter identifies the differences between image classes and finds the optimal classification surface between them, according to the conditional probability distribution of image features and classes. The typical methods based on production model include Bayesian classification model [4] and Gaussian mixture model [5], and the most representative methods based on discriminant model include nearest neighbor method [6], decision tree [7] and artificial neural network (ANN) [8]. Both types of image classification methods face the defects of being shallow classification techniques.…”
Section: Introductionmentioning
confidence: 99%