.png){kind=icon}
返回
2-D Learned Proximal Gradient Algorithm for Fast Sparse Matrix Recovery
.png){kind=icon}
PRE
AI
DOI：10.1109/TCSII.2020.3024912.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Many real-world problems can be modeled as sparse matrix recovery from two-dimensional (2D) measurements, which is recognized as one of the most important topics in signal processing community. Benefited from the roaring success of compressed sensing, many classical iterative algorithms can be directly applied or reinvented for matrix recovery, though they are computationally expensive. To alleviate this, we propose a neural network named 2D learned proximal gradient algorithm (2D-LPGA), which aims to quickly reconstruct the target matrix. Theoretical analysis reveals that if the parameters of the network satisfy certain conditions, it can reconstruct the sparse signal with linear convergence rate. Moreover, numerical experiments demonstrate the superiority of the proposed method over other classical schemes.
Keyword:
Sparse matrices
Two dimensional displays
Training
Electronics packaging
Convergence
Iterative methods
Neural networks
Sparse matrix recovery
proximal gradient
neural network
unfolding
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
I
IF:
4.9
论文数:
8.8K
被引数:
2.5W
机构
引用论文
.png){kind=icon}
Graphene/Ionic Liquid Binary Electrode Material for High Performance Supercapacitor用于高性能超级电容器的石墨烯/离子液体二元电极材料
PREAI
分享收藏
查看更多内容