An experimental comparison of min-cut/max- flow algorithms for energy minimization in vision

Keywords

Algorithm, Computer science, Maximum flow problem, Minimum cut, Benchmark (surveying)

References

• Exact Maximum A Posteriori Estimation for Binary ImagesD. M. Greig, B. T. Porteous, Allan Seheult — 1989
• Stereo Without Epipolar Lines: A Maximum-Flow FormulationSébastien Roy — 1999
• Large Occlusion StereoAaron Bobick, Stephen Intille — 1999
• Geometric Level Set Methods in Imaging, Vision, and GraphicsStanley Osher, Nikos Paragios — 2011
• A maximum-flow formulation of the N-camera stereo correspondence problemSébastien Roy, Ingemar J. Cox — 1998
• Medical Image Computing and Computer-Assisted Intervention - MICCAI 2006, 9th International Conference, Copenhagen, Denmark, October 1-6, 2006, Proceedings, Part IIFranken, E.M., Rongen, P.M.J., Almsick, van, M.A. — 2006
• Faster shortest-path algorithms for planar graphsPhilip N. Klein, Satish Rao, Monika Rauch — 1994
• HETEROGENEOUS AGENT SYSTEMS, by V.S. Subrahmanian, Piero Bonatti, Jürgen Dix, Thomas Etier, Sarit Kraus, Fatma Ozcan and Robert Ross, MIT Press, Cambridge, Mass., 2000, xiv+580pp., ISBN 0-262-19436-8 (Hardback, £39.95).Alex M. Andrew — 2001
• Random sampling in cut, flow, and network design problemsDavid R. Karger — 1994
• Level Set Methods and Fast Marching MethodsMarko Suba�i� — 2003
• Graphcut textures: image and video synthesis using graph cutsVivek Kwatra, Arno Schödl, Irfan Essa — 2003
• Level set methods and dynamic implicit surfacesStanley Osher, Ronald Fedkiw — 2002
• Markov random fields with efficient approximationsYuri Boykov, Olga Veksler, Ramin Zabih — 1998
• What energy functions can be minimized via graph cuts?Vladimir Kolmogorov, Ramin Zabih — 2002
• A Taxonomy and Evaluation of Dense Two-Frame Stereo Correspondence AlgorithmsDaniel Scharstein, Rick Szeliski — 2001
• Computing geodesics and minimal surfaces via graph cutsBoykov, Kolmogorov — 2003
• Exact voxel occupancy with graph cutsD. Snow, Paul Viola, Ramin Zabih — 2000
• Computing visual correspondence with occlusions using graph cutsVladimir Kolmogorov, Ramin Zabih — 2001
• A new approach to the maximum flow problemAndrew V. Goldberg, Robert E. Tarjan — 1986
• Image segmentation by nested cutsOlga Veksler — 2000

Cited by

• Detecting Multilingual Lines of Text with Fusion MovesIgor Milevskiy — 2013
• Human Body Region Extraction from PhotosYi Hu — 2007
• Graph- based segmentation of skeletal striated muscles in NMR imagesPierre‐Yves Baudin — 2013
• Automated and interactive approaches for optimal surface finding based segmentation of medical image dataShanhui Sun — 2012
• Large-scale and high-quality multi-view stereoHoang Hiep Vu, KERIVEN, Renaud — 2012
• RADAR INTERFEROMETRY: 2D PHASE UNWRAPPING VIA GRAPH CUTSGonçalo Valadão, Matias, Luı́s Gouveia — 2006
• Performance of an automated segmentation algorithm for 3D MR renographyE Magdon, H. Cziharz — 2007
• Dense Stereo Matching with Robust Cost Funtions and Confidence-based Surface PriorKe Zhu — 2014
• Robust Image Segmentation Applied to Magnetic Resonance and Ultrasound Images of the Prostate. (Segmentation d'images robuste appliqué à l'imagerie par résonance magnétique et l'échographie de la prostate)Soumya Ghose — 2012
• An Experimental Comparison of Trust Region and Level SetsLena Gorelick, Ismail Ben Ayed, Frank R. Schmidt — 2013
• Automated Segmentation of Left and Right Ventricles in MRI and Classification of the Myocarfium AbnormalitiesCyrus M. S. Nambakhsh — 2013
• Image processing methods for human brain connectivity analysis from in-vivo diffusion MRIOscar Esteban Sanz-Dranguet — 2015
• ASSESSING MAP QUALITY AND ERROR CAUSATION USING CONDITIONAL RANDOM FIELDSManjari Chandran-Ramesh, Paul Newman — 2007
• Segmentation of synchrotron radiation micro-computed tomography images using energy minimization via graph cuts.Marilee J. Bresciani — 2012
• A Direct Approach Toward Global Minimization for Multiphase Labeling and Segmentation ProblemsYing Gu, Li-Lian Wang, Xue‐Cheng Tai — 2012
• Max-margin Learning for Lower Linear Envelope Potentials in Binary Markov Random FieldsStephen Jay Gould — 2011
• Vertebral Body Segmentation in MRI via Convex Relaxation and Distribution MatchingNuno Neto, Paulo Rebelo, Raquel Alves dos Santos — 2012
• Spine Image Fusion Via Graph CutsLluís Satorras — 2013
• Robust Model for Segmenting Images With/Without Intensity InhomogeneitiesGlenn Ammons, James R. Larus — 2013
• A Likelihood and Local Constraint Level Set Model for Liver Tumor Segmentation from CT VolumesC. Veitch, R. T. Gemmell — 2013

Related papers

• Polynomial flow-cut gaps and hardness of directed cut problemsJulia Chuzhoy, Sanjeev Khanna — 2007
• Polynomial Flow-Cut Gaps and Hardness of Directed Cut Problems (Extended Abstract)Julia Chuzhoy, Sanjeev Khanna — 2007
• Maximum Capacity-based Minimum Cut AlgorithmSang-Un Lee — 2011
• Polynomial flow-cut gaps and hardness of directed cut problemsJulia Chuzhoy, Sanjeev Khanna — 2009
• Unifying Maximum Cut and Minimum Cut of a Planar GraphWei‐Kuan Shih, Sun Wu, Y.S. Kuo — 1990
• Fully-Dynamic Cut Tree ConstructionTanja Hartmann, Dorothea Wagner — 2011