English(EN) Fast and Compact Graph Cuts for the Boykov-Kolmogorov Algorithm

新算法大幅加速图割计算

作者 PulseAugur 编辑部 · [1 个来源] · 2026-10-23 04:00

研究人员开发了一种新算法，即快速 BK (fBK) 算法，它显著提高了计算图中最小 s-t 割的效率。该算法的时间复杂度为 O(m|C|)，是传统 Boykov-Kolmogorov (BK) 算法的重大进步。研究人员还引入了紧凑图表示，使得能够处理具有多达 10^9 个顶点和 10^10 条边的图的实现，并且仅需 128 GB 内存的机器。尽管 fBK 具有理论优势，但在基准数据集上，标准的 cBK 实现速度更快，这凸显了内存高效方法的重要性。 AI

影响增强了计算机视觉和其他 AI 应用中使用的基础算法，可能导致更高效的模型训练和推理。

排序理由详细介绍新算法和理论改进的学术论文。[lever_c_demoted from research: ic=1 ai=1.0]

在 arXiv cs.CV 阅读 →

AI 生成摘要 · Google Gemini · 来自 1 个来源。我们如何撰写摘要 →

本文如何被排名

Signal score: 4 / 100; Composite score across the factors below. Higher = stronger signal that this story matters right now.
Newsworthiness bucket: Tool; 详细介绍新算法和理论改进的学术论文。[lever_c_demoted from research: ic=1 ai=1.0]
Source corroboration: Single-source cluster; Only one publisher covered this so far. Single-source stories can still rank when the publisher is high-authority, but they lack cross-source corroboration.
Topics: paper, infra; Editorial topic classification. Feeds into how the story surfaces on /topic/<slug> hub pages and into the per-entity coverage mix.
AI-industry relevance: High; Clearly on-topic for AI-industry coverage.
Story freshness: Same-day; Cluster formed today. Ranking reflects the current source set at time of score.

完整方法见我们的编辑标准。

报道来源 [1]

arXiv cs.CV TIER_1 English(EN) · Christian M{\o}ller Mikkelstrup, Anders Bjorholm Dahl, Philip Bille, Vedrana Andersen Dahl, Inge Li G{\o}rtz · 2026-10-23 04:00

Fast and Compact Graph Cuts for the Boykov-Kolmogorov Algorithm

arXiv:2605.13402v2 Announce Type: replace Abstract: Computing a minimum $s$-$t$ cut in a graph is a solution to a wide range of computer vision problems and is often done using the Boykov-Kolmogorov (BK) algorithm. In this paper, we revisit the BK algorithm from both a theoretica…

本文如何被排名

报道来源 [1]

Fast and Compact Graph Cuts for the Boykov-Kolmogorov Algorithm

相关实体

相关话题