Abstract
This paper defines floodings on edge weighted and on node weighted graphs. Of particular interest are the highest floodings of a graph below a ceiling function defined on the nodes. It is shown that each flooding on a node weighted graph may be interpreted as a flooding on an edge weighted graphs with appropriate weights on the edges. The highest flooding of a graph under a ceiling function is then interpreted as a shortest distance on an augmented graph, using the ultrametric distance function. Thanks to this remark, the classical shortest distance algorithms may be used for constructing floodings.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Gondran, M., Minoux, M.: Graphes et Algorithmes. Eyrolles (1995)
Klein, J.: Conception et Réalisation d’une unité logique pour l’analyse quantitative d’images. PhD thesis, University of Nancy (1976)
Meyer, F.: The levelings. In: Heijmans, H., Roerdink, J. (eds.) Mathematical Morphology and Its Applications to Image Processing, pp. 199–207. Kluwer (1998)
Meyer, F.: Flooding and segmentation. In: Goutsias, J., Vincent, L., Bloomberg, D.S. (eds.) Mathematical Morphology and its Applications to Image and Signal Processing. Computational Imaging and Vision, vol. 18, pp. 189–198 (2002)
Moore, E.F.: The shortest path through a maze. In: Proc. Int. Symposium on Theory of Switching, vol. 30, pp. 285–292 (1957)
Salembier, P., Serra, J.: Flat zones filtering, connected operators and filters by reconstruction. IEEE Transactions on Image Processing 3(8), 1153–1160 (1995)
Serra, J. (ed.): Image Analysis and Mathematical Morphology. II: Theoretical Advances. Academic Press, London (1988)
Vincent, L.: Morphological grayscale reconstruction in image analysis: Applications and efficient algorithms. IEEE Trans. in Image Procesing, 176–201 (1993)
Vachier, C., Vincent, L.: Valuation of image extrema using alternating filters by reconstruction. In: Proc. SPIE Image Algebra and Morphological Processing, San Diego CA (July 1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Meyer, F. (2013). Flooding Edge or Node Weighted Graphs. In: Hendriks, C.L.L., Borgefors, G., Strand, R. (eds) Mathematical Morphology and Its Applications to Signal and Image Processing. ISMM 2013. Lecture Notes in Computer Science, vol 7883. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38294-9_29
Download citation
DOI: https://doi.org/10.1007/978-3-642-38294-9_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38293-2
Online ISBN: 978-3-642-38294-9
eBook Packages: Computer ScienceComputer Science (R0)