Contour Detection and Completion for Inpainting and Segmentation Based on Topological Gradient and Fast Marching Algorithms | Zendy

Didier Auroux | Zendy; Laurent D. Cohen | Zendy; Mohamed Masmoudi | Zendy

Open Access

Contour Detection and Completion for Inpainting and Segmentation Based on Topological Gradient and Fast Marching Algorithms

Author(s) -

Didier Auroux,

Laurent D. Cohen,

Mohamed Masmoudi

Publication year - 2011

Publication title -

international journal of biomedical imaging

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.626

H-Index - 41

eISSN - 1687-4196

pISSN - 1687-4188

DOI - 10.1155/2011/592924

Subject(s) - inpainting , fast marching method , image (mathematics) , computer science , segmentation , image segmentation , algorithm , edge detection , image gradient , artificial intelligence , path (computing) , topology (electrical circuits) , image processing , enhanced data rates for gsm evolution , computer vision , mathematics , pattern recognition (psychology) , combinatorics , programming language

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research