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

通用压缩感知

Universal Compressed Sensing

Shirin Jalali, H. Vincent Poor

摘要:

本文研究了随机过程压缩感知的通用算法问题。首先,Rényi的信息维(ID)的概念推广到模拟平稳过程。这为这些过程提供了复杂性的度量,并与精确恢复所需的测量次数有关。然后提出了一种最小熵追踪(MEP)优化方法,证明了该方法可以从足够多的随机线性测量中可靠地恢复出满足混合约束的平稳过程,而不需要任何关于过程分布的先验信息.证明了拉格朗日型近似的MEP优化问题,称为拉格朗日MEP问题,是相同的启发式实现算法提出的男爵等人。它表明,对于正确的参数选择的拉格朗日MEP算法,除了具有相同的渐近性能MEP优化,也是强大的测量噪声。对于离散-连续混合分布的无记忆信源,Wu等人给出了非通用压缩感知解码器所需最小测量数的基本限制,证明了通用编码没有损失,并且MEP和Lagrangian-MEP都渐近地达到最优性能.

英文摘要:

In this paper, the problem of developing universal algorithms for compressed sensing of stochastic processes is studied. First, Rényi's notion of information dimension (ID) is generalized to analog stationary processes. This provides a measure of complexity for such processes and is connected to the number of measurements required for their accurate recovery. Then a minimum entropy pursuit (MEP) optimization approach is proposed, and it is proven that it can reliably recover any stationary process satisfying some mixing constraints from sufficient number of randomized linear measurements, without having any prior information about the distribution of the process. It is proved that a Lagrangian-type approximation of the MEP optimization problem, referred to as Lagrangian-MEP problem, is identical to a heuristic implementable algorithm proposed by Baron et al. It is shown that for the right choice of parameters the Lagrangian-MEP algorithm, in addition to having the same asymptotic performance as MEP optimization, is also robust to the measurement noise. For memoryless sources with a discrete-continuous mixture distribution, the fundamental limits of the minimum number of required measurements by a non-universal compressed sensing decoder is characterized by Wu et al. For such sources, it is proved that there is no loss in universal coding, and both the MEP and the Lagrangian-MEP asymptotically achieve the optimal performance.

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

↑