A spatially continuous max-flow and min-cut framework for binary labeling problems.

Jing Yuan Egil Bae Xue-Cheng Tai Yuri Boykov

Published in: Numerische Mathematik (2014)

Keyphrases

max flow
min cut
labeling problems
energy minimization
graph cuts
information theoretic
pairwise
energy function
graph partitioning
interactive segmentation
image segmentation
conditional random fields
undirected graph
convex relaxation
phase unwrapping
interior point