Sciweavers

Share
DAGM
2008
Springer

Space-Time Multi-Resolution Banded Graph-Cut for Fast Segmentation

8 years 9 months ago
Space-Time Multi-Resolution Banded Graph-Cut for Fast Segmentation
Abstract. Applying real-time segmentation is a major issue when processing every frame of image sequences. In this paper, we propose a modification of the well known graph-cut algorithm to improve speed for discrete segmentation. Our algorithm yields real-time segmentation, using graph-cut, by performing a single cut on an image with regions of different resolutions, combining space-time pyramids and narrow bands. This is especially suitable for image sequences, as segment borders in one image are refined in the next image. The fast computation time allows one to use information contained in every image frame of an input image stream at 20 Hz, on a standard PC. The algorithm is applied to traffic scenes, using a monocular camera installed in a moving vehicle. Our results show the segmentation of moving objects with similar results to standard graph-cut, but with improved speed.
Tobi Vaudrey, Daniel Gruber, Andreas Wedel, Jens K
Added 19 Oct 2010
Updated 19 Oct 2010
Type Conference
Year 2008
Where DAGM
Authors Tobi Vaudrey, Daniel Gruber, Andreas Wedel, Jens Klappstein
Comments (0)
books