Abstract
Parallelisation of the watershed segmentation method is studied in this paper. Starting with a successful parallel watershed design solution, extensive tests on various parallel machines are presented to prove its portability and performance. Next, the watershed algorithm has been re-formulated as a modified connected component problem. Consequently, we present a scalable parallel implementation of the connected component problem, which is the key for the future improving of the parallel design for the watershed algorithm.
We acknowledge the High Performance Computing Center Stuttgart for granting us the use of the Cray T3E parallel computer, as well as all firms through which the results included in this report were made possible.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
H. M. Alnuweiri and V. K. Prasanna. Parallel architectures and algorithms for image component labeling. IEEE Trans. on Pattern Analysis and Machine Intelligence, 14(10):1014–1034, October 1992.
D. A. Bader and J. JáJá. Parallel algorithms for image histogramming and connected components with an experimental study. Journal of Parallel and Distributed Computing, 35(2):173–190, June 1996.
D. A. Bader, J. JáJá, D. Harwood, and L. S. Davis. Parallel algorithms for image enhancement and segmentation by region growing with an experimental study. Journal of Supercomputing, 10(2):141--468, 1996.
K. P. Belkhale and P. Banerjee. Parallel algorithms for geometric connected component labeling on a hypercube multiprocessor. IEEE Transactions on Computers, 41(6):699–709, June 1992.
S. Beucher and F. Meyer. The morphological approach to segmentation: The watershed transformation. In E.R. Dougherty, editor, Mathematical Morphology in Image Processing, pages 433–481, N.Y., 1993. Marcel Dekker Inc.
A. Bieniek, H. Burkhardt, H. Marschner, M. Nöelle, and G. Schreiber. A parallel watershed algorithm. In Proceedings of 10th Scandinavian Conference on Image Analysis, pages 237–244, Lappeenranta, Finland, June 1997.
A. Bieniek and A. Moga. A connected component approach to the watershed segmentation. In Mathematical Morphology and its Applications to Image and Signal Processing, volume 12 of Computational Imaging and Vision, pages 215–222. Kluwer Academic Publishers, 1998.
A. Choudhary and R. Thakur. Connected component labeling on coarse grain parallel computers: an experimental study. Journal of Parallel and Distributed Computing, 20(1):78–83, January 1994.
H. Embrechts. MIMD Divide-and-Conquer algorithms for geometric operations on binary images. PhD thesis, Department of Computer Science, Katholieke Universiteit Leuven, Belgium, March 1994.
H. Embrechts, D. Roose, and P. Wambacq. Component labelling on a MIMD multiprocessor. CVGIP: Image Understanding, 57(2):155–165, March 1993.
Message Passing Interface Forum. MPI: A message-passing interface standard. Technical report, University of Tennessee, Knoxville, Tennessee, June 1995. Version 1.1.
R.M. Haralick and L.G. Shapiro. Image segmentation technique. Computer Vision, Graphics, and Image Processing, 29:100–132, 1985.
T. Johansson. Image Analysis Algorithms on General Purpose Parallel Architectures. Ph.D. thesis, Centre for Image Analysis, University of Uppsala, Uppsala, 1994.
T. Johansson and E. Bengtsson. A new parallel MIMD connected component labeling algorithm. In PARLE: Parallel Architectures and Languages Europe, pages 801–804. LNCS, Springer-Verlag, 1994.
T. Kanade. Survey, region segmentation: Signal vs semantics. CVGIP, 13(4):279–297, August 1980.
R. Lumia, L. Shapiro, and O. Zuniga. A New Connected Components Algorithm for Virtual Memory Computers. Computer Vision, Graphics, and Image Processing, 22(2):287–300, 1983.
F. Meyer. Integrals, gradients and watershed lines. In Proceedings of Workshop on Mathematical Morphology and its Applications to Signal Processing, pages 70–75, Barcelona, Spain, May 1993.
F. Meyer. Topographic distance and watershed lines. Signal Processing, 38(1):113–125, July 1994.
F. Meyer and S. Beucher. Morphological segmentation. Journal of Visual Communication and Image Representation, 1(1):21–46, September 1990.
R. Miller and Q. F. Stout. Parallel Algorithms for Regular Architectures: Meshes and Pyramids. MIT Press, Cambridge Massachusetts, London England, 1996.
A. Moga. Parallel Watershed Algorithms for Image Segmentation. PhD thesis, Tampere University of Technology, Tampere, Finland, February 1997.
A.N. Moga and M. Gabbouj. Parallel image component labeling with watershed transformation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 19(5):441–450, May 1997.
N.R. Pal and S.K. Pal. A review on image segmentation techniques. Pattern Recognition, 26(9):1277–1294, 1993.
A. Rosenfeld and J. L. Pfaltz. Sequential operations in digital picture processing. Journal of the ACM, 13(4):471–494, October 1966.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lindner, A., Bieniek, A., Burkhardt, H. (1999). PISA—Parallel Image Segmentation Algorithms. In: Krause, E., Jäger, W. (eds) High Performance Computing in Science and Engineering ’98. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-58600-2_39
Download citation
DOI: https://doi.org/10.1007/978-3-642-58600-2_39
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-63661-5
Online ISBN: 978-3-642-58600-2
eBook Packages: Springer Book Archive