This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Parallel Image Component Labeling With Watershed Transformation
May 1997 (vol. 19 no. 5)
pp. 441-450

Abstract—The parallel watershed transformation used in gray scale image segmentation is reconsidered in this paper on the basis of the component labeling problem. The main idea is to break the sequentiality of the watershed transformation and to correctly delimit the extent of all connected components locally, on each processor, simultaneously. The internal fragmentation of the catchment basins, due to domain decomposition, into smaller subcomponents is ulteriorly solved by employing a global connected components operator. Therefore, in a pyramidal structure of master-slave processors, internal contours of adjacent subcomponents within the same component are hierarchically removed. Global final connected areas are efficiently obtained in log2N steps on a logical grid of N processors. Timings and segmentation results of the algorithm built on top of the Message Passing Interface (MPI) and tested on the Cray T3D are brought forward to justify the superiority of the novel design solution compared against previous implementations.

[1] H.M. Alnuweiri and V.K.P. Kumar, "Fast Image Labeling Using Local Operators on Mesh-Connected Computer," IEEE Trans. PAMI, Vol. 13, No. 2, Feb. 1991, pp. 202-207.
[2] H.M. Alnuweiri and V.K. Prasanna, "Parallel Architectures and Algorithms for Image Component Labeling," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 14, no. 10, pp. 1,014-1,034, Oct. 1992.
[3] D.A. Bader and J. Jájá, "Parallel Algorithms for Image Histogramming and Connected Components With an Experimental Study," J. Parallel and Distributed Computing, vol. 35, no. 2, pp. 173-190, June 1996.
[4] 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," J. Supercomputing, vol. 10, no. 2, pp. 141-168, 1996.
[5] S. Beucher, Segmentation d'images et morphologie mathématique. PhD thesis, School of Mines, Paris, June 1990.
[6] S. Beucher, J. M. Blosseville, and F. Lenoir, "Traffic Spatial Measurements Using Video Image Processing," Proc. SPIE, Advances in Intelligent Robotics Systems (Cambridge Symp. Optical and Optoelectronic Eng.),Cambridge, Mass., Nov. 1987.
[7] S. Beucher and F. Meyer, "The Morphological Approach to Segmentation: The Watershed Transformation," E.R. Dougherty, ed., Mathematical Morphology in Image Processing.New York: Marcel Dekker Inc., 1993, pp. 433-481.
[8] A. Choudhary and R. Thakur, "Connected Component Labeling on Coarse Grain Parallel Computers: An Experimental Study," J. Parallel and Distributed Computing, vol. 20, no. 1, pp. 78-83, 1994.
[9] N. Copty, S. Ranka, G. Fox, and R.V. Shankar, "A Data Parallel Algorithm for Solving the Region Growing Problem on the Connection Machine," J. Parallel and Distributed Computing, vol. 21, no. 1, pp. 160-168, 1994.
[10] T.H. Cormen, C.E. Leiserson, and R.L. Rivest, Introduction to Algorithms.Cambridge, Mass.: MIT Press, 1990.
[11] R.E. Cypher, J.L. Sanz, and L. Snyder, "An EREW PRAM Algorithm for Image Component Labeling," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 11, no. 3, pp. 258-262, Mar. 1989.
[12] R.E. Cypher, J.L. Sanz, and L. Snyder, "Algorithms for Image Component Labeling on SIMD Mesh-Connected Computers," IEEE Transactions on Computers, vol. 39, no. 2, pp. 276-281, Feb. 1990.
[13] B.P. Dobrin, T. Viero, and M. Gabbouj, "Fast Watershed Algorithms: Analysis and Extensions," E.R. Dougherty, J. Astola, and H.G. Longbotham, eds., Proc. SPIE Nonlinear Image Processing 5, vol. 2,180, pp. 209-220,San Jose, Calif., Feb. 1994.
[14] H. Embrechts, D. Roose, and P. Wambacq, "Component Labelling on a MIMD Multiprocessor," CVGIP: Image Understanding, vol. 57, no. 2, pp. 155-165, Mar. 1993.
[15] Message Passing Interface Forum, "MPI: A Message-Passing Interface Standard," technical report, Version 1.0, Univ. of Tennessee, Knoxville, May 1994.
[16] Message Passing Interface Forum, "MPI: A Message-Passing Interface Standard," technical report, Version 1.1, Univ. of Tennessee, Knoxville, June 1995.
[17] F. Friedlander, Le traitement morphologique d'images de cardiologie nucléaire. PhD thesis, School of Mines, Paris, Dec. 1989.
[18] S. Hambrusch, X. He, and R. Miller, "Parallel Algorithms for Gray-Scale Digitized Picture Component Labeling on a Mesh-Connected Computer," J. Parallel and Distributed Computing, vol. 20, pp. 56-68, 1994.
[19] T. Johansson, Image Analysis Algorithms on General Purpose Parallel Architectures, PhD thesis, Centre for Image Analysis, Univ. of Uppsala, Uppsala, Sweden, 1994.
[20] V. Kumar, A. Grama, A. Gupta, and G. Karypis, Introduction to Parallel Computing-Design and Analysis of Algorithms. Benjamin/Cummings Publishing Company, Inc., 1994.
[21] F. Meyer, "Un algorithme optimal de ligne de partage des eaux," Proc. Eighth Congres Reconnaissance des Formes et Intelligence Artificielle, pp. 847-857,Lyon, France, Nov. 1991.
[22] F. Meyer, "Topographic Distance and Watershed Lines," Signal Processing, vol. 38, no. 1, pp. 113-125, July 1994.
[23] F. Meyer and S. Beucher, "Morphological Segmentation," J. Visual Communication and Image Representation, vol. 1, no. 1, pp. 21-46, Sept. 1990.
[24] A.N. Moga, Parallel Watershed Algorithms for Image Segmentation, PhD thesis, Tampere Univ. of Tech nology, Tampere, Finland, Feb. 1997.
[25] A.N. Moga, B. Cramariuc, and M. Gabbouj, "An Efficient Watershed Segmentation Algorithm Suitable for Parallel Implementation," Proc. IEEE Int'l Conf. Image Processing, vol. 2, pp. 101-104,Washington, D.C., Oct. 1995. Los Alamitos, Calif.: IEEE CS Press, 1995.
[26] A.N. Moga, B. Cramariuc, and M. Gabbouj, "A Parallel Watershed Algorithm Based on Rainfalling Simulation," Proc. 12th European Conf. Circuit Theory and Design, vol. 1, pp. 339-342,Istanbul, Turkey, Aug. 1995.
[27] A.N. Moga, B. Cramariuc, and M. Gabbouj, "A Parallel Watershed Algorithm Based on the Shortest Paths Computation," P. Fritzson and L. Finmo, eds., Parallel Programming and Applications (Proc. Workshop Parallel Programming and Computation [ZEUS'95] and the Fourth Nordic Transputer Conf. [NTUG'95]), pp. 316-324,Amsterdam, The Netherlands, May 1995. IOS Press Ohmsha.
[28] A.N. Moga and M. Gabbouj, "A Parallel Marker Based Watershed Transformation," Proc. IEEE Int'l Conf. Image Processing, vol. 2, pp. 137-140,Lausanne, Switzerland, Sept. 1996. Los Alamitos, Calif.: IEEE CS Press, 1996
[29] A.N. Moga, T. Viero, B.P. Dobrin, and M. Gabbouj, "Implementation of a Distributed Watershed Algorithm," J. Serra and P. Soille, eds., Computational Imaging and Vision—Mathematical Morphology and Its Applications to Image Processing (Proc. Int'l Symp. Mathematical Morphology, Fontainebleau, France), pp. 281-288,Dordrecht, The Netherlands, Sept. 1994. Kluwer Academic Publishers.
[30] A.N. Moga, T. Viero, M. Gabbouj, M. Nölle, G. Schreiber, and H. Burkhardt, "Parallel Watershed Algorithm Based on Sequential Scannings," I. Pitas, ed., Proc. 1995 IEEE Workshop on Nonlinear Signal and Image Processing, vol. 2, pp. 991-994, Neos Marmaras, Halkidiki, Greece, June 1995.
[31] J.F. Rivest, Analyse Automatique d'Images Geologiques: Application de la Morphologie Mathematique aux Images Diagraphiques, PhD thesis, School of Mines, Paris, 1992.
[32] H. Samet and M. Tamminen, "Efficient Component Labeling of Images of Arbitrary Dimension Represented by Linear Bintrees," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 10, no. 4, pp. 579-590, July 1988.
[33] T. Viero, Algorithms for Image Sequence Filtering, Coding and Image Segmentation, PhD thesis, Tampere Univ. of Tech nology, Tampere, Finland, Jan. 1996.
[34] L. Vincent and P. Soille, "Watersheds in Digital Spaces: An Efficient Algorithm Based on Immersion Simulations," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 13, pp. 583-598, 1991.
[35] M. Willebeek-LeMair and A.P. Reeves, "Solving Nonuniform Problems on SIMD Computers: Case Study on Region Growing," J. Parallel and Distributed Computing, vol. 8, pp. 135-149, 1990.

Index Terms:
Watersheds, connected components, image segmentation, parallel computing, efficient algorithms.
Citation:
Alina N. Moga, Moncef Gabbouj, "Parallel Image Component Labeling With Watershed Transformation," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 19, no. 5, pp. 441-450, May 1997, doi:10.1109/34.589204
Usage of this product signifies your acceptance of the Terms of Use.