Extreme Min - Cut Max - Flow Algorithm.
Trust TawandaPhilimon NyamugureElias MunapoSantosh KumarPublished in: Int. J. Appl. Metaheuristic Comput. (2023)
Keyphrases
- objective function
- optimal solution
- dynamic programming
- computational complexity
- min cut max flow
- recently developed
- np hard
- linear programming
- maximum flow
- similarity measure
- probabilistic model
- markov random field
- active contours
- segmentation algorithm
- segmentation method
- information theoretic
- convergence rate
- max flow