arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1312.4895stat.MLcs.ITmath.IT
收藏

递归压缩感测

Recursive Compressed Sensing

Nikolaos M. Freris, Orhan Öçal, Martin Vetterli

摘要:

我们介绍了一种递归算法进行压缩感知流数据。该方法包括a)递归编码,其中我们通过重叠窗口对输入流进行采样,并利用先前的测量来获得下一个,以及b)递归解码,其中利用来自先前窗口的信号估计,以便在应用于解码新窗口的迭代优化方案中实现更快的收敛。为了消除估计偏差,提出了一个两步估计过程,包括支持集检测和信号幅度估计。通过非线性投票方法和在多个窗口上平均估计来提高估计精度。我们分析了计算复杂度和估计误差,并表明归一化误差方差渐近趋于零次线性稀疏。我们的仿真结果表明,速度的数量级比传统的CS,同时获得显着较低的重建误差在温和的条件下的信号幅度和噪声水平。

英文摘要:

We introduce a recursive algorithm for performing compressed sensing on streaming data. The approach consists of a) recursive encoding, where we sample the input stream via overlapping windowing and make use of the previous measurement in obtaining the next one, and b) recursive decoding, where the signal estimate from the previous window is utilized in order to achieve faster convergence in an iterative optimization scheme applied to decode the new one. To remove estimation bias, a two-step estimation procedure is proposed comprising support set detection and signal amplitude estimation. Estimation accuracy is enhanced by a non-linear voting method and averaging estimates over multiple windows. We analyze the computational complexity and estimation error, and show that the normalized error variance asymptotically goes to zero for sublinear sparsity. Our simulation results show speed up of an order of magnitude over traditional CS, while obtaining significantly lower reconstruction error under mild conditions on the signal magnitudes and the noise level.

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

↑