Abstract
In this paper, we present parallel implementations of connected operators. These kind of operators have been recently defined in mathematical morphology and have attracted a large amount of research due to their efficient use in image processing applications where contour information is essential (image segmentation, pattern recognition ...).
In this work, we focus on connected transformations based on geodesic reconstruction process and we present parallel algorithms based on irregular data structures. We show that the parallelization poses several problems which are solved by using appropriate communication schemes as well as advanced data structures.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Serra, J.: Image Analysis and Mathematical Morphology. Academic Press, London (1982)
Serra, J., Salembier, P.: Connected Operators and Pyramids. In: Proceedings SPIE Image Algebra and Mathematical Morphology, San Diego, vol. 2030. pp. 65–76 (1993)
Vincent, L.: Morphological Grayscale Reconstruction in Image Analysis: Applicationsand Efficient Algorithms. IEEE Trans. on Image Proc. 2(2), 176–201 (1993)
Salembier, P., Serra, J.: Flat Zones Filtering,Connected Operators and Filters by Reconstruction. IEEE Trans. on Image Proc. 4(8), 1153–1160 (1995)
Crespo, J., Serra, J., Schafer, R.W.: Theoretical Aspects of Morphological Filters by Reconstruction. Signal Processing 47, 201–225 (1995)
Meyer, F., Oliveras, A., Salembier, P., Vachier, C.: Morphological Tools for Segmentation: Connected Filters and Watersheds. Annales des Télécommunications 52(7-8), 367–379 (1997)
Salembier, P.: Morphological Multiscale Segmentation for Image Coding. Signal Processing 38, 359–386 (1994)
Salembier, P., Pardàs, M.: Hierarchical Morphological Segmentation for Image Sequence Coding. IEEE Trans. on Image Proc. 3(5), 639–651 (1994)
Gu, C.: Multivalued Morphology and Segmentation-Based Coding. PhD thesis, Ecole Polytechnique Fédérale de Lausanne (1995)
Salembier, P., Kunt, M.: Size-sensitive Multiresolution Decomposition of Images with Rank Order Filters. Signal Processing 27, 205–241 (1992)
Li, W., Haese-Coat, V., Ronsin, J.: Residues of Morphological Filtering by Reconstruction for Texture Classification. Pattern Recognition 30(7), 1081–1093 (1997)
Vincent, L.: Algorithmes Morphologiques à Base de Files d’Attente et de Lacets. Extension aux Graphes. PhD thesis, Ecole Nationale Supérieure des Mines de Paris, France (May 1990)
Moga, A.: Parallel Waterhed Algorithms for Image Segmentation. PhD thesis, Tampere University of Technology, Finland (February 1997)
Breen, E., Monro, D.H.: An Evaluation of Priority Queues for Mathematical Morphology. In: Serra, J., Soille, P. (eds.) Mathematical Morphology and Its Applications to Image Processing, pp. 249–256. Kluwer Acecdemics, Dordrecht (1994)
Message Passing Interface Forum. MPI: A Message Passing Interface Standard (May 1994)
Laurent, C.: Conception d’algorithmes parall‘eles pour le traitement d’images utilsant la morphologie mathématique. Application à la segmentation d’images. PhD thesis, Universitée de Bordeaux I (September 1998)
Pierson, J.M.: Equilibrage de charge dirigé par les données. Applications à la synth‘ese d’images. PhD thesis, Ecole normale supérieure de Lyon (October 1996)
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
Laurent, C., Roman, J. (1999). Parallel Implementations of Morphological Connected Operators Based on Irregular Data Structures. In: Hernández, V., Palma, J.M.L.M., Dongarra, J.J. (eds) Vector and Parallel Processing – VECPAR’98. VECPAR 1998. Lecture Notes in Computer Science, vol 1573. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10703040_44
Download citation
DOI: https://doi.org/10.1007/10703040_44
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66228-0
Online ISBN: 978-3-540-48516-2
eBook Packages: Springer Book Archive