Graph signal active contours
Résumé
With the advent of data living on vertices of graphs, there is much interest in processing the so-called graph signals for partitioning tasks. As active contours have had much impact in the image processing community, their formulation on graphs is of importance to the field of graph signal processing. This paper proposes an adaptation on graphs of a model that combines the Geodesic Active Contour and the Active Contour Without Edges models. In addition, specific terms depending on graphs are introduced in the formulation. This adaptation is solved using a level set formulation with a gradient descent that can be expressed as a morphological front evolution process. Experimental results on different kinds of graphs signals show the benefit of the approach.
Fichier principal
ICPR20__home_papercept_iapr.papercept.net_www_conferences_conferences_ICPR20_submissions_0112_FI.pdf (3.91 Mo)
Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)