Graph Cuts with Arbitrary Size Constraints Through Optimal Transport.
Chakib FettalLazhar LabiodMohamed NadifPublished in: CoRR (2024)
Keyphrases
- graph cuts
- arbitrary size
- globally optimal
- energy function
- energy minimization
- markov random field
- belief propagation
- spatial smoothness
- object segmentation
- hard constraints
- ordering constraints
- image segmentation
- multi label
- interactive image segmentation
- min cut
- shape prior
- shape constraints
- segmentation algorithm
- auxiliary variables
- spatial coherence
- interactive segmentation
- optimal solution
- mrf optimization
- max flow
- labeling problems
- computer vision
- energy minimization framework
- random walker
- graph cut segmentation
- loopy belief propagation
- active contours
- higher order
- object detection
- dynamic programming