Bounds on Mincut for Cayley Graphs over Abelian Groups.
Vladimir LipetsPublished in: Theory Comput. Syst. (2009)
Keyphrases
- min cut
- graph partitioning
- graph cuts
- undirected graph
- upper bound
- worst case
- energy minimization
- lower bound
- pairwise
- information theoretic
- image segmentation
- weighted graph
- markov random field
- graph matching
- graph model
- energy function
- shape prior
- graph representation
- lower and upper bounds
- data objects
- graph structure
- mutual information
- similarity measure
- adjacency matrix
- image processing