[论文解读] Off-the-Grid Line Spectrum Denoising and Estimation with Multiple Measurement Vectors

Yuanxin Li, Yuejie Chi|arXiv (Cornell University)|Aug 10, 2014

Sparse and Compressive Sensing Techniques参考文献 32被引用 7

一句话总结

本文提出两种基于原子范数最小化与结构化协方差估计的方法，用于通过多测量向量（MMVs）实现非网格化线谱去噪与频率估计，能够在部分、噪声污染的观测下高精度恢复具有任意连续频率的谱稀疏信号。该方法通过半定规划实现更优的去噪性能与有限样本性能保证，并提供了理论收敛速率及高效的ADMM实现。

ABSTRACT

Compressed Sensing suggests that the required number of samples for reconstructing a signal can be greatly reduced if it is sparse in a known discrete basis, yet many real-world signals are sparse in a continuous dictionary. One example is the spectrally-sparse signal, which is composed of a small number of spectral atoms with arbitrary frequencies on the unit interval. In this paper we study the problem of line spectrum denoising and estimation with an ensemble of spectrally-sparse signals composed of the same set of continuous-valued frequencies from their partial and noisy observations. Two approaches are developed based on atomic norm minimization and structured covariance estimation, both of which can be solved efficiently via semidefinite programming. The first approach aims to estimate and denoise the set of signals from their partial and noisy observations via atomic norm minimization, and recover the frequencies via examining the dual polynomial of the convex program. We characterize the optimality condition of the proposed algorithm and derive the expected convergence rate for denoising, demonstrating the benefit of including multiple measurement vectors. The second approach aims to recover the population covariance matrix from the partially observed sample covariance matrix by motivating its low-rank Toeplitz structure without recovering the signal ensemble. Performance guarantee is derived with a finite number of measurement vectors. The frequencies can be recovered via conventional spectrum estimation methods such as MUSIC from the estimated covariance matrix. Finally, numerical examples are provided to validate the favorable performance of the proposed algorithms, with comparisons against several existing approaches.

研究动机与目标

• 解决压缩感知中因谱稀疏信号的连续频率未对齐离散网格而导致的基失配问题。
• 为从部分且噪声污染的观测中，开发高效算法以实现多个共享相同连续频率集的谱稀疏信号的去噪与频率估计。
• 利用多测量向量（MMVs）之间的联合稀疏性，提升估计精度并减少采样需求。
• 在有限数量的测量向量下提供理论性能保证，避免依赖渐近假设。
• 实现无需网格离散化的高分辨率谱估计，克服传统基于DFT方法的局限性。

提出的方法

• 将非网格化线谱估计问题建模为凸优化问题，通过原子范数最小化在连续正弦函数上促进稀疏性。
• 引入对偶多项式框架，从原子范数最小化问题的解中恢复连续频率。
• 提出一种结构化协方差估计方法，利用从部分观测样本协方差矩阵中推导出的总体协方差矩阵的低秩托普利茨结构。
• 使用半定规划高效求解原子范数与协方差估计问题，并提供收敛性保证。
• 采用ADMM并结合闭式更新实现高效计算，包括通过特征值分解实现半正定约束的强制执行。
• 推导原子范数方法的最优性条件与收敛速率，表明随着MMVs数量增加，性能得到提升。

实验结果

研究问题

• RQ1 原子范数最小化能否扩展至多测量向量，以在部分且噪声污染的观测下提升非网格化线谱估计性能？
• RQ2 与单向量方法相比，引入多测量向量如何提升去噪与频率恢复性能？
• RQ3 如何利用低秩托普利茨结构，从部分观测数据中对总体协方差矩阵实现有限样本性能保证？
• RQ4 原子范数问题的对偶多项式能否在无需网格离散化的情况下准确恢复连续频率？
• RQ5 所提出的原子范数最小化算法在去噪方面的理论收敛速率是多少？其随测量向量数量的扩展特性如何？

主要发现

• 所提出的原子范数最小化方法实现了去噪误差界 $ \frac{1}{\sqrt{n}}\|\hat{\mathbf{u}} - \mathbf{u}^\star\|_F \leq 16\lambda\sqrt{r} $，表明随着测量向量数量增加，性能得到改善。
• 结构化协方差估计方法通过利用低秩托普利茨结构，从部分观测数据中恢复总体协方差矩阵，从而支持后续通过MUSIC方法进行频率恢复。
• 在有限数量的测量向量下推导出性能保证，确保在实际数据有限场景下的鲁棒性。
• 数值结果表明，与现有方法相比表现更优，验证了两种所提方法在非网格化谱估计中的有效性。
• ADMM实现通过闭式更新实现收敛，使算法计算高效且可扩展。
• 理论分析证实，原子范数方法可从多测量向量间的联合稀疏性中获益，提升估计精度并减少采样需求。