组合连续最大流
Combinatorial Continuous Maximal Flows
摘要:
最大流(和最小割)算法对计算机视觉产生了强烈的影响。特别地,图切割算法提供了一种用于能量泛函的离散优化的机制,该能量泛函已被用于各种应用中,例如图像分割、立体、图像拼接和纹理合成。基于图上定义的最大流的经典公式的算法已知在解决方案中表现出度量伪像。因此,最近的趋势是在这些相同的应用中采用空间连续的最大流量(或双最小切割问题)来产生没有公制误差的解决方案。然而,已知的快速连续最大流算法没有停止标准或尚未被证明收敛。在这项工作中,我们重新连续最大流问题,并表明类似的离散制定是从经典的最大流问题不同。然后,我们应用一个适当的组合优化技术,这个组合连续最大流CCMF问题,找到一个零发散的解决方案,表现出没有度量文物,并可以解决一个快速,高效的算法,可证明收敛。最后,通过展示我们的CCMF制定的对偶问题,我们澄清了一个事实,已经证明了野泽在连续设置,最大流和总变差问题并不总是等价的。
英文摘要:
Maximum flow (and minimum cut) algorithms have had a strong impact on computer vision. In particular, graph cuts algorithms provide a mechanism for the discrete optimization of an energy functional which has been used in a variety of applications such as image segmentation, stereo, image stitching and texture synthesis. Algorithms based on the classical formulation of max-flow defined on a graph are known to exhibit metrication artefacts in the solution. Therefore, a recent trend has been to instead employ a spatially continuous maximum flow (or the dual min-cut problem) in these same applications to produce solutions with no metrication errors. However, known fast continuous max-flow algorithms have no stopping criteria or have not been proved to converge. In this work, we revisit the continuous max-flow problem and show that the analogous discrete formulation is different from the classical max-flow problem. We then apply an appropriate combinatorial optimization technique to this combinatorial continuous max-flow CCMF problem to find a null-divergence solution that exhibits no metrication artefacts and may be solved exactly by a fast, efficient algorithm with provable convergence. Finally, by exhibiting the dual problem of our CCMF formulation, we clarify the fact, already proved by Nozawa in the continuous setting, that the max-flow and the total variation problems are not always equivalent.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。