Revisiting a simple algorithm for the planar multiterminal cut problem.
Kevin K. H. CheungKyle HarveyPublished in: Oper. Res. Lett. (2010)
Keyphrases
- detection algorithm
- objective function
- times faster
- dynamic programming
- theoretical analysis
- computational cost
- search space
- k means
- preprocessing
- np hard
- experimental evaluation
- path planning
- high accuracy
- computationally efficient
- convex hull
- simulated annealing
- selection algorithm
- planar graphs
- matching algorithm
- tree structure
- neural network
- graph cuts
- input data
- linear programming
- worst case
- cost function
- data structure
- optimal solution
- image sequences