In the last decade, graph-cut optimization has been popular for a variety of pixel labeling problems. Typically graph-cut methods are used to incorporate a smoothness prior on a l...
The recently introduced random walker segmentation algorithm of [14] has been shown to have desirable theoretical properties and to perform well on a wide variety of images in pra...
— In the last decade, graph-cut optimization has been popular for a variety of labeling problems. Typically graph-cut methods are used to incorporate smoothness constraints on a ...
The problem of interactive foreground/background segmentation in still images is of great practical importance in image editing. The state of the art in interactive segmentation is...
Andrew Blake, Carsten Rother, M. Brown, Patrick P&...
Abstract. Autonomous collision avoidance in vehicles requires an accurate seperation of obstacles from the background, particularly near the focus of expansion. In this paper, we p...
Andreas Wedel, Thomas Schoenemann, Thomas Brox, Da...