Abstract
Watershed segmentation generally produces a severe oversegmentation. Marker based segmentation creates watershed partitions in which each region contains a marker, avoiding the oversegmentation. We obtain a coherent picture of marker based segmentation by modelling it on node or edge weighted graphs. Links are established between the methods published in the literature and some misconceptions are corrected.
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
Similar content being viewed by others
References
Beucher, S., Lantuéjoul, C.: Use of watersheds in contour detection. In: Proceedings of the International Workshop on Image Processing, Real-Time Edge and Motion Detection/Estimation (1979)
Gondran, M.: Path algebra and algorithms. In: Roy, B. (ed.) Combinatorial Programming: Methods and Applications. ASIC, vol. 19, pp. 137–148. Springer, Dordrecht (1975). https://doi.org/10.1007/978-94-011-7557-9_6
Hu, T.C.: The maximum capacity route problem. Oper. Res. 9(6), 898–900 (1961)
Lantuéjoul, C., Beucher, S.: On the use of the geodesic metric in image analysis. J. Microsc. 121, 39 (1981)
Meyer, F.: Un algorithme optimal de ligne de partage des eaux. In: Proceedings \(8^{ {\grave{e}me}}\) Congrès AFCET, Lyon-Villeurbanne, pp. 847–857 (1991)
Meyer, F.: Minimum spanning forests for morphological segmentation. In: Serra, J., Soille, P. (eds.) Mathematical Morphology and Its Applications to Image Processing. CIVI, vol. 2, pp. 77–84. Springer, Dordrecht (1994). https://doi.org/10.1007/978-94-011-1040-2_11
Meyer, F.: Flooding and segmentation. In: Goutsias, J., Vincent, L., Bloomberg, D.S. (eds.) Mathematical Morphology and its Applications to Image and Signal Processing. CIVI, vol. 18, pp. 189–198. Springer, Boston (2002). https://doi.org/10.1007/0-306-47025-X_21
Meyer, F.: Flooding edge or node weighted graphs. In: Hendriks, C.L.L., Borgefors, G., Strand, R. (eds.) ISMM 2013. LNCS, vol. 7883, pp. 341–352. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-38294-9_29
Meyer, F.: Watersheds on weighted graphs. Pattern Recognit. Lett. 47, 72–79 (2014)
Meyer, F.: Topographical Tools for Filtering and Segmentation 1: Watersheds on Node- or Edge-Weighted Graphs. ISTE/Wiley, London/Hoboken (2019)
Meyer, F.: Topographical Tools for Filtering and Segmentation 2: Floodings and Marker-Based Segmentation on Node- or Edge-Weighted Graphs. ISTE/Wiley, Etats-Unis/Newark (2019)
Meyer, F., Beucher, S.: Morphological segmentation. J. Vis. Commun. Image Represent. 1(1), 21–46 (1990)
Moore, E.F.: The shortest path through a maze. In: Proceedings of the International Symposium on Theory of Switching, vol. 30, pp. 285–292 (1957)
Vincent, L., Soille, P.: Watersheds in digitalspaces: an efficient algorithm based on immersion simulations. IEEE Trans. Pattern Anal. Mach. Intell. 1, 583 (1991)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Meyer, F. (2019). Marker Based Segmentation Revisited. In: Burgeth, B., Kleefeld, A., Naegel, B., Passat, N., Perret, B. (eds) Mathematical Morphology and Its Applications to Signal and Image Processing. ISMM 2019. Lecture Notes in Computer Science(), vol 11564. Springer, Cham. https://doi.org/10.1007/978-3-030-20867-7_26
Download citation
DOI: https://doi.org/10.1007/978-3-030-20867-7_26
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-20866-0
Online ISBN: 978-3-030-20867-7
eBook Packages: Computer ScienceComputer Science (R0)