Combination of piecewise-geodesic curves for interactive image segmentation
Mille, Julien; Bougleux, Sébastien; Cohen, Laurent D. (2014), Combination of piecewise-geodesic curves for interactive image segmentation, in Boissonnat, Jean-Daniel; Cohen, Albert; Gibaru, Olivier; Gout, Christian; Lyche, Tom; Mazure, Marie-Laurence; Schumaker, Larry L., Curves and Surfaces 8th International Conference, Paris, France, June 12-18, 2014, Revised Selected Papers, Springer : Berlin Heidelberg, p. 341-356. 10.1007/978-3-319-22804-4
Type
Communication / ConférenceExternal document link
https://hal.archives-ouvertes.fr/hal-01100406Date
2014Conference title
8th International Conference on Curves and SurfacesConference date
2014-06Conference city
ParisConference country
FranceBook title
Curves and Surfaces 8th International Conference, Paris, France, June 12-18, 2014, Revised Selected PapersBook author
Boissonnat, Jean-Daniel; Cohen, Albert; Gibaru, Olivier; Gout, Christian; Lyche, Tom; Mazure, Marie-Laurence; Schumaker, Larry L.Publisher
Springer
Published in
Berlin Heidelberg
ISBN
978-3-319-22803-7
Pages
341-356
Publication identifier
Metadata
Show full item recordAbstract (EN)
Minimum cost paths have been extensively studied theoretical tools for interactive image segmentation. The existing geodesically linked active contour (GLAC) model, which basically consists of a set of vertices connected by paths of minimal cost, blends the benefits of minimal paths and region-based active contours. This results in a closed piecewise-smooth curve, over which an edge or region energy functional can beformulated. As an important shortcoming, the GLAC in its initial formulation does not guarantee the curve to be simple, consistent with respect to the purpose of segmentation. In this paper, we draw our inspiration from the GLAC and other boundary-based interactive segmentation algorithms, in the sense that we aim to extract a contour given a set of user-provided points, by connecting these points using paths. The key idea isto select a combination among a set of possible paths, such that the resulting structure represents a relevant closed curve. Instead of considering minimal paths only, we switch to a more general formulation, which we refer to as admissible paths. These basically correspond tothe roads travelling along the bottom of distinct valleys between given endpoints. We introduce a novel term to favor the simplicity of the generated contour, as well as a local search method to choose the best combination among possible paths.Subjects / Keywords
image segmentation methodsRelated items
Showing items related by title and author.
-
Mille, Julien; Bougleux, Sébastien; Cohen, Laurent D. (2015) Article accepté pour publication ou publié
-
Cohen, Laurent D.; Mille, Julien; Bougleux, Sébastien (2014) Communication / Conférence
-
Cohen, Laurent D.; Bougleux, Sébastien; Mille, Julien (2013) Communication / Conférence
-
Bougleux, Sébastien; Peyré, Gabriel; Cohen, Laurent D. (2009) Communication / Conférence
-
Ben Sbeh, Zakaria; Cohen, Laurent D.; Coscas, Gabriel; Mimoun, Gérard (2001) Article accepté pour publication ou publié