Abstract
This paper characterizes floodings on edge weighted graphs. Of particular interest are the highest floodings of a graph below a ceiling function defined on the nodes. Two classes of algorithms for their construction are presented. The first are applied on the dendrogram representing the hierarchy associated to the edge weighted graph. The second consist in shortest distance algorithms on the graph itself.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
Marcotegui, B., Beucher, S.: Fast implementation of waterfalls based on graphs. In: ISMM05: Mathematical Morphology and its Applications to Signal Processing, pp. 177–186 (2005)
Cousty, J., Bertrand, G., Najman, L., Couprie, M.: Watershed cuts: Minimum spanning forests and the drop of water 1principle. IEEE Transactions on Pattern Analysis and Machine Intelligence 31, 1362–1374 (2009)
Meyer, F.: Minimal spanning forests for morphological segmentation. In: ISMM94: Mathematical Morphology and its Applications to Signal Processing, pp. 77–84 (1994)
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)
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 Weighted Graphs. In: Kropatsch, W.G., Artner, N.M., Haxhimusa, Y., Jiang, X. (eds) Graph-Based Representations in Pattern Recognition. GbRPR 2013. Lecture Notes in Computer Science, vol 7877. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38221-5_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-38221-5_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38220-8
Online ISBN: 978-3-642-38221-5
eBook Packages: Computer ScienceComputer Science (R0)