.png){kind=icon}
返回
An efficient watershed algorithm based on connected components
.png){kind=icon}
PRE
AI
DOI：10.1016/S0031-3203(99)00154-5.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, a formal definition and a new algorithmic technique for the watershed transformation is presented. The novelty of the approach is to adapt the connected component operator to solve the watershed segmentation problem. The resulting algorithm is independent of the number of grey-levels, employs simple data structures, requires less error prone memory management, and issues a lower complexity and a short running time. However, the algorithm does not modify the principle of the watershed segmentation; the output result is the same as that of using any traditional algorithm which does not build watershed lines. (C) 2000 Pattern Recognition Society. Published by Elsevier Science Ltd. All rights reserved.
Keyword:
watersheds
image segmentation
connected components
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.6
论文数:
1.4W
被引数:
5.0W
机构
暂无机构信息
引用论文
Recognition of hemi-methylated DNA by the SRA protein UHRF1 by a base-flipping mechanism.png)
Nature
NatureIF48.5
PREAI
分享收藏
没有更多内容
没有更多内容