An efficient watershed algorithm based on connected components

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,...

Full description

Saved in:
Bibliographic Details
Published in:Pattern recognition Vol. 33; no. 6; pp. 907 - 916
Main Authors: Bieniek, A., Moga, A.
Format: Journal Article
Language:English
Published: Elsevier Ltd 01.06.2000
Subjects:
Connected components
Image segmentation
Watersheds
Image segmentation
Connected components
Watersheds
ISSN:0031-3203, 1873-5142
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0031-3203
1873-5142
DOI:10.1016/S0031-3203(99)00154-5