A topological max-flow-min-cut theorem.

Robert Ghrist Sanjeevi Krishnan

Published in: GlobalSIP (2013)

Keyphrases

max flow min cut
digital topology
problems in computer vision
energy minimization
combinatorial optimization
min cut
viewpoint
connected components
optimal solution
computer vision
image segmentation
pairwise
mutual information
graph cuts
global optimization
approximation algorithms