Distributed Compressed Sensing Reconstruction Algorithm Based on Attention Mechanism and GRU

被引:0
作者
Li, Xiaodong [1 ]
Gao, Yulong [1 ]
Wang, Gang [1 ]
机构
[1] Harbin Inst Technol, Dept Commun Engn, Harbin, Peoples R China
来源
2023 INTERNATIONAL WIRELESS COMMUNICATIONS AND MOBILE COMPUTING, IWCMC | 2023年
基金
中国国家自然科学基金;
关键词
Distributed compressed sensing; Deep learning; Attention mechanism; GRU; Sparse reconstruction;
D O I
10.1109/IWCMC58020.2023.10183180
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
The purpose of this paper is to solve the reconstruction problem of sparse vectors in distributed compressed sensing with Multiple Measurement Vectors (MMV). Many traditional methods are based on certain sparse conditions, such as assuming that signals of different channels are joint sparse. This paper relaxes this restriction and assumes some correlation between the signals of different channels. We use Gated Recurrent Units (GRU) to capture this correlation and reconstruct the signal. Meanwhile, the previous reconstruction algorithms treat the signals of different channels equally, but the influence of different channels on the reconstruction results may be different. To solve this problem, we design an attention mechanism that adaptively learns and adjusts the influence factors of different channel signals, and optimizes the reconstruction results. The method proposed in this paper is only for the decoder, without any additional requirements for the encoder, so the encoder can use the conventional compression sampling method. Extensive experiments indicate the efficiency and robustness of the proposed method in the case of simulated data and real data.
引用
收藏
页码:1527 / 1532
页数:6
相关论文
共 19 条
[11]  
Schmidt M., OPTIMIZATION METHODS
[12]  
Surhone L.M., 2010, Long short term memory
[13]   Compressed Wideband Sensing in Cooperative Cognitive Radio Networks [J].
Tian, Zhi .
GLOBECOM 2008 - 2008 IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE, 2008,
[14]   Sparse Bayesian learning and the relevance vector machine [J].
Tipping, ME .
JOURNAL OF MACHINE LEARNING RESEARCH, 2001, 1 (03) :211-244
[15]   Algorithms for simultaneous sparse approximation. Part II: Convex relaxation [J].
Tropp, JA .
SIGNAL PROCESSING, 2006, 86 (03) :589-602
[16]   An empirical Bayesian strategy for solving the, simultaneous sparse approximation problem [J].
Wipf, David P. ;
Rao, Bhaskar D. .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2007, 55 (07) :3704-3716
[17]  
Zeng FZ, 2010, IEEE ICC
[18]   Distributed Compressive Spectrum Sensing in Cooperative Multihop Cognitive Networks [J].
Zeng, Fanzi ;
Li, Chen ;
Tian, Zhi .
IEEE JOURNAL OF SELECTED TOPICS IN SIGNAL PROCESSING, 2011, 5 (01) :37-48
[19]   Sparse Signal Recovery With Temporally Correlated Source Vectors Using Sparse Bayesian Learning [J].
Zhang, Zhilin ;
Rao, Bhaskar D. .
IEEE JOURNAL OF SELECTED TOPICS IN SIGNAL PROCESSING, 2011, 5 (05) :912-926