Abstract
The concept of graph contraction was developed with the intention to structure and describe the image segmentation process. We consider this concept to describe a new technique of crest lines detection based on a definition of water-parting (or watershed). This technique allows to localize the basins delimited by these lines. The localization process uses the concept of ascending path. A structure of oriented graph is defined on original image. We give some definitions we use for this process. Before presenting the contraction algorithm, a pretreatment on the oriented original graph is necessary to make it complete. We show the algorithm resultson simple image examples.
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
Kropatsch, W.G.: Building Irregular Pyramids by Dual Graph Contraction. IEE-Proc. Vision,Image and Signal Processing 142(6), 336–348 (1995)
Kropatsch, W.G., Ben Yacoub, S.: Universal Segmentation with PIRRAMIDS. In: 20th Workshop of the Austrian Association for Pattern Recognition (ÖAGM/AAPR), pp. 171–182 (1996)
Beucher, S., Lantuéjoul, C.: Use ofWatersheds in Contour Detection. In: Int’l Workshop Image Processing, Real-Time Edge and Motion Detection/Estimation, Rennes, Paris, pp. 17–21 (1979)
Digabel, H., Lantuéjoul, C.: Iterative Algorithms. In: Second European Symp. Quantitaive Analysis of Microstructures in Material Science, Biology and Medicine, pp. 85–99. Rieder, Stuttgart (1978)
Vincent, L.: Algorithmes Morpholgiques á base de Files d’Attente et de Lacets: Extension aux Graphes. Thése de doctorat, Ecole des Mines, Paris, France (1990)
Vincent, L., Soille, P.: Wtersheds in Digital Spaces: An Efficient Algorithm Based on Immersion Simulations. IEEE Trans. Pattern Analysis and Machine Intelligence 13(6), 583–598 (1991)
Soille, P.: Morphological Image Analysis: principles and Applications. Springer, Heidelberg (1999)
Macho, H., Kropatsch, W.G.: Finding Connected Components with Dual Irregular Pyramids. In: Proc. of 19th ÖAGM and 1st SDVR Workshop, Solina, F. and Kropatsch, W.G., pp. 313–321 (1995)
Beucher, S.: Segmentation d’images et morphologie mathématique. Thèse Doctorat: Ecole Nationale Supérieure des Mines de Paris, 295p (1990)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Selmaoui, N. (2005). Algorithm for Crest Detection Based on Graph Contraction. In: Marques, J.S., Pérez de la Blanca, N., Pina, P. (eds) Pattern Recognition and Image Analysis. IbPRIA 2005. Lecture Notes in Computer Science, vol 3523. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11492542_38
Download citation
DOI: https://doi.org/10.1007/11492542_38
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26154-4
Online ISBN: 978-3-540-32238-2
eBook Packages: Computer ScienceComputer Science (R0)