Abstract
Boundary-based interactive image segmentation methods aim to build a closed contour, very often using paths linking a set of user-provided landmark points, ordered along the contour of the object of interest. Among these methods, the geodesically-linked active contour (GLAC) model generates a piecewise-geodesic curve, by linking each pair of successive landmark points by a geodesic curve. As an important shortcoming, the geodesically linked active contour model in its initial formulation does not guarantee the curve to be simple. It may have multiple points, creating self-tangencies and self-intersections, which is inconsistent with respect to the purpose of segmentation. To overcome this issue, we study some properties of non-simple closed curves and introduce a novel energy term to quantity the amount of non-simplicity. We propose to extract a relevant contour from a set of possible paths, such that the resulting structure fits the image data and is simple. We develop a local search method to choose the best combination among possible paths, integrating the novel energy term.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
Notes
- 1.
See detailed proof in appendix B.
References
Adams, C.: The Knot Book: An Elementary Introduction to the Mathematical Theory of Knots. American Mathematical Society, Williamstown (2004)
Appia, V., Yezzi, A.: Active geodesics: region-based active contour segmentation with a global edge-based constraint. In: IEEE International Conference on Computer Vision (ICCV), Barcelona, Spain, pp. 1975–1980 (2011)
Benmansour, F., Cohen, L.: Fast object segmentation by growing minimal paths from a single point on 2D or 3D images. J. Math. Imaging Vis. 33(2), 209–221 (2009)
Caselles, V., Kimmel, R., Sapiro, G.: Geodesic active contours. Int. J. Comput. Vis. 22(1), 61–79 (1997)
Chan, T., Vese, L.: Active contours without edges. IEEE Trans. Image Process. 10(2), 266–277 (2001)
Cohen, L., Kimmel, R.: Global minimum for active contour models: a minimal path approach. Int. J. Comput. Vis. 24(1), 57–78 (1997)
Falcão, A., Stolfi, J., Lotufo, R.: The image foresting transform: theory, algorithms, and applications. IEEE Trans. Pattern Anal. Mach. Intell. 26(1), 19–29 (2004)
Falcão, A., Udupa, J., Miyazawa, F.: An ultra-fast user-steered image segmentation paradigm: live wire on the fly. IEEE Trans. Med. Imaging 19(1), 55–62 (2000)
Gérard, O., Deschamps, T., Greff, M., Cohen, L.D.: Real-time interactive path extraction with on-the-fly adaptation of the external forces. In: Heyden, A., Sparr, G., Nielsen, M., Johansen, P. (eds.) ECCV 2002, Part III. LNCS, vol. 2352, pp. 807–821. Springer, Heidelberg (2002)
Kaul, V., Yezzi, A., Tsai, Y.: Detection of curves with unknown endpoints and arbitrary topology using minimal paths. IEEE Trans. Pattern Anal. Mach. Intell. 34(10), 1952–1965 (2012)
Michailovich, O., Rathi, Y., Tannenbaum, A.: Image segmentation using active contours driven by the Bhattacharyya gradient flow. IEEE Trans. Image Process. 16(11), 2787–2801 (2007)
Mille, J.: Narrow band region-based active contours and surfaces for 2D and 3D segmentation. Comput. Vis. Image Underst. 113(9), 946–965 (2009)
Mille, J., Cohen, L.D.: Geodesically linked active contours: evolution strategy based on minimal paths. In: Tai, X.-C., Mørken, K., Lysaker, M., Lie, K.-A. (eds.) SSVM 2009. LNCS, vol. 5567, pp. 163–174. Springer, Heidelberg (2009)
Miranda, P., Falcão, A., Spina, T.: Riverbed: a novel user-steered image segmentation method based on optimum boundary tracking. IEEE Trans. Image Process. 21(6), 3042–3052 (2012)
Mortensen, E., Barrett, W.: Interactive segmentation with intelligent scissors. Graph. Model. Image Process. 60(5), 349–384 (1998)
Rother, C., Kolmogorov, V., Blake, A.: Grabcut: interactive foreground extraction using iterated graph cuts. ACM Trans. Graph. 23(3), 309–314 (2004)
Sethian, J.: A fast marching level set method for monotonically advancing fronts. Proc. Natl. Acad. Sci. 93(4), 1591–1595 (1996)
Tsitsiklis, J.: Efficient algorithms for globally optimal trajectories. IEEE Trans. Autom. Contr. 40(9), 1528–1538 (1995)
Whitney, H.: On regular closed curves in the plane. Compos. Math. 4, 276–284 (1937)
Williams, D., Shah, M.: A fast algorithm for active contours and curvature estimation. Comput. Vis. Graph. Image Process. Image Underst. 55(1), 14–26 (1992)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Appendices
Appendix
A Self-Overlap Term
Let \(\mathcal {C}\) be a regular curve parameterized over [0, L]. Let \(\phi \) be a \(C^1\) function defined over \([0,L]^2\) representing the distance between two positions on the curve:
where p is an arbitrary positive real exponent. The length of the zero level set of \(\phi _\mathcal {C}\),
quantifies the self-overlap of \(\mathcal {C}\).
Proposition: If \(\mathcal {C}\) is simple, i.e. without self-intersection and self-tangency, then \(\left| \mathcal {Z}_\mathcal {C}\right| = L\sqrt{2}\)
Proof: As a preliminary calculation, let us express the gradient of \(\phi \) (partial derivatives are written using the indexed notation):
If \(\mathcal {C}\) is regular and simple, varying with respect to u in range [0, L], \(\phi (u,v)\) is nowhere zero except when \(u=v\). Hence, for a fixed v, we have:
Integrating (10) into (9) and applying the definition of measure \(\delta \):
Trivially, \(\phi (v,v)=0\). However expanding the gradient gives:
B Exteriority Term
Let \(\mathcal {C}\) be a piecewise-smooth regular curve parameterized over [0, 1],
If it is simple and positively oriented such that normal vector \({\mathcal {C}}'^\perp \) points inward, its inner area may be expressed using Green’s theorem:
When one calculates the previous expression on a non-simple closed curve, one gets the signed area, in which positively and negatively oriented connected components have positive and negative contributions, respectively.
Proposition: The signed area formed by an open curve \(\mathcal {C}\) over [0, 1] and the line segment from \(\mathcal {C}(1)\) returning to \(\mathcal {C}(0)\) (see Fig. 7), which we use to as the exteriority measure in the paper, may be expressed as:
Proof: Let S be the parametrization of the line segment joining \(\mathcal {C}(1)\) and \(\mathcal {C}(0)\), over [0, 1]:
The signed area is then obtained by applying Green’s theorem on a piecewise basis:
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Mille, J., Bougleux, S., Cohen, L.D. (2015). Combination of Piecewise-Geodesic Curves for Interactive Image Segmentation. In: Boissonnat, JD., et al. Curves and Surfaces. Curves and Surfaces 2014. Lecture Notes in Computer Science(), vol 9213. Springer, Cham. https://doi.org/10.1007/978-3-319-22804-4_25
Download citation
DOI: https://doi.org/10.1007/978-3-319-22804-4_25
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-22803-7
Online ISBN: 978-3-319-22804-4
eBook Packages: Computer ScienceComputer Science (R0)