Implementation and Complexity of the Watershed-from-Markers Algorithm Computed as a Minimal Cost Forest.
Petr FelkelMario BruckschwaigerRainer WegenkittlPublished in: Comput. Graph. Forum (2001)
Keyphrases
- minimal cost
- worst case
- segmentation algorithm
- computational complexity
- computational cost
- space complexity
- optimal solution
- dynamic programming
- complexity analysis
- k means
- learning algorithm
- parallel implementation
- detection algorithm
- energy function
- simulated annealing
- benchmark problems
- memory requirements
- expectation maximization
- np hard
- cost function
- high dimensional
- objective function