arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1210.3098math.NAcs.CVcs.ITcs.NAmath.IT
收藏

全变差最小化的近最优压缩感知保证

Near-optimal compressed sensing guarantees for total variation minimization

Claremont McKenna College(克莱蒙特·麦肯纳学院);University of Texas at Austin(德克萨斯大学奥斯汀分校)

Deanna Needell, Rachel Ward

AI总结:

针对多维信号压缩感知重建问题,本文证明通过全变差最小化,从 O(sd*log(N^d)) 个线性测量中可重建信号,误差与梯度最佳 s 项近似成比例,并证明该保证在空间维度 d 上多项式因子内最优。

摘要:

考虑压缩感知设置中从欠定测量集重建多维信号的问题。没有任何额外假设,该问题是不适定的。然而,对于自然图像或电影等信号,与测量一致的最小全变差估计通常能产生对潜在信号的良好近似,即使测量数量远小于环境维度。本文将二维图像的最新重建保证推广到任意维度 d>1 的信号和各向同性全变差问题。具体来说,我们证明多维信号 x 可以从 O(sd*log(N^d)) 个线性测量中通过全变差最小化重建,重建误差在其梯度最佳 s 项近似的因子内。我们提供的重建保证在空间维度 d 的多项式因子内必然是最优的。

英文摘要:

Consider the problem of reconstructing a multidimensional signal from an underdetermined set of measurements, as in the setting of compressed sensing. Without any additional assumptions, this problem is ill-posed. However, for signals such as natural images or movies, the minimal total variation estimate consistent with the measurements often produces a good approximation to the underlying signal, even if the number of measurements is far smaller than the ambient dimensionality. This paper extends recent reconstruction guarantees for two-dimensional images to signals of arbitrary dimension d>1 and to isotropic total variation problems. To be precise, we show that a multidimensional signal x can be reconstructed from O(sd*log(N^d)) linear measurements using total variation minimization to within a factor of the best s-term approximation of its gradient. The reconstruction guarantees we provide are necessarily optimal up to polynomial factors in the spatial dimension d.

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

↑