压缩传感
算法
缩小
计算
计算机科学
梯度下降
规范(哲学)
矩阵分解
矩阵范数
基质(化学分析)
傅里叶变换
因式分解
快速傅里叶变换
稀疏矩阵
数学优化
优化算法
迭代法
计算复杂性理论
迭代重建
数学
共轭梯度法
近似算法
最优化问题
信号处理
深度学习
钥匙(锁)
随机梯度下降算法
信号重构
人工智能
高光谱成像
反问题
稀疏逼近
作者
Zai Yang,Zhuoli Zhang,Wenlong Wang,Weichao Zheng,Yan Yang,Zhiqiang Wei
标识
DOI:10.1109/mlsp62443.2025.11204277
摘要
Atomic norm minimization (ANM) is a well-established approach to spectral compressed sensing that estimates the frequencies on the continuum and offers theoretical recovery guarantees. But its practical application is limited by the high computational cost associated with solving a semidefinite program. In this paper, we propose a novel matrix factorization formulation for ANM and develop a gradient descent algorithm to solve it with low per-iteration computational complexity. To further reduce the number of iterations, we propose a superfast deep learning method to implement the algorithm based on the deep unfolding technique, referred to as Learned ANM (LANM). LANM consists of only a few iterations, with each iteration efficiently computed using fast Fourier transforms (FFTs). Numerical experiments are provided to show that LANM achieves superior performance in both speed and reconstruction accuracy.
科研通智能强力驱动
Strongly Powered by AbleSci AI