Segmentation by watersheds: definition and parallel implementation
Jos B. T. M. Roerdink and Arnold Meijster. Segmentation by watersheds: definition and parallel implementation. In: Advances in Computer Vision, F. Solina, W.G. Kropatsch, R. Klette and Ruzena Bajcsy (eds.), pp. 21--30, Springer, 1997.
The watershed algorithm is a method for image segmentation widely used in the area of mathematical morphology. In this paper we first address the problem of how to define watersheds. It is pointed out that various existing definitions are not equivalent. In particular we explain the differences between the recursive definition, a modification of this definition necessary to avoid relabelling of watershed pixels, and the definition based on shortest paths with respect to a certain grey-value distance function. The sequential implementation of both algorithms is discussed. Finally we sketch parallel implementations of the two watershed algorithms on a MIMD ring-architecture, and a Cray J932 shared memory computer, respectively.
Download in gzipped postscript format© Computing. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the publisher.
This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.