Spatial-spectral Hyperspectral Image Classification via Multiple Random Anchor Graphs Ensemble Learning
원문 초록
Graph-based semi-supervised learning methods, which deal well with the situation of limited labeled data, have shown dominant performance in practical applications. However, the high dimensionality of hyperspectral images (HSI) makes it hard to construct the pairwise adjacent graph. Besides, the fine spatial features that help improve the discriminability of the model are often overlooked. To handle the problems, this paper proposes a novel spatial-spectral HSI classification method via multiple random anchor graphs ensemble learning (RAGE). Firstly, the local binary pattern is adopted to extract the more descriptive features on each selected band, which preserves local structures and subtle changes of a region. Secondly, the adaptive neighbors assignment is introduced in the construction of anchor graph, to reduce the computational complexity. Finally, an ensemble model is built by utilizing multiple anchor graphs, such that the diversity of HSI is learned. Extensive experiments show that RAGE is competitive against the state-of-the-art approaches.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Softlog-Softmax Layers and Divergences Contribute to a Computationally Dependable Ensemble Learning
A Supervised Segmentation Network for Hyperspectral Image Classification
Generative Adversarial Minority Oversampling for Spectral-Spatial Hyperspectral Image Classification
Attention-Based Adaptive Spectral-Spatial Kernel ResNet for Hyperspectral Image Classification
Multi-direction Networks with Attentional Spectral Prior for Hyperspectral Image Classification
Multiscale Context-Aware Ensemble Deep KELM for Efficient Hyperspectral Image Classification
토론
이 논문과 연결된 포럼 글이 아직 없습니다.