Convexity Shape Prior for Binary Segmentation

@article{Gorelick2016ConvexitySP,
  title={Convexity Shape Prior for Binary Segmentation},
  author={Lena Gorelick and Olga Veksler and Yuri Boykov and Claudia Nieuwenhuis},
  journal={IEEE Transactions on Pattern Analysis and Machine Intelligence},
  year={2016},
  volume={39},
  pages={258-271}
}
Convexity is a known important cue in human vision. We propose shape convexity as a new high-order regularization constraint for binary image segmentation. In the context of discrete optimization, object convexity is represented as a sum of three-clique potentials penalizing any <inline-formula><tex-math notation="LaTeX">$1$</tex-math><alternatives> <inline-graphic xlink:href="veksler-ieq1-2547399.gif"/></alternatives></inline-formula>-<inline-formula> <tex-math notation="LaTeX">$0$</tex-math… CONTINUE READING
Highly Cited
This paper has 18 citations. REVIEW CITATIONS
Recent Discussions
This paper has been referenced on Twitter 9 times over the past 90 days. VIEW TWEETS

References

Publications referenced by this paper.
Showing 1-10 of 30 references

Schoenemann, “Generalized sequential treereweighted message passing,

  • T. V. Kolmogorov
  • 2012
Highly Influential
4 Excerpts

Similar Papers

Loading similar papers…