Date
2012
Collection title
Lecture Notes in Computer Science
Collection Id
6667
Dewey
Probabilités et mathématiques appliquées
Sujet
topological gradient; fast marching; contour completion
Conference name
Third International Conference on Scale Space and Variational Methods in Computer Vision (SSVM 2011)
Conference date
05-2011
Conference city
Ein-Gedi
Conference country
Israël
Book title
Scale Space and Variational Methods in Computer Vision Third International Conference, SSVM 2011, Ein-Gedi, Israel, May 29 – June 2, 2011, Revised Selected Papers
Author
Bruckstein, Alfred M.; Ter Haar Romeny, Bart M.; Bronstein, Alexander M.; Bronstein, Michael M.
Publisher
Springer
Publisher city
Berlin
Year
2012
Pages number
798
ISBN
978-3-642-24784-2
Author
Ahipo, Y.
Auroux, Didier
Cohen, Laurent D.
Masmoudi, Mohamed
Type
Communication / Conférence
Item number of pages
386-397
Abstract (EN)
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.
