Algorithm for crest detection based on graph contraction

Authors:
Nazha Selmaoui
Affiliations:
ERIM (Equipe de Recherche en Informatique et Mathématiques), University of New Caledonia, NOUMEA, New Caledonia
Venue:
IbPRIA'05 Proceedings of the Second Iberian conference on Pattern Recognition and Image Analysis - Volume Part II
Year:
2005

Citing 3
Cited 0

Watersheds in Digital Spaces: An Efficient Algorithm Based on Immersion Simulations

IEEE Transactions on Pattern Analysis and Machine Intelligence
Universal segmentation with PIRRAMIDS

Proceedings of the 20th workshop of the Austrian Association for Pattern Recognition (OAGM/AAPR) on Pattern recognition 1996
Morphological Image Analysis: Principles and Applications

Morphological Image Analysis: Principles and Applications

Quantified Score

Hi-index	0.00

Visualization

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.