半正交网格上的全变差去噪
Total Variation Denoising on Hexagonal Grids
摘要:
这项工作结合了图像处理的三个范例:i)去噪的全变差方法,ii)六边形网格的优越结构,以及iii)快速准确的图切割优化技术。虽然各向同性的理论,数值实现的$BV$矩阵总是表现出各向异性的行为。将图像域离散为六边形网格似乎完全适合于减轻这种不期望的效果。为此,我们重铸的连续问题作为一个有限维的任意晶格,在集中在笛卡尔和六边形结构的比较。最小化是用成熟的图切割算法进行的,该算法很容易适应新的空间离散化。除了产生最小化,更接近在$\ell^1$意义上的干净的图像足够高程度的正则化,我们的实验表明,六边形晶格还允许更有效地减少现有技术的两个主要缺点:公制文物和阶梯。为了实际的相关性,我们解决的困难,自然出现时,处理非标准的图像。
英文摘要:
This work combines three paradigms of image processing: i) the total variation approach to denoising, ii) the superior structure of hexagonal lattices, and iii) fast and exact graph cut optimization techniques. Although isotropic in theory, numerical implementations of the $BV$ seminorm invariably show anisotropic behaviour. Discretization of the image domain into a hexagonal grid seems perfectly suitable to mitigate this undesirable effect. To this end, we recast the continuous problem as a finite-dimensional one on an arbitrary lattice, before focussing on the comparison of Cartesian and hexagonal structures. Minimization is performed with well-established graph cut algorithms, which are easily adapted to new spatial discretizations. Apart from producing minimizers that are closer in the $\ell^1$ sense to the clean image for sufficiently high degrees of regularization, our experiments suggest that the hexagonal lattice also allows for a more effective reduction of two major drawbacks of existing techniques: metrication artefacts and staircasing. For the sake of practical relevance we address the difficulties that naturally arise when dealing with non-standard images.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。