A capacity scaling algorithm for M-convex submodular flow.
Satoru IwataSatoko MoriguchiKazuo MurotaPublished in: Math. Program. (2005)
Keyphrases
- worst case
- improved algorithm
- objective function
- optimization algorithm
- computational complexity
- detection algorithm
- experimental evaluation
- significant improvement
- cost function
- clustering method
- computationally efficient
- np hard
- preprocessing
- times faster
- recognition algorithm
- maximum flow
- theoretical analysis
- simulated annealing
- learning algorithm
- high accuracy
- dynamic programming
- ant colony optimization
- image sequences
- globally optimal
- piecewise linear
- bayesian networks
- search algorithm
- search space
- matching algorithm
- tree structure
- linear programming
- computational cost
- probabilistic model
- segmentation algorithm
- expectation maximization