.png){kind=icon}
Return
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}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
watersheds
image segmentation
connected components
Journal
IF:
7.6
Papers:
1.4W
Citations:
5.0W
Organization
No organization information available
Cited Papers
ShareSaveRecognition of hemi-methylated DNA by the SRA protein UHRF1 by a base-flipping mechanism.png)
Nature
NatureIF48.5
PREAI
ShareSave
ShareSave
ShareSave no more
no more