arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1207.4642math.OCcs.NAmath.NA
收藏

稳健跳跃稀疏重建的L1-Potts泛函

The L1-Potts functional for robust jump-sparse reconstruction

Andreas Weinmann, Martin Storath, Laurent Demaret

摘要:

研究了离散时间和连续时间下的非光滑非凸$L^1$ -Potts泛函.我们显示$Γ$ -收敛离散$L^1$ -Potts泛函对他们的连续对应,并获得相应的极小值的离散化得到更好的收敛声明。对于离散的$L^1$问题,我们引入了一个$O(n^2)$时间和$O(n)$空间算法来计算精确极小元.本文将$L^1$ -Potts最小化方法应用于从噪声测量中恢复分段常数信号的问题。结果表明,$L^1$ -Potts泛函具有一个非常有趣的盲反卷积性质。事实上,我们表明,轻度模糊跳跃稀疏信号重建最小化的$L^1$ -Potts功能。此外,对于强模糊信号和已知的模糊算子,我们推导了一种迭代重建算法。

英文摘要:

We investigate the non-smooth and non-convex $L^1$-Potts functional in discrete and continuous time. We show $Γ$-convergence of discrete $L^1$-Potts functionals towards their continuous counterpart and obtain a convergence statement for the corresponding minimizers as the discretization gets finer. For the discrete $L^1$-Potts problem, we introduce an $O(n^2)$ time and $O(n)$ space algorithm to compute an exact minimizer. We apply $L^1$-Potts minimization to the problem of recovering piecewise constant signals from noisy measurements $f.$ It turns out that the $L^1$-Potts functional has a quite interesting blind deconvolution property. In fact, we show that mildly blurred jump-sparse signals are reconstructed by minimizing the $L^1$-Potts functional. Furthermore, for strongly blurred signals and known blurring operator, we derive an iterative reconstruction algorithm.

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

↑