On the Dynamic Behavior of the Min-Cut in Random Geometric Graphs.
Lennart GerdesMohit ThakurRalf KötterPublished in: ICC (2010)
Keyphrases
- dynamic behavior
- min cut
- graph partitioning
- graph cuts
- undirected graph
- energy minimization
- pairwise
- image segmentation
- energy function
- weighted graph
- graph model
- information theoretic
- global optimization
- data clustering
- shape prior
- markov random field
- interior point
- figure ground
- adjacency matrix
- lp relaxation
- shape matching
- graph matching
- d objects
- graph clustering
- perceptual organization
- low level
- biological systems
- shape descriptors
- directed graph