Segmentation with non-linear regional constraints via line-search cuts

Lena Gorelick, Frank R. Schmidt, Yuri Boykov, Andrew Delong, Aaron Ward

In European Conference on Computer Vision (ECCV), Part I, LNCS 7572, pp.583-597, Florence, Italy, October, 2012.

Abstract

This paper is concerned with energy-based image segmentation 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 applications and some special cases appear in prior art. For example, our general class of functionals includes but is not restricted to soft constraints 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 minimization NP-hard. We propose a new greedy algorithm based on iterative line search . A parametric max-flow technique efficiently explores all solutions 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.


WHOLE PAPER: pdf file (1.2Mb)

[an error occurred while processing this directive]