Share Email Print

Proceedings Paper

Fast watershed algorithms: analysis and extensions
Author(s): Bogdan Paul Dobrin; Timo J. Viero; Moncef Gabbouj
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

Watershed transformation is used in morphological image segmentation. This transformation could be considered as a topographic region growing method. Recently, fast watershed algorithms have been proposed for general purpose computers. They are based on immersion simulations of the image surface, which is considered as a topographic relief. In such a model, the greylevel values of pixels stand for altitude values on the relief. In this paper, the operation of the present fast watershed algorithms is analyzed and a new extension is proposed. Drawbacks of the present algorithms are pointed out, studied, and illustrated with test images. These problems lead, in several cases, to a loss of information about image details and structures or even to unprocessed areas in the image. The new watershed algorithm overcomes these deficiencies and preserves more information about image details. The new algorithm is based on a split-and-merge scheme. It constantly monitors the presence of isolated areas during the immersion simulation, considering them as new catchment basins. Application of the split-and-merge watershed algorithm to marker-based image segmentation is discussed.

Paper Details

Date Published: 1 May 1994
PDF: 12 pages
Proc. SPIE 2180, Nonlinear Image Processing V, (1 May 1994); doi: 10.1117/12.172559
Show Author Affiliations
Bogdan Paul Dobrin, Tampere Univ. of Technology (Finland)
Timo J. Viero, Tampere Univ. of Technology (Finland)
Moncef Gabbouj, Tampere Univ. of Technology (Finland)

Published in SPIE Proceedings Vol. 2180:
Nonlinear Image Processing V
Edward R. Dougherty; Jaakko Astola; Harold G. Longbotham, Editor(s)

© SPIE. Terms of Use
Back to Top