arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1007.1035math.OCmath.AP
收藏

二维条码的各向异性全变差正则化L^1逼近及去噪/去模糊

Anisotropic Total Variation Regularized L^1-Approximation and Denoising/Deblurring of 2D Bar Codes

Rustum Choksi, Yves van Gennip, Adam Oberman

摘要:

我们考虑的Rudin-Osher-Fatemi功能,特别适合于去噪和去模糊的二维条形码的变化。这些泛函由有利于矩形的各向异性全变差和测量信号的L^1距离的保真度项组成,无论是否存在反卷积算子。基于某个相伴向量场的存在性,我们得到了一个函数为极小元的充要条件。我们将这些结果应用到二维条形码,以找到明确的制度-在保真度参数和最小长度尺度的条形码-一个完美的条形码是可恢复的,通过最小化的泛函。通过离散化重新制定为一个线性规划,我们进行数值实验,证明其去噪和去模糊能力的所有泛函。

英文摘要:

We consider variations of the Rudin-Osher-Fatemi functional which are particularly well-suited to denoising and deblurring of 2D bar codes. These functionals consist of an anisotropic total variation favoring rectangles and a fidelity term which measure the L^1 distance to the signal, both with and without the presence of a deconvolution operator. Based upon the existence of a certain associated vector field, we find necessary and sufficient conditions for a function to be a minimizer. We apply these results to 2D bar codes to find explicit regimes ---in terms of the fidelity parameter and smallest length scale of the bar codes--- for which a perfect bar code is recoverable via minimization of the functionals. Via a discretization reformulated as a linear program, we perform numerical experiments for all functionals demonstrating their denoising and deblurring capabilities.

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

↑