Parallel Marker-Based Image Segmentation with Watershed Transformation

Journal of Parallel and Distributed Computing

Volumn 51, Issue 1, 1998, Pages 27-45

  Moga, Alina N ^a   Gabbouj, Moncef ^b  

^a UNIVERSITY OF FREIBURG   (Germany)

^b TAMPERE UNIVERSITY OF TECHNOLOGY   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0038503472     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1006/jpdc.1998.1448     Document Type: Article

References (22)

1. Alnuweiri H., Prasanna V. Parallel architectures and algorithms for image component labeling. IEEE Trans. Pattern Anal. Mach. Intell. 14:Oct. 1992;1014-1034.
2. Beucher S., Meyer F. The morphological approach to segmentation: The watershed transformation. Mathematical Morphology in Image Processing. 1993;Dekker, New York. p. 433-481.
3. Cheriton D., Tarjan R. E. Finding minimum spanning trees. SIAM J. Comput. 5:Dec. 1976;724-742.
4. Cormen T., Leiserson C., Rivest R. Introduction to Algorithms. 1990;MIT Press, Cambridge.
5. Gibbson A., Rytter W. Efficient Parallel Algorithms. 1988;Cambridge Univ. Press, Cambridge.
6. Graham R. L., Hell P. On the history of the minimum spanning tree problem. Ann. History Comput. 7:Jan. 1985;43-57.
7. JàJà J. An Introduction to Parallel Algorithms. 1992;Addison-Wesley, Reading.
8. Jackway P. Gradient watersheds in morphological scale-space. IEEE Trans. Image Process. 5:June 1996;913-921.
9. Kumar V., Grama A., Gupta A., Karypis G. Introduction to Parallel Computing - Design and Analysis of Algorithms. 1994;Benjamin-Cummings, Redwood City.
10. Meyer F. Topographic distance and watershed lines. Signal Process. 38:July 1994;113-125.
11. Meyer F., Beucher S. Morphological segmentation. J. Visual Comm. Image Rep. 1:Sept. 1990;21-46.
12. Meyer F. Minimum spanning forests for morphological segmentation. Mathematical Morphology and Its Applications to Image Processing. 1994;Kluwer Academic, Dordrecht. p. 77-84.
13. A. N. Moga, T. Viero, M. Gabbouj, M. Nölle, G. Schreiber, H. Burkhardt, Parallel watershed algorithm based on sequential scannings, Proc. IEEE Workshop on Nonlinear Signal and Image Processing, Neos Marmaras, Halkidiki, June 1995, II, 991, 994.
14. Moga A., Gabbouj M. A parallel watershed algorithm based on the shortest paths computation. Parallel Programming and Applications. May 1995;IOS Press, Amsterdam. p. 316-324.
15. A. N. Moga, B. Cramariuc, M. Gabbouj, A parallel watershed algorithm based on rainfalling simulation, Proc. European Conference on Circuit Theory and Design, Istanbul, Turkey, August 1995, 1, 339, 342.
16. A. Moga, B. Cramariuc, M. Gabbouj, An efficient watershed segmentation algorithm suitable for parallel implementation, Proc. IEEE International Conference on Image Processing, Washington, D.C, October 1995, II, 101, 104.
17. A. N. Moga, M. Gabbouj, A parallel marker based watershed transformation, Proceedings IEEE International Conference on Image Processing, Lausanne, Switzerland, September 1996, II, 137, 140.
18. Moga A. N., Gabbouj M. Parallel image component labeling with watershed transformation. IEEE Trans. Pattern Anal. Mach. Intell. 19:May 1997;441-450.
19. Moga A. N. Parallel Watershed Algorithms for Image Segmentation. February 1997;Tampere University of Technology, Tampere.
20. Technical Report. June 1995.
21. Quinn M. J. Designing Efficient Algorithms for Parallel Computers. 1987;McGraw-Hill, New York.
22. Tarjan R. Data Structures and Network Algorithms. 1983;Society for Industrial and Applied Mathematics, Philadelphia.