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. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Selmaoui, N. (2005). Algorithm for crest detection based on graph contraction. In Lecture Notes in Computer Science (Vol. 3523, pp. 303–310). Springer Verlag. https://doi.org/10.1007/11492542_38
Mendeley helps you to discover research relevant for your work.