资源论文Segmentation with Non-linear Regional Constraints via Line-Search Cuts*

Segmentation with Non-linear Regional Constraints via Line-Search Cuts*

2020-04-02 | |  73 |   56 |   0

Abstract

This paper is concerned with energy-based image segmen- tation problems. We introduce a general class of regional functionals defined as an arbitrary non-linear combination of regional unary terms. Such (high-order) functionals are very useful in vision and medical ap- plications and some special cases appear in prior art. For example, our general class of functionals includes but is not restricted to soft con- straints on segment volume, its appearance histogram, or shape. Our overall segmentation energy combines regional functionals with standard length-based regularizers and/or other submodular terms. In general, regional functionals make the corresponding energy minimiza- tion NP-hard. We propose a new greedy algorithm based on iterative line search. A parametric max-flow technique efficiently explores all so- lutions along the direction (line) of the steepest descent of the energy. We compute the best “step size”, i.e. the globally optimal solution along the line. This algorithm can make large moves escaping weak local minima, as demonstrated on many real images.

上一篇:Dilated Divergence Based Scale-Space Representation for Curve Analysis

下一篇:A Particle Filter Framework for Contour Detection

用户评价
全部评价

热门资源

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...