Dual-graph convolutional network based on band attention and sparse constraint for hyperspectral band selection

计算机科学 模式识别(心理学) 高光谱成像 人工智能 光谱带 特征选择 特征提取 图形 理论计算机科学 遥感 地理
作者
Jie Feng,Zhanwei Ye,Shuai Liu,Xiangrong Zhang,Jiantong Chen,Ronghua Shang,Licheng Jiao
出处
期刊:Knowledge Based Systems [Elsevier BV]
卷期号:231: 107428-107428 被引量:21
标识
DOI:10.1016/j.knosys.2021.107428
摘要

Band selection is a research hotspot in hyperspectral image processing. The continuity of the spectral bands causes the adjacent bands to be highly correlated, and correlation among long-range bands is possible with hundreds of spectral bands. Most existing deep learning methods fail to make full use of the inter-band correlation for band selection. In this paper, a novel dual-graph convolutional network based on band attention and a sparse constraint is proposed for band selection. The network consists of two branches. In the attention branch, band-based dual graphs are constructed to encode the contextual correlation of adjacent bands and the structural correlation of long-range bands into non-Euclidean space. Subsequently, the graph convolution-based band attention mechanism is devised to aggregate the band information in the band-based dual graphs and to generate the attention map for all bands. The band attention map is sparsely constrained and embedded as a mask into the trunk branch. In the trunk branch, sample-based dual graphs are constructed to represent the topological information of the samples in the spectral and spatial domains. Furthermore, a dense graph convolutional network is designed to extract and fuse the spatial–spectral and topological features from the shallow to deep layers for classification. A soft-shifting optimization strategy is implemented by defining a new loss from full bands and selected bands to solve the optimization problem caused by the sparse constraint. In this manner, band selection, feature extraction, and classification can be combined into an end-to-end trainable network. The experimental results on representative hyperspectral image datasets demonstrate the superiority of the proposed method over current state-of-the-art band selection methods.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
xuan发布了新的文献求助10
1秒前
1秒前
2秒前
2秒前
molihuakai应助非法所得采纳,获得10
3秒前
3秒前
明理若烟发布了新的文献求助10
4秒前
汉堡包应助积极的白亦采纳,获得10
4秒前
CodeCraft应助了U采纳,获得10
4秒前
5秒前
5秒前
Amara完成签到,获得积分10
6秒前
赤侠驳回了fuxixi应助
6秒前
6秒前
6秒前
GG爆本堡发布了新的文献求助10
7秒前
xuan发布了新的文献求助10
7秒前
7秒前
bbbbbbbb发布了新的文献求助20
10秒前
10秒前
张欢馨应助Julie采纳,获得10
11秒前
Donger完成签到 ,获得积分10
11秒前
11秒前
ding应助忧郁的芒果干采纳,获得10
12秒前
13秒前
diu发布了新的文献求助10
13秒前
专注飞薇发布了新的文献求助10
13秒前
14秒前
爱听歌的大开完成签到,获得积分10
14秒前
14秒前
OpalLi发布了新的文献求助10
14秒前
14秒前
积极的白亦完成签到,获得积分10
15秒前
思源应助俏皮凝梦采纳,获得10
15秒前
xuan发布了新的文献求助10
16秒前
夏哥发布了新的文献求助10
17秒前
李健应助bbbbbbbb采纳,获得10
17秒前
张欢馨应助科研通管家采纳,获得10
18秒前
科研通AI2S应助科研通管家采纳,获得10
18秒前
小二郎应助科研通管家采纳,获得10
19秒前
高分求助中
Markov Chain Monte Carlo 10000
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Common Foundations of American and East Asian Modernisation: From Alexander Hamilton to Junichero Koizumi 5000
How to Use Machine Learning in Chemistry: An Introduction 1000
Matrix Methods in Data Mining and Pattern Recognition Second Edition 510
Discerning Saints: Moralization of Intrinsic Motivation and Selective Prosociality at Work 500
Handbuch Trainingswissenschaft – Trainingslehre 500
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 内科学 物理 复合材料 催化作用 细胞生物学 无机化学 光电子学 物理化学 电极 基因
热门帖子
关注 科研通微信公众号,转发送积分 7583903
求助须知:如何正确求助?哪些是违规求助? 9162659
关于积分的说明 19607512
捐赠科研通 7165840
什么是DOI,文献DOI怎么找? 3266349
关于科研通互助平台的介绍 2431276
邀请新用户注册赠送积分活动 2257837