On the Design of Deterministic Matrices for Fast Recovery of Fourier Compressible Functions
On the Design of Deterministic Matrices for Fast Recovery of Fourier Compressible Functions
复制标题
傅里叶可压缩函数快速恢复的确定性矩阵设计
DOI：
10.1137/110835864
复制
发表时间：
2011
期刊：
影响因子：
--
通讯作者：
Craig V. Spencer
中科院分区：
文献类型：
--
作者：
James P. Bailey;M. Iwen;Craig V. Spencer
我们提出了一类压缩感应矩阵，然后证明具有相关的均匀时间稀疏近似算法。然后，我们开发用于构建此类专门矩阵的方法，这些矩阵与离散的傅立叶变换矩阵相乘时很少。最终，这些考虑因素提高了确定性稀疏傅立叶变换方法的先前采样要求。
We present a general class of compressed sensing matrices which are then demonstrated to have associated sublinear-time sparse approximation algorithms. We then develop methods for constructing specialized matrices from this class which are sparse when multiplied with a discrete Fourier transform matrix. Ultimately, these considerations improve previous sampling requirements for deterministic sparse Fourier transform methods.