2019
DOI: 10.1109/lgrs.2019.2912170
|View full text |Cite
|
Sign up to set email alerts
|

Unsupervised Hyperspectral Image Band Selection Based on Deep Subspace Clustering

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
22
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
8
1

Relationship

2
7

Authors

Journals

citations
Cited by 48 publications
(22 citation statements)
references
References 16 publications
0
22
0
Order By: Relevance
“…• Finally, the evaluation of the model is conducted by checking its performance when unseen samples are processed, measuring its ability to generalize the information learned during the training and adjustment phase. In this work, depending on the knowledge about the data employed during the third stage, we consider three main kinds of algorithms: 1) Unsupervised learning [112], [113], in which the classes are not known in advance; namely: only the characteristics of the data are known, but not the existing classes, and, therefore, it is the algorithm itself that has to recognize the patterns and group them according to their characteristics. This means that the algorithm creates the classes.…”
Section: B Machine Learning To Process Rs Imagesmentioning
confidence: 99%
“…• Finally, the evaluation of the model is conducted by checking its performance when unseen samples are processed, measuring its ability to generalize the information learned during the training and adjustment phase. In this work, depending on the knowledge about the data employed during the third stage, we consider three main kinds of algorithms: 1) Unsupervised learning [112], [113], in which the classes are not known in advance; namely: only the characteristics of the data are known, but not the existing classes, and, therefore, it is the algorithm itself that has to recognize the patterns and group them according to their characteristics. This means that the algorithm creates the classes.…”
Section: B Machine Learning To Process Rs Imagesmentioning
confidence: 99%
“…Mixture, connectivity and sparsity are the three major directions involved in the regularization term design [16]. The sparse representation coefficient matrix is computed with the regularization terms based on L0 and L1.…”
Section: Related Workmentioning
confidence: 99%
“…Unlike feature extraction, which transforms spectral information through linear or nonlinear operations, BS not only preserves the physical property contained in HSIs [5] but reduces the dimensionality of HSI. In recent years, plenty of BS methods have been proposed [8], [2], [11], [12] and can basically be divided into three categories: rankingbased [13], [2], clustering-based [14], [7], and searchingbased [15], [5] methods. The ranking-based method aims to rank each spectral band according to the estimation of its significance or information [16], [17].…”
Section: Introductionmentioning
confidence: 99%
“…Recently, many works have devoted to utilizing the self-representation model for BS of HSI, e.g., [27], [7], [24]. Most of these methods are relying on subspace clustering [7], [12], [11]. Despite the impressive performance, the traditional self-representation models often fail to exploit the structural relationships of spectral bands.…”
Section: Introductionmentioning
confidence: 99%