MaxFlow Revisited: An Empirical Comparison of Maxflow Algorithms for Dense Vision Problems | Zendy

Tanmay Verma | Zendy; Dhruv Batra | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

MaxFlow Revisited: An Empirical Comparison of Maxflow Algorithms for Dense Vision Problems

Author(s) -

Tanmay Verma,

Dhruv Batra

Publication year - 2012

Language(s) - English

Resource type - Conference proceedings

DOI - 10.5244/c.26.61

Subject(s) - computer science , implementation , segmentation , image segmentation , deconvolution , artificial intelligence , maximum flow problem , minification , algorithm , image (mathematics) , object (grammar) , flow (mathematics) , computer vision , mathematical optimization , mathematics , geometry , programming language

Algorithms for finding the maximum amount of flow possible in a network (or maxflow) play a central role in computer vision problems. We present an empirical comparison of different max-flow algorithms on modern problems. Our problem instances arise from energy minimization problems in Object Category Segmentation, Image Deconvolution, Super Resolution, Texture Restoration, Character Completion and 3D Segmentation. We compare 14 different implementations and find that the most popularly used implementation of Kolmogorov [5] is no longer the fastest algorithm available, especially for dense graphs.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research