Date
2012
Titre de la collection
Lecture Notes in Computer Science
n° dans la collection
6667
Indexation documentaire
Probabilités et mathématiques appliquées
Subject
topological gradient; fast marching; contour completion
Titre du colloque
Third International Conference on Scale Space and Variational Methods in Computer Vision (SSVM 2011)
Date du colloque
05-2011
Ville du colloque
Ein-Gedi
Pays du colloque
Israël
Titre de l'ouvrage
Scale Space and Variational Methods in Computer Vision Third International Conference, SSVM 2011, Ein-Gedi, Israel, May 29 – June 2, 2011, Revised Selected Papers
Auteur
Bruckstein, Alfred M.; Ter Haar Romeny, Bart M.; Bronstein, Alexander M.; Bronstein, Michael M.
Nom de l'éditeur
Springer
Ville de l'éditeur
Berlin
Année
2012
Nombre total de pages
798
ISBN
978-3-642-24784-2
Auteur
Ahipo, Y.
Auroux, Didier
Cohen, Laurent D.
Masmoudi, Mohamed
Type
Communication / Conférence
Nombre de pages du document
386-397
Résumé en anglais
We combine in this paper the topological gradient, which is a powerful method for edge detection in image processing, and a variant of the minimal path method in order to find connected contours. The topological gradient provides a more global analysis of the image than the standard gradient, and identifies the main edges of an image. Several image processing problems (e.g. inpainting and segmentation) require continuous contours. For this purpose, we consider the fast marching algorithm, in order to find minimal paths in the topological gradient image. This coupled algorithm quickly provides accurate and connected contours. We present then two numerical applications, to image inpainting and segmentation, of this hybrid algorithm.
