Multi-object convexity shape prior for segmentation

5Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Convexity is known as an important cue in human vision and has been recently proposed as a shape prior for segmenting a single foreground object. We propose a mutli-object convexity shape prior for multilabel image segmentation. We formulate a novel multilabel discrete energy function. To optimize our energy, we extend the trust region optimization framework recently proposed in the context of binary optimization. To that end we develop a novel graph construction. In addition to convexity constraints, our model includes L1 color separation term between the background and the foreground objects. It can also incorporate any other multilabel submodular energy term. Our formulation can be used to segment multiple convex objects sharing the same appearance model, or objects consisting of multiple convex parts. Our experiments demonstrate general usefulness of the proposed convexity constraint on real image segmentation examples.

Cite

CITATION STYLE

APA

Gorelick, L., & Veksler, O. (2018). Multi-object convexity shape prior for segmentation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10746 LNCS, pp. 455–468). Springer Verlag. https://doi.org/10.1007/978-3-319-78199-0_30

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free