Abstract
Among the many existing multiresolution algorithms, the scale-space approach offers the benefits of strong mathematical and biological foundation and excellent results, but the serious drawback of a heavy computational load. Parallel implementation of this category of algorithms has never been attempted. This article presents a first experiment, using the multiresolution watershed segmentation as algorithm, and an 8-node Beowulf network as hardware platform. First, the classical approach is followed whereby the image is divided in several regions that are separately allocated to different nodes. Each node performs all the calculations for his region, at any level of resolution. Next, a truly multiresolution approach is followed, allocating the workload to the processors per resolution levels. Each node is allocated a number of resolution levels in the scale space, and performs the calculations over the whole image for the particular resolution levels assigned to it. The implementation in the latter approach is clearly much more straightforward, and its performance is also clearly superior. Although the experiments using the region-wise assignment were only done by splitting up the image in rows, and not in columns or in quadrants, the difference in the results is so dramatic that the conclusions can easily be generalized, pointing to the fact that scale space algorithms should be paralellised per resolution level and not per image region.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Bister, M., Cornelis, J., Rosenfeld, A.: A critical view on pyramid segmentation algorithms. Pattern Recognition Letters 11, 605–617 (1990)
Florack, L.M.J.: Image Structure. Computational Imaging and Vision Series. Kluwer Academic Publishers, Dordrecht (1997)
Gropp, W., Huss-Lederman, S., Lumsdaine, A., Lusk, E., Nitzberg, B., Saphir, W., Snir, M.: MPI- The Complete Reference. The MPI Extensions, vol. 2. The MIT Press, Cambridge (1998)
ter Haar Romeny, B.M. (ed.): Front-End Vision and Multiscale Image Analysis. Kluwer Academic Publishers, Dordrecht (2003)
ter Haar Romeny, B.M. (ed.): Geometry-Driven Diffussion in Computer Vision. Kluwer Academic Publishers, Dordrecht (1994)
Snir, M., Otto, S., Huss-Lederman, S., Walker, D., Dongarra, J.: MPI – The Complete Reference, 2nd edn. The Core, vol. 1. The MIT Press, Cambridge (1998)
Sporing, J., Nielsen, M., Florack, L., Johansen, P. (eds.): Gaussian Scale-Space. Kluwer Academic Publishers, Dordrecht (1996)
Sterling, T.L., Salmon, J., Becker, D.J., Savarese, D.F.: How to Build a Beowulf Cluster: A guide to the Implementation and Application of PC Clusters. The MIT Press, Cambridge (1998)
Wilkinson, B., Allen, M.: Parallel Programming: Techniques and Applications using Networked Workstations and Parallel Computers. Prentice Hall, New Jersey (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ishar, S., Bister, M. (2003). Multiresolution Watershed Segmentation on a Beowulf Network. In: Kosch, H., Böszörményi, L., Hellwagner, H. (eds) Euro-Par 2003 Parallel Processing. Euro-Par 2003. Lecture Notes in Computer Science, vol 2790. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45209-6_89
Download citation
DOI: https://doi.org/10.1007/978-3-540-45209-6_89
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40788-1
Online ISBN: 978-3-540-45209-6
eBook Packages: Springer Book Archive