arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1004.4949cs.ITmath.IT
收藏

Reed Muller传感矩阵与LASSO

Reed Muller Sensing Matrices and the LASSO

Robert Calderbank, Sina Jafarpour

摘要:

我们构建了两个家庭的确定性传感矩阵的列是通过指数的四元Delsarte-Goethals码$DG(m,r)$的码字。这种构造方法导致具有低相干性和谱范数的感测矩阵。第一类是具有冗余$2^{rm}$的$2^m$维紧框架,我们称之为Delsarte-Goethals框架。第二类,我们称之为Delsarte-Goethals筛,是通过在Delsarte-Goethals框架中对列向量进行二次采样而获得的。Delsarte-Goethals筛的不同行可能不是正交的,我们提出了一个有效的算法来识别所有对非正交行。这两个对是重复的测量,消除它们会导致一个紧密的框架。实验结果表明,所有具有$m\leq 15$和$r\geq2$的$DG(m,r)$筛都是紧框架;没有重复的行。对于这两个家庭的传感矩阵,我们测量重建的准确性(统计0-1损失)和复杂性(平均重建时间)作为稀疏水平$k$的函数。我们的研究结果表明,DG框架和筛优于随机高斯矩阵的无噪和噪声信号恢复使用LASSO。

英文摘要:

We construct two families of deterministic sensing matrices where the columns are obtained by exponentiating codewords in the quaternary Delsarte-Goethals code $DG(m,r)$. This method of construction results in sensing matrices with low coherence and spectral norm. The first family, which we call Delsarte-Goethals frames, are $2^m$ - dimensional tight frames with redundancy $2^{rm}$. The second family, which we call Delsarte-Goethals sieves, are obtained by subsampling the column vectors in a Delsarte-Goethals frame. Different rows of a Delsarte-Goethals sieve may not be orthogonal, and we present an effective algorithm for identifying all pairs of non-orthogonal rows. The pairs turn out to be duplicate measurements and eliminating them leads to a tight frame. Experimental results suggest that all $DG(m,r)$ sieves with $m\leq 15$ and $r\geq2$ are tight-frames; there are no duplicate rows. For both families of sensing matrices, we measure accuracy of reconstruction (statistical 0-1 loss) and complexity (average reconstruction time) as a function of the sparsity level $k$. Our results show that DG frames and sieves outperform random Gaussian matrices in terms of noiseless and noisy signal recovery using the LASSO.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑