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:
ISSN:0031-3203, 1873-5142
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Be the first to leave a comment!
You must be logged in first