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

Space-Time Multi-Resolution Banded Graph-Cut for Fast Segmentation,10.1007/978-3-540-69321-5_21,Tobi Vaudrey,Daniel Gruber,Andreas Wedel,Jens Klappste

Space-Time Multi-Resolution Banded Graph-Cut for Fast Segmentation   (Citations: 4)
BibTex | RIS | RefWorks Download
Applying real-time segmentation is a major issue when pro- cessing every frame of image sequences. In this paper, we propose a modication 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 dierent resolutions, combining space-time pyramids and narrow bands. This is especially suitable for image sequences, as segment borders in one image are rened 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 traf- c 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.
Conference: DAGM Symposium Symposium for Pattern Recognition , pp. 203-213, 2008
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
Sort by: