arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 0903.5066cs.ITmath.ITmath.STstat.MEstat.TH
收藏

Modified-CS:修正支持度部分已知的压缩感知问题

Modified-CS: Modifying Compressive Sensing for Problems with Partially Known Support

Namrata Vaswani, Wei Lu

摘要:

我们研究的问题重建稀疏信号从有限数量的线性投影时,其支持的一部分是已知的,虽然已知的部分可能包含一些错误。表示为T的支持的"已知”部分可以从先验知识中获得。或者,在递归重建稀疏空间信号的时间序列的问题中,可以使用来自前一时刻的支持估计作为"已知”部分。我们提出的解决方案(modified-CS)的思想是解决以下问题的凸松弛:找到满足数据约束并且稀疏地位于T之外的信号。我们得到了使用修改CS精确重建的充分条件。当支持的未知部分的大小和已知部分中的误差的大小与支持大小相比很小时,这些比压缩感测(CS)所需的那些弱得多。一个重要的扩展,称为正则化修改CS(RegModCS)的开发,也使用先验信号估计知识。稀疏和可压缩信号的仿真比较。

英文摘要:

We study the problem of reconstructing a sparse signal from a limited number of its linear projections when a part of its support is known, although the known part may contain some errors. The ``known" part of the support, denoted T, may be available from prior knowledge. Alternatively, in a problem of recursively reconstructing time sequences of sparse spatial signals, one may use the support estimate from the previous time instant as the ``known" part. The idea of our proposed solution (modified-CS) is to solve a convex relaxation of the following problem: find the signal that satisfies the data constraint and is sparsest outside of T. We obtain sufficient conditions for exact reconstruction using modified-CS. These are much weaker than those needed for compressive sensing (CS) when the sizes of the unknown part of the support and of errors in the known part are small compared to the support size. An important extension called Regularized Modified-CS (RegModCS) is developed which also uses prior signal estimate knowledge. Simulation comparisons for both sparse and compressible signals are shown.

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

↑