Implementation and complexity of the watershed-from-markers algorithm computed as a minimal cost forest
Petr FelkelMario BruckschwaigerRainer WegenkittlPublished in: CoRR (2002)
Keyphrases
- minimal cost
- worst case
- computational cost
- space complexity
- computational complexity
- segmentation algorithm
- dynamic programming
- memetic algorithm
- cost function
- learning algorithm
- k means
- neural network
- objective function
- detection algorithm
- memory requirements
- image processing
- complexity analysis
- search space
- preprocessing
- multiscale
- ant colony optimization
- image segmentation
- parallel implementation