English(EN) Playing with Kruskal: algorithms for flat and hierarchical watershed cuts

新论文详解分层分水岭分割算法

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

本文提出了一种使用边加权图算法计算分层分水岭分割的综合流程。它回顾了现有文献，并详细介绍了从基于图的图像表示到连通分量计算的逐步过程。该工作旨在整合各种分水岭概念和算法，包括监督和无监督版本，以便于实现和应用。 AI

影响为分水岭分割算法提供了一个整合的参考，可能有助于计算机视觉领域的研究人员。

排序理由该集群包含一篇 arXiv 的学术论文提交。[lever_c_demoted from research: ic=1 ai=0.7]

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

本文如何被排名

Signal score: 3 / 100; Composite score across the factors below. Higher = stronger signal that this story matters right now.
Newsworthiness bucket: Tool; 该集群包含一篇 arXiv 的学术论文提交。[lever_c_demoted from research: ic=1 ai=0.7]
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, other; 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.

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

arXiv cs.CV TIER_1 English(EN) · Jean Cousty (LIGM), Laurent Najman (KUSTAR, LIGM), Benjamin Perret (LIGM), Deise Santana Maia (CRIStAL) · 2026-10-08 04:00

玩转Kruskal：用于平面和分层分水岭切割的算法

arXiv:2610.10012v1 Announce Type: new Abstract: In the framework of edge-weighted graphs, watersheds have proven to be linked to well-known optimization problems, as Minimum Spanning Tree, which allowed the design of efficient algorithms for computing (hierarchical) watershed seg…