An Experimental Comparison of Min-cut/Max-flow Algorithms for Energy Minimization in Vision
- 28 August 2001
- book chapter
- Published by Springer Nature
- p. 359-374
- https://doi.org/10.1007/3-540-44745-8_24
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Segmentation by grouping junctionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Markov random fields with efficient approximationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Interactive graph cuts for optimal boundary & region segmentation of objects in N-D imagesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Incorporating Spatial Priors into an Information Theoretic Approach for fMRI Data AnalysisPublished by Springer Nature ,2000
- Fast approximate energy minimization via graph cutsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1999
- Occlusions, discontinuities, and epipolar lines in stereoPublished by Springer Nature ,1998
- On Implementing the Push—Relabel Method for the Maximum Flow ProblemAlgorithmica, 1997
- Exact Maximum A Posteriori Estimation for Binary ImagesJournal of the Royal Statistical Society Series B: Statistical Methodology, 1989
- A new approach to the maximum-flow problemJournal of the ACM, 1988
- Flows in NetworksPublished by Walter de Gruyter GmbH ,1963