Using a Min-Cut Generalisation to Go Beyond Boolean Surjective VCSPs.
Gregor MatlStanislav ZivnýPublished in: Algorithmica (2020)
Keyphrases
- min cut
- graph cuts
- max flow min cut
- energy minimization
- information theoretic
- graph partitioning
- pairwise
- energy function
- global optimization
- markov random field
- image segmentation
- figure ground
- shape matching
- interior point
- shape prior
- undirected graph
- graph model
- convex relaxation
- spectral clustering
- prior knowledge
- mutual information