Fast Approximate Energy Minimization via Graph Cuts
IEEE Transactions on Pattern Analysis and Machine Intelligence
Computer Vision
An Experimental Comparison of Min-cut/Max-flow Algorithms for Energy Minimization in Vision
EMMCVPR '01 Proceedings of the Third International Workshop on Energy Minimization Methods in Computer Vision and Pattern Recognition
Geometric Level Set Methods in Imaging,Vision,and Graphics
Geometric Level Set Methods in Imaging,Vision,and Graphics
What Energy Functions Can Be Minimizedvia Graph Cuts?
IEEE Transactions on Pattern Analysis and Machine Intelligence
"GrabCut": interactive foreground extraction using iterated graph cuts
ACM SIGGRAPH 2004 Papers
Motion Competition: A Variational Approach to Piecewise Parametric Motion Segmentation
International Journal of Computer Vision
ACM SIGGRAPH 2005 Papers
A Multilevel Banded Graph Cuts Method for Fast Image Segmentation
ICCV '05 Proceedings of the Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1 - Volume 01
Effciently Solving Dynamic Markov Random Fields Using Graph Cuts
ICCV '05 Proceedings of the Tenth IEEE International Conference on Computer Vision - Volume 2
International Journal of Computer Vision
Real-Time Object Tracking for Augmented Reality Combining Graph Cuts and Optical Flow
ISMAR '07 Proceedings of the 2007 6th IEEE and ACM International Symposium on Mixed and Augmented Reality
WarpCut: fast obstacle segmentation in monocular video
Proceedings of the 29th DAGM conference on Pattern recognition
Accurate banded graph cut segmentation of thin structures using laplacian pyramids
MICCAI'06 Proceedings of the 9th international conference on Medical Image Computing and Computer-Assisted Intervention - Volume Part II
Moving Object Segmentation Using Optical Flow and Depth Information
PSIVT '09 Proceedings of the 3rd Pacific Rim Symposium on Advances in Image and Video Technology
Hi-index | 0.00 |
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.