2020
DOI: 10.1117/1.jrs.14.026516
|View full text |Cite
|
Sign up to set email alerts
|

Semisupervised graph convolutional network for hyperspectral image classification

Abstract: Deep learning based methods have seen a massive rise in popularity for hyperspectral image classification over the past few years. However, the success of deep learning is attributed greatly to numerous labeled samples. It is still very challenging to use only a few labeled samples to train deep learning models to reach a high classification accuracy. An active deep-learning framework trained by an end-to-end manner is, therefore, proposed by this paper in order to minimize the hyperspectral image classificati… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
21
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 24 publications
(22 citation statements)
references
References 39 publications
0
21
0
Order By: Relevance
“…Shahraki and Prasad (2018) defined three spectral-spatial weighted affinities, (1) unsupervised adjacency matrix by using the raw reflectance spectra, (2) supervised adjacency matrix through extracting discriminative features using CNN, and (3) semi-supervised adjacency matrix via learning the limited amount of labeled samples and extensive unlabeled samples, to demonstrate the data resided on manifold structure (i.e., graph structure) [52]. Liu et al (2020) extracted the extended morphological profiles and then conducted graph construction by the k-neighbors method, then fed into a GCN framework [20].…”
Section: Related Workmentioning
confidence: 99%
See 2 more Smart Citations
“…Shahraki and Prasad (2018) defined three spectral-spatial weighted affinities, (1) unsupervised adjacency matrix by using the raw reflectance spectra, (2) supervised adjacency matrix through extracting discriminative features using CNN, and (3) semi-supervised adjacency matrix via learning the limited amount of labeled samples and extensive unlabeled samples, to demonstrate the data resided on manifold structure (i.e., graph structure) [52]. Liu et al (2020) extracted the extended morphological profiles and then conducted graph construction by the k-neighbors method, then fed into a GCN framework [20].…”
Section: Related Workmentioning
confidence: 99%
“…The distance metric of all sample pairs can form a symmetric distance matrix A m = a ij ∈ R n×n . For example, a ij at row i and column j in the matrix A m denotes the distance between the i th pixel and the j th pixel [20].…”
Section: Adjacency Matrixmentioning
confidence: 99%
See 1 more Smart Citation
“…erefore, remote sensing image classification based on CNN has attracted special research interest [24]. Liu et al used the Siamese convolution network to classify remote sensing images and achieved better classification results [25]. Chen et al proposed a 3D-CNN model which utilized local hyperspectral data cubes as input to excavate spatial and spectral information.…”
Section: Introductionmentioning
confidence: 99%
“…Chen et al proposed a 3D-CNN model which utilized local hyperspectral data cubes as input to excavate spatial and spectral information. Zhao and Du developed a local patch-based CNN spatial feature extraction architecture [17,23,[25][26][27]. However, most of these methods improve network performance through spatial information, without considering the contribution difference of different spectra for classification result.…”
Section: Introductionmentioning
confidence: 99%