A new approach to the maximum-flow problem
Journal of the ACM (JACM)
Combinatorial optimization
Occlusions, Discontinuities, and Epipolar Lines in Stereo
ECCV '98 Proceedings of the 5th European Conference on Computer Vision-Volume I - Volume I
Incorporating Spatial Priors into an Information Theoretic Approach for fMRI Data Analysis
MICCAI '00 Proceedings of the Third International Conference on Medical Image Computing and Computer-Assisted Intervention
Segmentation by Grouping Junctions
CVPR '98 Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition
Markov Random Fields with Efficient Approximations
CVPR '98 Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition
A Maximum-Flow Formulation of the N-Camera Stereo Correspondence Problem
ICCV '98 Proceedings of the Sixth International Conference on Computer Vision
Factorial Markov Random Fields
ECCV '02 Proceedings of the 7th European Conference on Computer Vision-Part III
Segmentation of Dynamic N-D Data Sets via Graph Cuts Using Markov Models
MICCAI '01 Proceedings of the 4th International Conference on Medical Image Computing and Computer-Assisted Intervention
Multi-camera Scene Reconstruction via Graph Cuts
ECCV '02 Proceedings of the 7th European Conference on Computer Vision-Part III
Space-Time Multi-Resolution Banded Graph-Cut for Fast Segmentation
Proceedings of the 30th DAGM symposium on Pattern Recognition
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
SSVM '09 Proceedings of the Second International Conference on Scale Space and Variational Methods in Computer Vision
Efficient Global Minimization for the Multiphase Chan-Vese Model of Image Segmentation
EMMCVPR '09 Proceedings of the 7th International Conference on Energy Minimization Methods in Computer Vision and Pattern Recognition
Extracting dense features for visual correspondence with graph cuts
CVPR'03 Proceedings of the 2003 IEEE computer society conference on Computer vision and pattern recognition
Texture based segmentation using graph cut and Gabor filters
Pattern Recognition and Image Analysis
Computing and fabricating multilayer models
Proceedings of the 2011 SIGGRAPH Asia Conference
EMMCVPR'11 Proceedings of the 8th international conference on Energy minimization methods in computer vision and pattern recognition
Reconstruction of structure and texture of city building facades
Programming and Computing Software
Color image segmentation based on an iterative graph cut algorithm using time-of-flight cameras
DAGM'11 Proceedings of the 33rd international conference on Pattern recognition
"Influence areas" as a tool for testing of image restoration methods
AICT'11 Proceedings of the 2nd international conference on Applied informatics and computing theory
Near real-time motion segmentation using graph cuts
DAGM'06 Proceedings of the 28th conference on Pattern Recognition
A multiple graph cut based approach for stereo analysis
DAGM'06 Proceedings of the 28th conference on Pattern Recognition
Graph-Based fast image segmentation
SSPR'06/SPR'06 Proceedings of the 2006 joint IAPR international conference on Structural, Syntactic, and Statistical Pattern Recognition
Interest region-based image retrieval system based on graph-cut segmentation and feature vectors
CIS'05 Proceedings of the 2005 international conference on Computational Intelligence and Security - Volume Part I
Smooth foreground-background segmentation for video processing
ACCV'06 Proceedings of the 7th Asian conference on Computer Vision - Volume Part II
MGRF controlled stochastic deformable model
SCIA'05 Proceedings of the 14th Scandinavian conference on Image Analysis
ECCV'06 Proceedings of the 9th European conference on Computer Vision - Volume Part II
An experimental facial synthesis system using graph cut and gradient domain fusion
Edutainment'06 Proceedings of the First international conference on Technologies for E-Learning and Digital Entertainment
An experimental facial synthesis system using graph cut and gradient domain fusion
Edutainment'06 Proceedings of the First international conference on Technologies for E-Learning and Digital Entertainment
On a linear programming approach to the discrete willmore boundary value problem and generalizations
Proceedings of the 7th international conference on Curves and Surfaces
Gabor filter and graph cut based texture analysis
Pattern Recognition and Image Analysis
Landmark-based non-rigid registration via graph cuts
ICIAR'07 Proceedings of the 4th international conference on Image Analysis and Recognition
Improving Graph Cuts algorithm to transform sequence of stereo image to depth map
Journal of Systems and Software
Hi-index | 0.00 |
After [10, 15, 12, 2, 4] minimum cut/maximum flow algorithms on graphs emerged as an increasingly useful tool for exact or approximate energy minimization in low-level vision. The combinatorial optimization literature provides many min-cut/max-flow algorithms with different polynomial time complexity. Their practical efficiency, however, has to date been studied mainly outside the scope of computer vision. The goal of this paper is to provide an experimental comparison of the efficiency of min-cut/max flow algorithms for energy minimization in vision. We compare the running times of several standard algorithms, as well as a new algorithm that we have recently developed. The algorithms we study include both Goldberg-style "push-relabel" methods and algorithms based on Ford-Fulkerson style augmenting paths. We benchmark these algorithms on a number of typical graphs in the contexts of image restoration, stereo, and interactive segmentation. In many cases our new algorithm works several times faster than any of the other methods making near real-time performance possible.