.png){kind=icon}
Return
Graph-Cut-Based Collaborative Node Embeddings for Hyperspectral Images Classification
.png){kind=icon}
PRE
AI
DOI：10.1109/LGRS.2022.3184817.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Node embedding (NE) is conducive to aggregating correlations and relieving the influence of the Hughes phenomenon when processing high-dimensional data. Although some graph neural networks can capture correlations during achieving NE, the application of NE still faces two rigorous challenges: numerous model parameters and poor generalization. In this letter, we propose a new approach for hyperspectral image (HSI) classification, called the graph-cut-based collaborative NEs (GCCNE). Specifically, we develop a graph-cut-based NE (GCNE) to achieve low-dimensional feature representation, which avoids numerous model parameters when using a graph structure. Considering that the graph cut in a low-dimensional space does not need to set anchors to decrease the calculation amount, we adopt an ensemble framework based on random subspaces (RSs) to implement the GCNE to obtain the collaborative feature sets, enhancing the generalization of feature representation. Afterward, the collaborative feature sets are input in several kernel-based extreme learning machines (KELMs), respectively, classifying pixels. The number of RSs is the same as the number of KELMs. Finally, we acquire an ensemble result associated with each class. The effectiveness and competitiveness of the proposed method are evaluated using real HSI datasets.
Keywords:
Correlation
Symmetric matrices
Collaboration
Sun
Redundancy
Hyperspectral imaging
Geomagnetism
Graph cut
hyperspectral image (HSI) classification
node embedding (NE)
representation learning
Journal
IF:
16.4
Papers:
1.0W
Citations:
5.1K
Organization
Cited Papers
.png){kind=icon}
ShareSave
ShareSaveShareSaveMechanical characterization of neural electrodes based on PDMS-parylene C-PDMS sandwiched system
PREAI
ShareSaveShareSave
View more