Deterministic Min-cut in Poly-logarithmic Max-flows.
Jason LiDebmalya PanigrahiPublished in: FOCS (2020)
Keyphrases
- min cut
- max flow min cut
- graph cuts
- energy minimization
- graph partitioning
- information theoretic
- image segmentation
- energy function
- pairwise
- global optimization
- markov random field
- shape prior
- interior point
- weighted graph
- connected components
- shape matching
- graph model
- undirected graph
- convex relaxation
- figure ground
- worst case
- prior knowledge