Discrete and Continuous Models for Partitioning Problems

Discrete and Continuous Models for Partitioning Problems
复制标题

分区问题的离散和连续模型

DOI:
10.1007/s11263-013-0621-4
复制
发表时间:
2013
影响因子:
19.5
通讯作者:
Lellmann J
Lellmann J
中科院分区:
计算机科学2区
文献类型:
--
作者:
Lellmann J

文献摘要

参考文献

被引文献

相似文献

最近,变分松弛技术的近似解决方案的连续图像域上的分区问题已经得到了相当大的关注,因为它们引入显着较少的文物比建立图形切割为基础的技术。这项工作是关于这些文物的来源。我们讨论了区分由discretization造成的文物和那些由relaxationand提供支持的数值例子。此外,我们认为在深入的后果,最近的理论结果有关的最优性的解决方案,使用一个特定的放松方法。由于所采用的正则化是相当紧的,所考虑的松弛一般涉及到一个大的计算成本。我们提出了一种方法,以显着降低这些成本,在一个全自动的方式为一大类的指标,包括树指标,从而推广了最近提出的方法Strekalovskiy和Cremers(IEEE会议上的计算机视觉和模式识别,pp. 1905-1911年,2011年)。
Recently, variational relaxation techniques for approximating solutions of partitioning problems on continuous image domains have received considerable attention, since they introduce significantly less artifacts than established graph cut-based techniques. This work is concerned with the sources of such artifacts. We discuss the importance of differentiating between artifacts caused bydiscretizationand those caused byrelaxationand provide supporting numerical examples. Moreover, we consider in depth the consequences of a recent theoretical result concerning the optimality of solutions obtained using a particular relaxation method. Since the employed regularizer is quite tight, the considered relaxation generally involves a large computational cost. We propose a method to significantly reduce these costs in a fully automatic way for a large class of metrics including tree metrics, thus generalizing a method recently proposed by Strekalovskiy and Cremers (IEEE conference on computer vision and pattern recognition, pp. 1905–1911, 2011).
计算机视觉中的全局优化:凸性、切割和近似算法
DOI: --
发表时间: 2009
期刊:
影响因子: --
作者:
Carl Olsson
通讯作者: Carl Olsson
扩展连续切割:各向异性度量和扩展移动
DOI: --
发表时间: 2009
期刊: IEEE International Conference on Computer Vision
影响因子: --
作者:
Carl Olsson;Martin Byröd;N. C. Overgaard;Fredrik Kahl
通讯作者: Fredrik Kahl
通过少量的树度量来近似有限度量
DOI: 10.1109/sfcs.1998.743488
发表时间: 1998
期刊: Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280)
影响因子: --
作者:
M. Charikar;C. Chekuri;Ashish Goel;S. Guha;Serge A. Plotkin
通讯作者: Serge A. Plotkin
DOI: 10.1007/s10851-012-0390-7
发表时间: 2013
影响因子: 2
作者:
J. Lellmann;F. Lenzen;C. Schnoerr
通讯作者: C. Schnoerr
最大流问题是 P 的对数空间完整
DOI: 10.1016/0304-3975(82)90092-5
发表时间: 1982
期刊: Theor. Comput. Sci.
影响因子: --
作者:
L. Goldschlager;Ralph A. Shaw;J. Staples
通讯作者: J. Staples