多观测线性反问题稀疏解的新算法
Novel Algorithm for Sparse Solutions to Linear Inverse Problems with Multiple Measurements
摘要:
本文提出了一种从多个不完全测量中恢复联合稀疏信号(稀疏矩阵)的有效算法,特别是基于NESTA的MMV优化方法。简而言之,联合稀疏恢复明显优于将标准稀疏重建方法单独应用于每个通道。此外,人们还对基于NESTA的MMV算法进行了一些改进,特别是:(1)基于部分已知支持度的MMV算法,大大提高了收敛速度;(2)利用MUSIC算法检测未知联合稀疏信号的部分(或全部)位置;(3)结合硬阈值技术的迭代NESTA算法,减少了测量次数。已经表明,通过使用所提出的方法,可以从参考文献[1]中预测的()Spark A测量恢复具有()Spark A -稀疏性的未知稀疏矩阵X,其中由A表示的测量矩阵满足所谓的限制等距性质(RIP)。在对X的稀疏性和A的特性要求很低的情况下,基于迭代硬阈值(IHT)的MMV方法也被证明是一个很好的候选方法。
英文摘要:
In this report, a novel efficient algorithm for recovery of jointly sparse signals (sparse matrix) from multiple incomplete measurements has been presented, in particular, the NESTA-based MMV optimization method. In a nutshell, the jointly sparse recovery is obviously superior to applying standard sparse reconstruction methods to each channel individually. Moreover several efforts have been made to improve the NESTA-based MMV algorithm, in particular, (1) the NESTA-based MMV algorithm for partially known support to greatly improve the convergence rate, (2) the detection of partial (or all) locations of unknown jointly sparse signals by using so-called MUSIC algorithm; (3) the iterative NESTA-based algorithm by combing hard thresholding technique to decrease the numbers of measurements. It has been shown that by using proposed approach one can recover the unknown sparse matrix X with () Spark A -sparsity from () Spark A measurements, predicted in Ref. [1], where the measurement matrix denoted by A satisfies the so-called restricted isometry property (RIP). Under a very mild condition on the sparsity of X and characteristics of the A, the iterative hard threshold (IHT)-based MMV method has been shown to be also a very good candidate.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。