Capacity Scaling for Graph Cuts in Vision


Capacity scaling is a hierarchical approach to graph representation that can improve theoretical complexity and practical efficiency of max-flow/min-cut algorithms. Introduced by Edmonds, Karp, and Dinic in 1972, capacity scaling is well known in the combinatorial optimization community. Surprisingly, this major performance improving technique is overlooked… (More)
DOI: 10.1109/ICCV.2007.4408970


10 Figures and Tables