Bicriteria Aggregation of Polygons via Graph Cuts.
Peter RottmannAnne DriemelHerman J. HaverkortHeiko RöglinJan-Henrik HaunertPublished in: GIScience (II) (2021)
Keyphrases
- graph cuts
- bicriteria
- efficient solutions
- energy function
- integer linear programming
- energy minimization
- belief propagation
- markov random field
- knapsack problem
- image segmentation
- flowshop
- shortest path problem
- graph cut optimization
- convex hull
- image processing
- optimization problems
- computational complexity
- optimal solution
- computer vision