ENISLE: an intuitive heuristic nearly optimal solution for mincut and ratio mincut partitioning.
Shun-Wen ChengKuo-Hsing ChengPublished in: ISCAS (5) (2001)
Keyphrases
- min cut
- optimal solution
- lp relaxation
- graph cuts
- graph partitioning
- energy minimization
- linear programming
- interior point
- information theoretic
- minimum cut
- linear program
- markov random field
- feasible solution
- energy function
- pairwise
- image segmentation
- global optimization
- solution quality
- figure ground
- shape prior
- branch and bound
- knapsack problem
- linear programming problems
- np hard
- graph model
- approximate solutions
- message passing
- lower bound
- weighted graph
- metaheuristic
- undirected graph
- perceptual organization
- objective function
- shape matching
- global optimum
- search space
- belief propagation
- dynamic programming
- lagrangian relaxation
- integer programming
- simulated annealing
- mixed integer
- optimization problems
- search algorithm