arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1105.4279math.FA
收藏

帧相干与稀疏信号处理

Frame Coherence and Sparse Signal Processing

Dustin G. Mixon, Waheed U. Bajwa, Robert Calderbank

摘要:

稀疏信号处理文献通常使用随机感测矩阵来获得性能保证。不幸的是,在现实世界中,传感矩阵并不总是来自随机过程。因此,期望评估任意矩阵或帧是否适合于感测稀疏信号。为此,本文研究了衡量帧相干性的两个参数:最坏情况相干性和平均相干性。我们首先提供了几个例子的帧,具有小的频谱范数,最坏情况下的相干性,和平均相干性。接下来,我们提出了一个新的下界的最坏情况下的一致性,并比较它的Welch界。之后,我们提出了一种算法,降低帧的平均相干性,而不改变其频谱范数或最坏情况下的相干性。最后,我们使用最坏情况和平均相干性,而不是受限制的等距属性,在存在噪声的情况下获得稀疏信号检测和重建的近最佳概率保证。这与最近的结果,只保证无噪声信号恢复从任意帧,并进一步假设独立的非零条目的信号-在某种意义上说,需要小的平均相干性取代了需要这样的假设。

英文摘要:

The sparse signal processing literature often uses random sensing matrices to obtain performance guarantees. Unfortunately, in the real world, sensing matrices do not always come from random processes. It is therefore desirable to evaluate whether an arbitrary matrix, or frame, is suitable for sensing sparse signals. To this end, the present paper investigates two parameters that measure the coherence of a frame: worst-case and average coherence. We first provide several examples of frames that have small spectral norm, worst-case coherence, and average coherence. Next, we present a new lower bound on worst-case coherence and compare it to the Welch bound. Later, we propose an algorithm that decreases the average coherence of a frame without changing its spectral norm or worst-case coherence. Finally, we use worst-case and average coherence, as opposed to the Restricted Isometry Property, to garner near-optimal probabilistic guarantees on both sparse signal detection and reconstruction in the presence of noise. This contrasts with recent results that only guarantee noiseless signal recovery from arbitrary frames, and which further assume independence across the nonzero entries of the signal---in a sense, requiring small average coherence replaces the need for such an assumption.

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

↑