.png){kind=icon}
返回
Incremental watershed cuts: Interactive segmentation algorithm with parallel strategy
.png){kind=icon}
OA
AI
DOI：10.1016/j.patrec.2024.12.005.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this article, we design an incremental method for computing seeded watershed cuts for interactive image segmentation. We propose an algorithm based on the hierarchical image representation called the binary partition tree to compute a seeded watershed cut. Additionally, we leverage properties of minimum spanning forests to introduce a parallel method for labeling a connected component. We show that those algorithms fits perfectly in an interactive segmentation process by handling user interactions, seed addition or removal, in linear time with respect to the number of affected pixels. Run time comparisons with several state-of-the-art interactive and non-interactive watershed methods show that the proposed method can handle user interactions much faster than previous methods with a significant speedup ranging from 10 to 60 on both 2D and 3D images, thus improving the user experience on large images.
Keyword:
Interactive segmentation
Watershed
Binary partition tree
Minimum spanning tree
Parallel labeling
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.3
论文数:
7.9K
被引数:
1.6W
机构
引用论文
Graph based method for cell segmentation and detection in live-cell fluorescence microscope imagingOAAI
OAAI分享收藏Markovian models and numerical analysis of computer system behavior.png)
Proceedings of the April 26-28, 1966, Spring joint computer conference on XX - AFIPS '66 (Spring)
Proceedings of the April 26-28, 1966, Spring joint computer conference on XX - AFIPS '66 (Spring)IF0
PREAI
分享收藏
查看更多内容